/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:04:36,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:04:36,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:04:36,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:04:36,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:04:36,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:04:36,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:04:36,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:04:36,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:04:36,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:04:36,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:04:36,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:04:36,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:04:36,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:04:36,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:04:36,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:04:36,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:04:36,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:04:36,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:04:36,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:04:36,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:04:36,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:04:36,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:04:36,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:04:36,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:04:36,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:04:36,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:04:36,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:04:36,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:04:36,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:04:36,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:04:36,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:04:36,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:04:36,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:04:36,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:04:36,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:04:36,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:04:36,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:04:36,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:04:36,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:04:36,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:04:36,554 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:04:36,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:04:36,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:04:36,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:04:36,570 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:04:36,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:04:36,570 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:04:36,571 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:04:36,571 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:04:36,571 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:04:36,571 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:04:36,571 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:04:36,571 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:04:36,572 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:04:36,572 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:04:36,572 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:04:36,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:04:36,572 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:04:36,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:04:36,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:04:36,573 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:04:36,573 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:04:36,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:04:36,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:04:36,574 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:04:36,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:04:36,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:04:36,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:04:36,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:04:36,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:04:36,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:04:36,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:04:36,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:04:36,758 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:04:36,758 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:04:36,759 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:04:36,826 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Ri9ZpV/tmp/ada0402b9ac8431bbe90941c353b248e/FLAGfdc0fd5dc [2020-07-01 13:04:37,159 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:04:37,160 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:04:37,160 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:04:37,167 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Ri9ZpV/tmp/ada0402b9ac8431bbe90941c353b248e/FLAGfdc0fd5dc [2020-07-01 13:04:37,562 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_Ri9ZpV/tmp/ada0402b9ac8431bbe90941c353b248e [2020-07-01 13:04:37,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:04:37,574 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:04:37,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:04:37,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:04:37,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:04:37,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd74fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37, skipping insertion in model container [2020-07-01 13:04:37,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:04:37,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:04:37,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:04:37,855 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:04:37,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:04:37,888 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:04:37,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37 WrapperNode [2020-07-01 13:04:37,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:04:37,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:04:37,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:04:37,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:04:37,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:04:37,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:04:37,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:04:37,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:04:37,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:04:37,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:04:37,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:04:37,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:04:37,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:04:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:04:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:04:38,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:04:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:04:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:04:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:04:38,264 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:04:38,264 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 13:04:38,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:04:38 BoogieIcfgContainer [2020-07-01 13:04:38,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:04:38,269 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:04:38,269 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:04:38,271 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:04:38,272 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:04:38" (1/1) ... [2020-07-01 13:04:38,286 INFO L313 BlockEncoder]: Initial Icfg 23 locations, 27 edges [2020-07-01 13:04:38,287 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:04:38,288 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:04:38,288 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:04:38,289 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:04:38,291 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:04:38,291 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:04:38,292 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:04:38,317 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:04:38,339 INFO L200 BlockEncoder]: SBE split 7 edges [2020-07-01 13:04:38,343 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:04:38,345 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:04:38,384 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 13:04:38,386 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:04:38,388 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:04:38,388 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:04:38,388 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:04:38,389 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:04:38,389 INFO L313 BlockEncoder]: Encoded RCFG 14 locations, 23 edges [2020-07-01 13:04:38,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:04:38 BasicIcfg [2020-07-01 13:04:38,390 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:04:38,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:04:38,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:04:38,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:04:38,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:04:37" (1/4) ... [2020-07-01 13:04:38,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef9115f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:04:38, skipping insertion in model container [2020-07-01 13:04:38,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (2/4) ... [2020-07-01 13:04:38,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef9115f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:04:38, skipping insertion in model container [2020-07-01 13:04:38,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:04:38" (3/4) ... [2020-07-01 13:04:38,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef9115f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:04:38, skipping insertion in model container [2020-07-01 13:04:38,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:04:38" (4/4) ... [2020-07-01 13:04:38,398 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:04:38,409 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:04:38,415 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-01 13:04:38,429 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-01 13:04:38,452 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:04:38,452 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:04:38,453 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:04:38,453 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:04:38,453 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:04:38,453 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:04:38,453 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:04:38,453 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:04:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-07-01 13:04:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:04:38,474 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:38,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:38,475 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:04:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash 124970235, now seen corresponding path program 1 times [2020-07-01 13:04:38,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:38,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276186765] [2020-07-01 13:04:38,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:38,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276186765] [2020-07-01 13:04:38,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:38,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:38,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147506580] [2020-07-01 13:04:38,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:38,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:38,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:38,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:38,684 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2020-07-01 13:04:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:38,763 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2020-07-01 13:04:38,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:38,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:04:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:38,776 INFO L225 Difference]: With dead ends: 14 [2020-07-01 13:04:38,776 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 13:04:38,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 13:04:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 13:04:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 13:04:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 13:04:38,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 5 [2020-07-01 13:04:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:38,815 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 13:04:38,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-01 13:04:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:04:38,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:38,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:38,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:04:38,818 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:04:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash 124970237, now seen corresponding path program 1 times [2020-07-01 13:04:38,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:38,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187627778] [2020-07-01 13:04:38,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:38,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187627778] [2020-07-01 13:04:38,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:38,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:38,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575902027] [2020-07-01 13:04:38,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:38,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:38,858 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2020-07-01 13:04:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:38,921 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2020-07-01 13:04:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:38,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:04:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:38,922 INFO L225 Difference]: With dead ends: 22 [2020-07-01 13:04:38,922 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 13:04:38,923 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 13:04:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2020-07-01 13:04:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:04:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-07-01 13:04:38,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2020-07-01 13:04:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:38,929 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-07-01 13:04:38,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-01 13:04:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:04:38,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:38,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:38,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:04:38,930 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:04:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash 124970238, now seen corresponding path program 1 times [2020-07-01 13:04:38,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:38,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175513758] [2020-07-01 13:04:38,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:38,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175513758] [2020-07-01 13:04:38,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:38,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:04:38,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791107074] [2020-07-01 13:04:38,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:04:38,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:38,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:04:38,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:04:38,985 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 4 states. [2020-07-01 13:04:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:39,062 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-01 13:04:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:04:39,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 13:04:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:39,064 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:04:39,064 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:04:39,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:04:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:04:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 13:04:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:04:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2020-07-01 13:04:39,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 5 [2020-07-01 13:04:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:39,069 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-01 13:04:39,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:04:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2020-07-01 13:04:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 13:04:39,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:39,070 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:04:39,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:04:39,070 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:04:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:39,070 INFO L82 PathProgramCache]: Analyzing trace with hash -749255148, now seen corresponding path program 1 times [2020-07-01 13:04:39,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:39,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205439389] [2020-07-01 13:04:39,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:39,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205439389] [2020-07-01 13:04:39,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354193690] [2020-07-01 13:04:39,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,165 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 13:04:39,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:04:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:39,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:04:39,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2020-07-01 13:04:39,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443780940] [2020-07-01 13:04:39,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:04:39,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:39,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:04:39,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:04:39,230 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 5 states. [2020-07-01 13:04:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:39,336 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2020-07-01 13:04:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:04:39,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 13:04:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:39,338 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:04:39,338 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:04:39,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-01 13:04:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:04:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 13:04:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:04:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-01 13:04:39,342 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 8 [2020-07-01 13:04:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:39,343 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-01 13:04:39,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:04:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-01 13:04:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 13:04:39,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:39,343 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:04:39,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:39,545 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:04:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1351656611, now seen corresponding path program 1 times [2020-07-01 13:04:39,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:39,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512381935] [2020-07-01 13:04:39,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:39,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512381935] [2020-07-01 13:04:39,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725952340] [2020-07-01 13:04:39,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:04:39,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:04:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:39,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:04:39,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-07-01 13:04:39,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036491781] [2020-07-01 13:04:39,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:04:39,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:04:39,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:04:39,649 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 4 states. [2020-07-01 13:04:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:39,696 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-01 13:04:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:04:39,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-01 13:04:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:39,698 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:04:39,698 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:04:39,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:04:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:04:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 13:04:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:04:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-07-01 13:04:39,703 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2020-07-01 13:04:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:39,703 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-01 13:04:39,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:04:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-01 13:04:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 13:04:39,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:39,704 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:04:39,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:39,905 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:04:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:39,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1351656610, now seen corresponding path program 1 times [2020-07-01 13:04:39,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:39,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118600892] [2020-07-01 13:04:39,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:04:39,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118600892] [2020-07-01 13:04:39,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663565106] [2020-07-01 13:04:39,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:40,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 13:04:40,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:04:40,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-01 13:04:40,052 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:04:40,061 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:04:40,066 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:04:40,066 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:22 [2020-07-01 13:04:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:04:40,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:04:40,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-07-01 13:04:40,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486730801] [2020-07-01 13:04:40,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:04:40,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:40,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:04:40,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:04:40,109 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2020-07-01 13:04:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:40,245 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-01 13:04:40,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:04:40,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-01 13:04:40,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:40,247 INFO L225 Difference]: With dead ends: 16 [2020-07-01 13:04:40,247 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:04:40,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:04:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:04:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:04:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:04:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:04:40,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2020-07-01 13:04:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:40,248 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:04:40,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:04:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:04:40,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:04:40,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:40,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:04:40,674 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-07-01 13:04:40,837 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-07-01 13:04:40,840 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:04:40,840 INFO L268 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-07-01 13:04:40,840 INFO L268 CegarLoopResult]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2020-07-01 13:04:40,840 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:04:40,841 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:04:40,841 INFO L268 CegarLoopResult]: For program point L10-1(lines 10 13) no Hoare annotation was computed. [2020-07-01 13:04:40,841 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:04:40,841 INFO L268 CegarLoopResult]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-07-01 13:04:40,841 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:04:40,841 INFO L264 CegarLoopResult]: At program point L10-3(lines 10 13) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) (.cse2 (select |#length| ULTIMATE.start_test_fun_~a.base)) (.cse1 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse3 (= 0 ULTIMATE.start_test_fun_~a.offset))) (or (let ((.cse4 (div (* .cse2 (- 1)) (- 4)))) (and .cse0 .cse1 (= 0 (mod (* .cse2 3) (- 4))) .cse3 (<= ULTIMATE.start_test_fun_~N .cse4) (<= 0 ULTIMATE.start_test_fun_~i~0) (<= (+ ULTIMATE.start_test_fun_~i~0 1) .cse4))) (and .cse0 (<= 4 .cse2) .cse1 (<= ULTIMATE.start_main_~array_size~0 1) (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0) .cse3))) [2020-07-01 13:04:40,842 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:04:40,842 INFO L264 CegarLoopResult]: At program point L9-3(lines 9 14) the Hoare annotation is: (let ((.cse10 (select |#length| ULTIMATE.start_test_fun_~a.base))) (let ((.cse3 (= 0 (mod (* .cse10 3) (- 4)))) (.cse5 (<= ULTIMATE.start_test_fun_~N (div (* .cse10 (- 1)) (- 4)))) (.cse7 (<= 1 ULTIMATE.start_test_fun_~i~0)) (.cse0 (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) (.cse1 (<= 4 .cse10)) (.cse2 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse8 (<= ULTIMATE.start_main_~array_size~0 1)) (.cse9 (<= ULTIMATE.start_test_fun_~N 1)) (.cse4 (= 0 ULTIMATE.start_test_fun_~a.offset)) (.cse6 (<= 0 ULTIMATE.start_test_fun_~i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse2 .cse8 .cse9 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse6)))) [2020-07-01 13:04:40,842 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:04:40,842 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:04:40,844 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:04:40,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,869 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:04:40 BasicIcfg [2020-07-01 13:04:40,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:04:40,871 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:04:40,872 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:04:40,875 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:04:40,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,876 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:04:37" (1/5) ... [2020-07-01 13:04:40,876 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ea9a43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:04:40, skipping insertion in model container [2020-07-01 13:04:40,877 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (2/5) ... [2020-07-01 13:04:40,877 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ea9a43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:04:40, skipping insertion in model container [2020-07-01 13:04:40,878 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:04:38" (3/5) ... [2020-07-01 13:04:40,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ea9a43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:04:40, skipping insertion in model container [2020-07-01 13:04:40,878 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:04:38" (4/5) ... [2020-07-01 13:04:40,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ea9a43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:04:40, skipping insertion in model container [2020-07-01 13:04:40,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:04:40" (5/5) ... [2020-07-01 13:04:40,880 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:04:40,906 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:04:40,906 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:04:40,906 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:04:40,907 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:04:40,907 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:04:40,907 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:04:40,907 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:04:40,907 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:04:40,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-01 13:04:40,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 13:04:40,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:04:40,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:04:40,919 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 13:04:40,919 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 13:04:40,920 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:04:40,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-01 13:04:40,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 13:04:40,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:04:40,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:04:40,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 13:04:40,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 13:04:40,927 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [102] ULTIMATE.startENTRY-->L20: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_13|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ret7, #NULL.base] 12#L20true [78] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 7#L20-2true [89] L20-2-->L9-3: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_test_fun_~res~0_1 0) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_test_fun_~i~0_1 0) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_2| (* v_ULTIMATE.start_main_~array_size~0_7 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_1|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~post3=|v_ULTIMATE.start_test_fun_#t~post3_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, ULTIMATE.start_test_fun_#t~post4=|v_ULTIMATE.start_test_fun_#t~post4_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~post3, ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post4, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_test_fun_#res, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 4#L9-3true [2020-07-01 13:04:40,927 INFO L796 eck$LassoCheckResult]: Loop: 4#L9-3true [55] L9-3-->L10-3: Formula: (< v_ULTIMATE.start_test_fun_~i~0_5 v_ULTIMATE.start_test_fun_~N_4) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_5} AuxVars[] AssignedVars[] 6#L10-3true [57] L10-3-->L10-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_test_fun_~i~0_6))) (and (= 1 (select |v_#valid_5| v_ULTIMATE.start_test_fun_~a.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse0 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) (+ v_ULTIMATE.start_test_fun_~a.offset_3 (* v_ULTIMATE.start_test_fun_~i~0_6 4)))) (<= 0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse0)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 10#L10-1true [105] L10-1-->L9-3: Formula: (and (= (+ v_ULTIMATE.start_test_fun_~i~0_17 1) v_ULTIMATE.start_test_fun_~i~0_16) (<= |v_ULTIMATE.start_test_fun_#t~mem1_8| 0)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_8|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_17} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_7|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 4#L9-3true [2020-07-01 13:04:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:40,928 INFO L82 PathProgramCache]: Analyzing trace with hash 130320, now seen corresponding path program 1 times [2020-07-01 13:04:40,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:40,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212543809] [2020-07-01 13:04:40,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:40,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212543809] [2020-07-01 13:04:40,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:40,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 13:04:40,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521362707] [2020-07-01 13:04:40,946 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:04:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:40,947 INFO L82 PathProgramCache]: Analyzing trace with hash 84518, now seen corresponding path program 1 times [2020-07-01 13:04:40,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:40,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146153328] [2020-07-01 13:04:40,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:04:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:04:40,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:04:41,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:41,018 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2020-07-01 13:04:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:41,038 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. [2020-07-01 13:04:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:41,041 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:04:41,044 INFO L168 Benchmark]: Toolchain (without parser) took 3469.98 ms. Allocated memory was 649.6 MB in the beginning and 753.4 MB in the end (delta: 103.8 MB). Free memory was 561.7 MB in the beginning and 706.1 MB in the end (delta: -144.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:04:41,044 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:04:41,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.98 ms. Allocated memory was 649.6 MB in the beginning and 693.1 MB in the end (delta: 43.5 MB). Free memory was 561.7 MB in the beginning and 655.8 MB in the end (delta: -94.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:41,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.04 ms. Allocated memory is still 693.1 MB. Free memory was 654.7 MB in the beginning and 653.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:41,046 INFO L168 Benchmark]: Boogie Preprocessor took 25.59 ms. Allocated memory is still 693.1 MB. Free memory was 653.7 MB in the beginning and 651.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:41,047 INFO L168 Benchmark]: RCFGBuilder took 312.56 ms. Allocated memory is still 693.1 MB. Free memory was 651.5 MB in the beginning and 631.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:41,047 INFO L168 Benchmark]: BlockEncodingV2 took 121.05 ms. Allocated memory is still 693.1 MB. Free memory was 631.5 MB in the beginning and 622.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:41,048 INFO L168 Benchmark]: TraceAbstraction took 2480.00 ms. Allocated memory is still 693.1 MB. Free memory was 622.8 MB in the beginning and 412.1 MB in the end (delta: 210.7 MB). Peak memory consumption was 210.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:41,048 INFO L168 Benchmark]: BuchiAutomizer took 170.86 ms. Allocated memory was 693.1 MB in the beginning and 753.4 MB in the end (delta: 60.3 MB). Free memory was 411.0 MB in the beginning and 706.1 MB in the end (delta: -295.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:04:41,052 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 23 locations, 27 edges - StatisticsResult: Encoded RCFG 14 locations, 23 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 313.98 ms. Allocated memory was 649.6 MB in the beginning and 693.1 MB in the end (delta: 43.5 MB). Free memory was 561.7 MB in the beginning and 655.8 MB in the end (delta: -94.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.04 ms. Allocated memory is still 693.1 MB. Free memory was 654.7 MB in the beginning and 653.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.59 ms. Allocated memory is still 693.1 MB. Free memory was 653.7 MB in the beginning and 651.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 312.56 ms. Allocated memory is still 693.1 MB. Free memory was 651.5 MB in the beginning and 631.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 121.05 ms. Allocated memory is still 693.1 MB. Free memory was 631.5 MB in the beginning and 622.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2480.00 ms. Allocated memory is still 693.1 MB. Free memory was 622.8 MB in the beginning and 412.1 MB in the end (delta: 210.7 MB). Peak memory consumption was 210.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 170.86 ms. Allocated memory was 693.1 MB in the beginning and 753.4 MB in the end (delta: 60.3 MB). Free memory was 411.0 MB in the beginning and 706.1 MB in the end (delta: -295.1 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 13:04:41,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[a] && 4 <= unknown-#length-unknown[a]) && 1 <= array_size) && 0 == unknown-#length-unknown[a] * 3 % -4) && 0 == a) && N <= unknown-#length-unknown[a] * -1 / -4) && 0 <= i) || (((((1 == \valid[a] && 1 <= array_size) && 0 == unknown-#length-unknown[a] * 3 % -4) && 0 == a) && N <= unknown-#length-unknown[a] * -1 / -4) && 1 <= i)) || ((((1 == \valid[a] && 1 <= array_size) && array_size <= 1) && N <= 1) && 1 <= i)) || ((((((1 == \valid[a] && 4 <= unknown-#length-unknown[a]) && 1 <= array_size) && array_size <= 1) && N <= 1) && 0 == a) && 0 <= i) - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 13:04:41,065 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,065 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,065 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,066 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,066 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:41,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((1 == \valid[a] && 1 <= array_size) && 0 == unknown-#length-unknown[a] * 3 % -4) && 0 == a) && N <= unknown-#length-unknown[a] * -1 / -4) && 0 <= i) && i + 1 <= unknown-#length-unknown[a] * -1 / -4) || ((((((1 == \valid[a] && 4 <= unknown-#length-unknown[a]) && 1 <= array_size) && array_size <= 1) && N <= 1) && 0 == i) && 0 == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 SDtfs, 75 SDslu, 40 SDs, 0 SdLazy, 153 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 9 NumberOfFragments, 187 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 73 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 2443 SizeOfPredicates, 16 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:04:34.354 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_Ri9ZpV/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:04:41.293 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check