/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:15:23,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:15:23,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:15:23,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:15:23,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:15:23,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:15:23,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:15:23,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:15:23,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:15:23,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:15:23,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:15:23,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:15:23,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:15:23,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:15:23,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:15:23,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:15:23,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:15:23,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:15:23,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:15:23,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:15:23,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:15:23,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:15:23,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:15:23,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:15:23,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:15:23,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:15:23,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:15:23,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:15:23,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:15:23,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:15:23,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:15:23,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:15:23,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:15:23,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:15:23,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:15:23,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:15:23,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:15:23,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:15:23,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:15:23,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:15:23,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:15:23,739 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:15:23,753 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:15:23,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:15:23,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:15:23,755 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:15:23,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:15:23,755 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:15:23,755 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:15:23,755 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:15:23,756 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:15:23,756 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:15:23,756 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:15:23,756 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:15:23,756 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:15:23,756 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:15:23,757 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:15:23,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:15:23,757 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:15:23,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:15:23,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:15:23,757 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:15:23,758 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:15:23,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:15:23,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:15:23,758 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:15:23,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:15:23,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:15:23,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:15:23,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:15:23,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:15:23,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:15:23,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:15:23,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:15:23,939 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:15:23,940 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:15:23,940 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:15:24,007 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_MOrOK3/tmp/95c2625ba90845fa90bde317f399b677/FLAGde4810e2d [2020-07-01 13:15:24,390 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:15:24,391 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:15:24,403 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_MOrOK3/tmp/95c2625ba90845fa90bde317f399b677/FLAGde4810e2d [2020-07-01 13:15:24,744 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_MOrOK3/tmp/95c2625ba90845fa90bde317f399b677 [2020-07-01 13:15:24,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:15:24,757 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:15:24,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:15:24,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:15:24,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:15:24,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:15:24" (1/1) ... [2020-07-01 13:15:24,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508c1a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:24, skipping insertion in model container [2020-07-01 13:15:24,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:15:24" (1/1) ... [2020-07-01 13:15:24,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:15:24,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:15:25,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:15:25,149 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:15:25,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:15:25,237 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:15:25,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25 WrapperNode [2020-07-01 13:15:25,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:15:25,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:15:25,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:15:25,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:15:25,248 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:15:25" (1/1) ... [2020-07-01 13:15:25,263 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:15:25" (1/1) ... [2020-07-01 13:15:25,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:15:25,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:15:25,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:15:25,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:15:25,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:15:25,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:15:25,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:15:25,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:15:25,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (1/1) ... No working directory specified, using /export/starexec/sandbox/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:15:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:15:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:15:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-01 13:15:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:15:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:15:25,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:15:25,653 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:15:25,654 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-01 13:15:25,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:25 BoogieIcfgContainer [2020-07-01 13:15:25,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:15:25,658 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:15:25,658 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:15:25,660 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:15:25,661 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:25" (1/1) ... [2020-07-01 13:15:25,675 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 36 edges [2020-07-01 13:15:25,677 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:15:25,678 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:15:25,678 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:15:25,679 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:15:25,681 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:15:25,682 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:15:25,682 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:15:25,707 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:15:25,734 INFO L200 BlockEncoder]: SBE split 14 edges [2020-07-01 13:15:25,740 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-07-01 13:15:25,741 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:15:25,773 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 13:15:25,776 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 13:15:25,777 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:15:25,778 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:15:25,778 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:15:25,778 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:15:25,779 INFO L313 BlockEncoder]: Encoded RCFG 20 locations, 37 edges [2020-07-01 13:15:25,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:15:25 BasicIcfg [2020-07-01 13:15:25,779 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:15:25,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:15:25,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:15:25,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:15:25,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:15:24" (1/4) ... [2020-07-01 13:15:25,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6c337c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (2/4) ... [2020-07-01 13:15:25,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6c337c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:25" (3/4) ... [2020-07-01 13:15:25,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6c337c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:15:25, skipping insertion in model container [2020-07-01 13:15:25,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:15:25" (4/4) ... [2020-07-01 13:15:25,788 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:15:25,800 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:15:25,808 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-07-01 13:15:25,822 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-07-01 13:15:25,847 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:15:25,847 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:15:25,848 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:15:25,848 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:15:25,848 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:15:25,848 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:15:25,848 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:15:25,848 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:15:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-01 13:15:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:15:25,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:25,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:15:25,871 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:25,877 INFO L82 PathProgramCache]: Analyzing trace with hash 5542340, now seen corresponding path program 1 times [2020-07-01 13:15:25,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:25,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049666903] [2020-07-01 13:15:25,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:26,059 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:15:26,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049666903] [2020-07-01 13:15:26,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:26,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:26,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832951877] [2020-07-01 13:15:26,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:26,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:26,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:26,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:26,085 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2020-07-01 13:15:26,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:26,199 INFO L93 Difference]: Finished difference Result 20 states and 37 transitions. [2020-07-01 13:15:26,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:26,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:15:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:26,214 INFO L225 Difference]: With dead ends: 20 [2020-07-01 13:15:26,214 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 13:15:26,217 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:15:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 13:15:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 13:15:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:15:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2020-07-01 13:15:26,254 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 4 [2020-07-01 13:15:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:26,255 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2020-07-01 13:15:26,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2020-07-01 13:15:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:15:26,256 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:26,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:15:26,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:15:26,258 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash 5542342, now seen corresponding path program 1 times [2020-07-01 13:15:26,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:26,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826100891] [2020-07-01 13:15:26,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:26,302 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:15:26,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826100891] [2020-07-01 13:15:26,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:26,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:26,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020456711] [2020-07-01 13:15:26,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:15:26,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:26,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:15:26,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:26,306 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 4 states. [2020-07-01 13:15:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:26,423 INFO L93 Difference]: Finished difference Result 19 states and 35 transitions. [2020-07-01 13:15:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:15:26,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 13:15:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:26,424 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:15:26,425 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 13:15:26,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:15:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 13:15:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 13:15:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 13:15:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2020-07-01 13:15:26,430 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 4 [2020-07-01 13:15:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:26,431 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2020-07-01 13:15:26,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:15:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2020-07-01 13:15:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:15:26,431 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:26,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:15:26,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:15:26,432 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1031246222, now seen corresponding path program 1 times [2020-07-01 13:15:26,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:26,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110341707] [2020-07-01 13:15:26,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:26,489 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:15:26,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110341707] [2020-07-01 13:15:26,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:26,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:26,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968589882] [2020-07-01 13:15:26,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:15:26,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:26,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:26,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:26,492 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 3 states. [2020-07-01 13:15:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:26,549 INFO L93 Difference]: Finished difference Result 18 states and 33 transitions. [2020-07-01 13:15:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:26,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:15:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:26,550 INFO L225 Difference]: With dead ends: 18 [2020-07-01 13:15:26,551 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 13:15:26,551 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:15:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 13:15:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 13:15:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 13:15:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-07-01 13:15:26,555 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 6 [2020-07-01 13:15:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:26,555 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2020-07-01 13:15:26,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:15:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2020-07-01 13:15:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:15:26,556 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:26,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:15:26,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:15:26,556 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:26,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1031246224, now seen corresponding path program 1 times [2020-07-01 13:15:26,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:26,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634904415] [2020-07-01 13:15:26,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:26,601 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:15:26,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634904415] [2020-07-01 13:15:26,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:26,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:15:26,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809977978] [2020-07-01 13:15:26,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:15:26,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:26,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:15:26,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:26,603 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 4 states. [2020-07-01 13:15:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:26,696 INFO L93 Difference]: Finished difference Result 31 states and 52 transitions. [2020-07-01 13:15:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:15:26,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 13:15:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:26,698 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:15:26,698 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 13:15:26,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 13:15:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2020-07-01 13:15:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:15:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2020-07-01 13:15:26,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 6 [2020-07-01 13:15:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:26,704 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2020-07-01 13:15:26,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:15:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2020-07-01 13:15:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:15:26,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:26,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:15:26,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:15:26,706 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:26,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1031246225, now seen corresponding path program 1 times [2020-07-01 13:15:26,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:26,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470613194] [2020-07-01 13:15:26,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:26,812 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:15:26,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470613194] [2020-07-01 13:15:26,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:26,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:15:26,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503863416] [2020-07-01 13:15:26,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:15:26,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:26,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:15:26,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:15:26,814 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 6 states. [2020-07-01 13:15:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:26,954 INFO L93 Difference]: Finished difference Result 40 states and 67 transitions. [2020-07-01 13:15:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:15:26,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-07-01 13:15:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:26,979 INFO L225 Difference]: With dead ends: 40 [2020-07-01 13:15:26,979 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 13:15:26,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:15:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 13:15:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2020-07-01 13:15:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:15:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2020-07-01 13:15:26,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 [2020-07-01 13:15:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:26,985 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. [2020-07-01 13:15:26,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:15:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. [2020-07-01 13:15:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 13:15:26,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:26,986 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:26,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:15:26,986 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:26,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1109803176, now seen corresponding path program 1 times [2020-07-01 13:15:26,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:26,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986980497] [2020-07-01 13:15:26,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:27,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986980497] [2020-07-01 13:15:27,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757137208] [2020-07-01 13:15:27,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/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:15:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:15:27,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:27,133 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:15:27,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:15:27,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2020-07-01 13:15:27,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978642309] [2020-07-01 13:15:27,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:15:27,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:15:27,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:15:27,135 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 5 states. [2020-07-01 13:15:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,253 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2020-07-01 13:15:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:15:27,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 13:15:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:27,254 INFO L225 Difference]: With dead ends: 49 [2020-07-01 13:15:27,254 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:15:27,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:15:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:15:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2020-07-01 13:15:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 13:15:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2020-07-01 13:15:27,260 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 8 [2020-07-01 13:15:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:27,261 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2020-07-01 13:15:27,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:15:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-07-01 13:15:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 13:15:27,262 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:27,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:27,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-01 13:15:27,463 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash -44092402, now seen corresponding path program 1 times [2020-07-01 13:15:27,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414429275] [2020-07-01 13:15:27,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:27,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414429275] [2020-07-01 13:15:27,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:27,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:15:27,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466282304] [2020-07-01 13:15:27,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:15:27,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:15:27,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:27,522 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 4 states. [2020-07-01 13:15:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,582 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. [2020-07-01 13:15:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:27,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-01 13:15:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:27,584 INFO L225 Difference]: With dead ends: 26 [2020-07-01 13:15:27,584 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 13:15:27,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 13:15:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 13:15:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 13:15:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 39 transitions. [2020-07-01 13:15:27,589 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 39 transitions. Word has length 9 [2020-07-01 13:15:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:27,590 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 39 transitions. [2020-07-01 13:15:27,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:15:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. [2020-07-01 13:15:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 13:15:27,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:27,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:27,591 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:15:27,591 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:27,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,591 INFO L82 PathProgramCache]: Analyzing trace with hash -44092400, now seen corresponding path program 1 times [2020-07-01 13:15:27,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100241388] [2020-07-01 13:15:27,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:27,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100241388] [2020-07-01 13:15:27,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:27,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:15:27,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651886029] [2020-07-01 13:15:27,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:15:27,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:15:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:15:27,667 INFO L87 Difference]: Start difference. First operand 23 states and 39 transitions. Second operand 6 states. [2020-07-01 13:15:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,770 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. [2020-07-01 13:15:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:15:27,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-01 13:15:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:27,771 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:15:27,771 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 13:15:27,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:15:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 13:15:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 13:15:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 13:15:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-07-01 13:15:27,777 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 9 [2020-07-01 13:15:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:27,777 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-07-01 13:15:27,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:15:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-07-01 13:15:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 13:15:27,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:27,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:27,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:15:27,779 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash -44092399, now seen corresponding path program 1 times [2020-07-01 13:15:27,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623054273] [2020-07-01 13:15:27,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:27,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623054273] [2020-07-01 13:15:27,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:27,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:15:27,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227739504] [2020-07-01 13:15:27,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:15:27,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:15:27,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:27,817 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 4 states. [2020-07-01 13:15:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:27,869 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-07-01 13:15:27,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:15:27,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-01 13:15:27,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:27,870 INFO L225 Difference]: With dead ends: 23 [2020-07-01 13:15:27,870 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 13:15:27,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 13:15:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 13:15:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 13:15:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2020-07-01 13:15:27,876 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 9 [2020-07-01 13:15:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:27,876 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. [2020-07-01 13:15:27,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:15:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-07-01 13:15:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 13:15:27,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:27,877 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:27,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:15:27,878 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash 899371689, now seen corresponding path program 1 times [2020-07-01 13:15:27,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:27,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769677928] [2020-07-01 13:15:27,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:27,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769677928] [2020-07-01 13:15:27,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134738757] [2020-07-01 13:15:27,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/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:15:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:27,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 13:15:27,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:27,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:15:27,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2020-07-01 13:15:27,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759116746] [2020-07-01 13:15:27,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:15:27,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:27,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:15:27,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:15:27,989 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 5 states. [2020-07-01 13:15:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,059 INFO L93 Difference]: Finished difference Result 29 states and 45 transitions. [2020-07-01 13:15:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:15:28,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-01 13:15:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,060 INFO L225 Difference]: With dead ends: 29 [2020-07-01 13:15:28,060 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:15:28,061 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:15:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:15:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2020-07-01 13:15:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 13:15:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2020-07-01 13:15:28,066 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 9 [2020-07-01 13:15:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,066 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 36 transitions. [2020-07-01 13:15:28,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:15:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 36 transitions. [2020-07-01 13:15:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 13:15:28,067 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:28,067 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:28,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 13:15:28,268 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:28,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash 899371690, now seen corresponding path program 1 times [2020-07-01 13:15:28,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:28,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524039955] [2020-07-01 13:15:28,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524039955] [2020-07-01 13:15:28,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438101470] [2020-07-01 13:15:28,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/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:15:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:28,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 13:15:28,430 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:28,488 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2020-07-01 13:15:28,488 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 1 case distinctions, treesize of input 13 treesize of output 15 [2020-07-01 13:15:28,489 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:15:28,496 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:15:28,503 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:15:28,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:29 [2020-07-01 13:15:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:28,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:15:28,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-01 13:15:28,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197146292] [2020-07-01 13:15:28,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 13:15:28,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:28,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 13:15:28,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-01 13:15:28,583 INFO L87 Difference]: Start difference. First operand 22 states and 36 transitions. Second operand 11 states. [2020-07-01 13:15:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:28,934 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2020-07-01 13:15:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 13:15:28,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2020-07-01 13:15:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:28,936 INFO L225 Difference]: With dead ends: 42 [2020-07-01 13:15:28,936 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 13:15:28,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:15:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 13:15:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2020-07-01 13:15:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 13:15:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2020-07-01 13:15:28,943 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 9 [2020-07-01 13:15:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:28,943 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 37 transitions. [2020-07-01 13:15:28,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 13:15:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. [2020-07-01 13:15:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:15:28,944 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:28,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:29,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-01 13:15:29,145 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:29,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1366865958, now seen corresponding path program 1 times [2020-07-01 13:15:29,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:29,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729082785] [2020-07-01 13:15:29,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:29,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729082785] [2020-07-01 13:15:29,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:29,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:15:29,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875173528] [2020-07-01 13:15:29,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:15:29,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:29,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:15:29,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:15:29,191 INFO L87 Difference]: Start difference. First operand 23 states and 37 transitions. Second operand 5 states. [2020-07-01 13:15:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:29,258 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. [2020-07-01 13:15:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:15:29,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 13:15:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:29,259 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:15:29,259 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 13:15:29,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:15:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 13:15:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 13:15:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 13:15:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2020-07-01 13:15:29,266 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 10 [2020-07-01 13:15:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:29,266 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 36 transitions. [2020-07-01 13:15:29,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:15:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 36 transitions. [2020-07-01 13:15:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:15:29,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:29,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:29,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 13:15:29,267 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:29,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:29,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1366865957, now seen corresponding path program 1 times [2020-07-01 13:15:29,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:29,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850386992] [2020-07-01 13:15:29,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:29,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850386992] [2020-07-01 13:15:29,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:29,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:29,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371907377] [2020-07-01 13:15:29,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:15:29,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:29,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:15:29,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:29,301 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. Second operand 4 states. [2020-07-01 13:15:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:29,375 INFO L93 Difference]: Finished difference Result 25 states and 38 transitions. [2020-07-01 13:15:29,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:15:29,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 13:15:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:29,376 INFO L225 Difference]: With dead ends: 25 [2020-07-01 13:15:29,376 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 13:15:29,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:15:29,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 13:15:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-01 13:15:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:15:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-07-01 13:15:29,381 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 10 [2020-07-01 13:15:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:29,381 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-07-01 13:15:29,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:15:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. [2020-07-01 13:15:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 13:15:29,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:29,382 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:29,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 13:15:29,382 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:29,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1176710175, now seen corresponding path program 1 times [2020-07-01 13:15:29,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:29,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636603178] [2020-07-01 13:15:29,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 13:15:29,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636603178] [2020-07-01 13:15:29,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:29,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 13:15:29,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279587594] [2020-07-01 13:15:29,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 13:15:29,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:29,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:15:29,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:15:29,463 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 8 states. [2020-07-01 13:15:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:29,592 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2020-07-01 13:15:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 13:15:29,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-01 13:15:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:29,593 INFO L225 Difference]: With dead ends: 17 [2020-07-01 13:15:29,594 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:15:29,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-07-01 13:15:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:15:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-01 13:15:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 13:15:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2020-07-01 13:15:29,599 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 12 [2020-07-01 13:15:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:29,599 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 25 transitions. [2020-07-01 13:15:29,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 13:15:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 25 transitions. [2020-07-01 13:15:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 13:15:29,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:29,600 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:29,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 13:15:29,600 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1176710174, now seen corresponding path program 1 times [2020-07-01 13:15:29,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:29,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738924811] [2020-07-01 13:15:29,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-01 13:15:29,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738924811] [2020-07-01 13:15:29,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:29,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:15:29,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541031287] [2020-07-01 13:15:29,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:15:29,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:29,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:15:29,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:15:29,644 INFO L87 Difference]: Start difference. First operand 15 states and 25 transitions. Second operand 5 states. [2020-07-01 13:15:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:29,686 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. [2020-07-01 13:15:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:15:29,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-01 13:15:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:29,687 INFO L225 Difference]: With dead ends: 16 [2020-07-01 13:15:29,687 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 13:15:29,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:15:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 13:15:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-01 13:15:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 13:15:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2020-07-01 13:15:29,692 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 12 [2020-07-01 13:15:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:29,692 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-07-01 13:15:29,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:15:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2020-07-01 13:15:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 13:15:29,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:29,693 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:29,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 13:15:29,694 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:29,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1242092460, now seen corresponding path program 1 times [2020-07-01 13:15:29,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:29,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673551854] [2020-07-01 13:15:29,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 13:15:29,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673551854] [2020-07-01 13:15:29,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600043796] [2020-07-01 13:15:29,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:15:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:29,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 13:15:29,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 13:15:29,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:15:29,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-01 13:15:29,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690929976] [2020-07-01 13:15:29,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 13:15:29,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:29,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:15:29,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:15:29,825 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. Second operand 8 states. [2020-07-01 13:15:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:29,932 INFO L93 Difference]: Finished difference Result 38 states and 59 transitions. [2020-07-01 13:15:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:15:29,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-07-01 13:15:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:29,933 INFO L225 Difference]: With dead ends: 38 [2020-07-01 13:15:29,933 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:15:29,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:15:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:15:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 13:15:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:15:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-07-01 13:15:29,938 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 14 [2020-07-01 13:15:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:29,939 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-07-01 13:15:29,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 13:15:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-01 13:15:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 13:15:29,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:29,940 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:30,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:15:30,140 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash 501802557, now seen corresponding path program 2 times [2020-07-01 13:15:30,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:30,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800370408] [2020-07-01 13:15:30,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:15:30,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800370408] [2020-07-01 13:15:30,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017352547] [2020-07-01 13:15:30,207 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:15:30,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 13:15:30,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:15:30,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-01 13:15:30,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:30,261 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2020-07-01 13:15:30,261 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 1 case distinctions, treesize of input 13 treesize of output 15 [2020-07-01 13:15:30,262 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:15:30,268 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:15:30,269 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:15:30,269 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:18 [2020-07-01 13:15:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-01 13:15:30,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:15:30,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 10 [2020-07-01 13:15:30,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888944960] [2020-07-01 13:15:30,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 13:15:30,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:30,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 13:15:30,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-01 13:15:30,304 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 10 states. [2020-07-01 13:15:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:30,466 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2020-07-01 13:15:30,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 13:15:30,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-07-01 13:15:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:30,467 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:15:30,467 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 13:15:30,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2020-07-01 13:15:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 13:15:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-01 13:15:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 13:15:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-07-01 13:15:30,473 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 27 transitions. Word has length 15 [2020-07-01 13:15:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:30,473 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-01 13:15:30,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 13:15:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2020-07-01 13:15:30,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 13:15:30,474 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:15:30,474 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:30,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 13:15:30,675 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:15:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash 486682484, now seen corresponding path program 1 times [2020-07-01 13:15:30,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:30,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89332241] [2020-07-01 13:15:30,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-01 13:15:30,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89332241] [2020-07-01 13:15:30,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984927145] [2020-07-01 13:15:30,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:15:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:30,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 13:15:30,775 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-01 13:15:30,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:15:30,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-07-01 13:15:30,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567416931] [2020-07-01 13:15:30,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:15:30,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:30,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:15:30,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-01 13:15:30,807 INFO L87 Difference]: Start difference. First operand 18 states and 27 transitions. Second operand 6 states. [2020-07-01 13:15:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:30,862 INFO L93 Difference]: Finished difference Result 18 states and 27 transitions. [2020-07-01 13:15:30,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:15:30,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-01 13:15:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:15:30,863 INFO L225 Difference]: With dead ends: 18 [2020-07-01 13:15:30,864 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:15:30,864 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-01 13:15:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:15:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:15:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:15:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:15:30,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-01 13:15:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:15:30,865 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:15:30,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:15:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:15:30,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:15:31,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 13:15:31,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:15:31,525 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2020-07-01 13:15:31,711 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-07-01 13:15:31,714 INFO L268 CegarLoopResult]: For program point L640(line 640) no Hoare annotation was computed. [2020-07-01 13:15:31,714 INFO L268 CegarLoopResult]: For program point L638(line 638) no Hoare annotation was computed. [2020-07-01 13:15:31,714 INFO L268 CegarLoopResult]: For program point L628(line 628) no Hoare annotation was computed. [2020-07-01 13:15:31,714 INFO L268 CegarLoopResult]: For program point L626(line 626) no Hoare annotation was computed. [2020-07-01 13:15:31,714 INFO L268 CegarLoopResult]: For program point L622(lines 622 629) no Hoare annotation was computed. [2020-07-01 13:15:31,714 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:15:31,715 INFO L264 CegarLoopResult]: At program point L633-2(lines 633 635) the Hoare annotation is: (and (= ~a~0.offset 0) (<= 1 ~n~0)) [2020-07-01 13:15:31,715 INFO L268 CegarLoopResult]: For program point L633-3(lines 633 635) no Hoare annotation was computed. [2020-07-01 13:15:31,715 INFO L264 CegarLoopResult]: At program point L627-2(lines 627 628) the Hoare annotation is: (let ((.cse8 (+ (* 4 ~n~0) ~b~0.offset)) (.cse10 (* ~n~0 4)) (.cse9 (select |#length| ~b~0.base))) (let ((.cse1 (<= 4 ~b~0.offset)) (.cse0 (= .cse10 .cse9)) (.cse2 (<= 0 ULTIMATE.start_foo_~i~0)) (.cse3 (= ~a~0.offset 0)) (.cse4 (= 1 (select |#valid| ~b~0.base))) (.cse5 (= .cse10 (select |#length| ~a~0.base))) (.cse6 (= 1 (select |#valid| ~a~0.base))) (.cse7 (<= .cse8 (+ .cse9 4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~n~0) .cse5 .cse6 .cse7 (<= ~n~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_foo_~i~0 1) ~n~0) .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 (<= 8 .cse8) .cse4 .cse5 .cse6 .cse7 (<= ~n~0 1))))) [2020-07-01 13:15:31,715 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. [2020-07-01 13:15:31,715 INFO L264 CegarLoopResult]: At program point L625-2(lines 625 626) the Hoare annotation is: (let ((.cse0 (* ~n~0 4)) (.cse2 (+ (* 4 ~n~0) ~b~0.offset)) (.cse1 (select |#length| ~b~0.base))) (and (= .cse0 .cse1) (<= 4 ~b~0.offset) (<= 0 ULTIMATE.start_foo_~i~0) (= ~a~0.offset 0) (<= 8 .cse2) (= 1 (select |#valid| ~b~0.base)) (= .cse0 (select |#length| ~a~0.base)) (= 1 (select |#valid| ~a~0.base)) (<= .cse2 (+ .cse1 4)))) [2020-07-01 13:15:31,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. [2020-07-01 13:15:31,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 628) no Hoare annotation was computed. [2020-07-01 13:15:31,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. [2020-07-01 13:15:31,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. [2020-07-01 13:15:31,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 626) no Hoare annotation was computed. [2020-07-01 13:15:31,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 638) no Hoare annotation was computed. [2020-07-01 13:15:31,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 628) no Hoare annotation was computed. [2020-07-01 13:15:31,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 626) no Hoare annotation was computed. [2020-07-01 13:15:31,716 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 638) no Hoare annotation was computed. [2020-07-01 13:15:31,719 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:15:31,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,738 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,738 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,738 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,738 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,739 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,742 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,742 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,742 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,742 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,743 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,743 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,743 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,743 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,744 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:31,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:15:31 BasicIcfg [2020-07-01 13:15:31,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:15:31,750 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:15:31,750 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:15:31,754 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:15:31,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:31,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:15:24" (1/5) ... [2020-07-01 13:15:31,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a2509e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:15:31, skipping insertion in model container [2020-07-01 13:15:31,755 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:31,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:15:25" (2/5) ... [2020-07-01 13:15:31,756 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a2509e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:15:31, skipping insertion in model container [2020-07-01 13:15:31,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:31,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:15:25" (3/5) ... [2020-07-01 13:15:31,756 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a2509e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:15:31, skipping insertion in model container [2020-07-01 13:15:31,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:31,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:15:25" (4/5) ... [2020-07-01 13:15:31,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a2509e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:15:31, skipping insertion in model container [2020-07-01 13:15:31,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:15:31,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:15:31" (5/5) ... [2020-07-01 13:15:31,758 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:15:31,785 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:15:31,785 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:15:31,785 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:15:31,785 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:15:31,785 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:15:31,785 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:15:31,785 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:15:31,785 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:15:31,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-01 13:15:31,794 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-07-01 13:15:31,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:31,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:31,799 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 13:15:31,799 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-01 13:15:31,799 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:15:31,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-01 13:15:31,800 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-07-01 13:15:31,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:31,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:31,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 13:15:31,801 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-01 13:15:31,806 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 |v_#NULL.base_2|) (= 0 v_~a~0.offset_7) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= 0 v_~b~0.offset_12) (= 1 v_~n~0_16) (= 0 v_~a~0.base_8) (= 0 v_~b~0.base_15) (= |v_#valid_22| (store |v_#valid_23| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 6#L633-2true [2020-07-01 13:15:31,806 INFO L796 eck$LassoCheckResult]: Loop: 6#L633-2true [123] L633-2-->L633-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= v_~n~0_4 (+ v_~n~0_5 1)) (< v_~n~0_5 30)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 6#L633-2true [2020-07-01 13:15:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:31,807 INFO L82 PathProgramCache]: Analyzing trace with hash 182, now seen corresponding path program 1 times [2020-07-01 13:15:31,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:31,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302030262] [2020-07-01 13:15:31,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:31,831 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash 154, now seen corresponding path program 1 times [2020-07-01 13:15:31,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:31,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207543951] [2020-07-01 13:15:31,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:31,837 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:31,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:31,837 INFO L82 PathProgramCache]: Analyzing trace with hash 5765, now seen corresponding path program 1 times [2020-07-01 13:15:31,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:31,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852340991] [2020-07-01 13:15:31,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:31,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:31,880 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:15:31,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:15:31,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:15:31,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:15:31,881 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 13:15:31,881 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:15:31,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:15:31,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:15:31,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 13:15:31,882 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:15:31,882 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:15:31,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:31,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:31,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:31,941 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:15:31,942 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:15:31,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 13:15:31,948 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:15:32,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 13:15:32,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 13:15:32,041 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 13:15:32,043 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:15:32,044 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:15:32,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:15:32,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:15:32,044 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:15:32,044 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:32,044 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:15:32,044 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:15:32,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 13:15:32,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:15:32,045 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:15:32,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:32,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:32,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:32,077 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:15:32,083 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:32,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:32,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:32,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:32,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:32,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:32,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:32,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:32,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:32,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:15:32,107 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 13:15:32,107 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:32,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:15:32,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 13:15:32,117 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:15:32,117 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0) = -2*~n~0 + 59 Supporting invariants [] [2020-07-01 13:15:32,153 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 13:15:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:32,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 13:15:32,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:32,189 WARN L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:15:32,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:32,190 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:15:32,192 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-07-01 13:15:32,197 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-01 13:15:32,198 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states. Second operand 2 states. [2020-07-01 13:15:32,346 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states.. Second operand 2 states. Result 39 states and 77 transitions. Complement of second has 4 states. [2020-07-01 13:15:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 13:15:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-01 13:15:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-01 13:15:32,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 1 letters. Loop has 1 letters. [2020-07-01 13:15:32,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:32,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 2 letters. Loop has 1 letters. [2020-07-01 13:15:32,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:32,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-01 13:15:32,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:32,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 77 transitions. [2020-07-01 13:15:32,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-01 13:15:32,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 19 transitions. [2020-07-01 13:15:32,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-01 13:15:32,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-01 13:15:32,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 19 transitions. [2020-07-01 13:15:32,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:15:32,364 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. [2020-07-01 13:15:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 19 transitions. [2020-07-01 13:15:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-01 13:15:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 13:15:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2020-07-01 13:15:32,367 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. [2020-07-01 13:15:32,367 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. [2020-07-01 13:15:32,367 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 13:15:32,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 19 transitions. [2020-07-01 13:15:32,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-01 13:15:32,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:32,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:32,368 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 13:15:32,368 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:15:32,369 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 |v_#NULL.base_2|) (= 0 v_~a~0.offset_7) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= 0 v_~b~0.offset_12) (= 1 v_~n~0_16) (= 0 v_~a~0.base_8) (= 0 v_~b~0.base_15) (= |v_#valid_22| (store |v_#valid_23| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 92#L633-2 [122] L633-2-->L633-3: Formula: (>= v_~n~0_3 30) InVars {~n~0=v_~n~0_3} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 94#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< |v_ULTIMATE.start_main_#t~malloc4.base_2| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* v_~n~0_6 4))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1)) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 89#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|))) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 90#L625-2 [2020-07-01 13:15:32,369 INFO L796 eck$LassoCheckResult]: Loop: 90#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 93#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (and (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) (+ (* v_ULTIMATE.start_foo_~i~0_23 4) v_~a~0.offset_8) v_~n~0_20))) (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= 1 (select |v_#valid_25| v_~a~0.base_9)) (<= 0 (+ .cse0 v_~a~0.offset_8)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 90#L625-2 [2020-07-01 13:15:32,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:32,369 INFO L82 PathProgramCache]: Analyzing trace with hash 5543293, now seen corresponding path program 1 times [2020-07-01 13:15:32,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:32,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893517566] [2020-07-01 13:15:32,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:32,380 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:15:32,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893517566] [2020-07-01 13:15:32,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:32,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:32,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279486347] [2020-07-01 13:15:32,381 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:15:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:32,382 INFO L82 PathProgramCache]: Analyzing trace with hash 3657, now seen corresponding path program 1 times [2020-07-01 13:15:32,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:32,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243509657] [2020-07-01 13:15:32,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:32,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:32,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:15:32,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:15:32,428 INFO L87 Difference]: Start difference. First operand 9 states and 19 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-01 13:15:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:32,472 INFO L93 Difference]: Finished difference Result 15 states and 28 transitions. [2020-07-01 13:15:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:15:32,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 28 transitions. [2020-07-01 13:15:32,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-01 13:15:32,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 28 transitions. [2020-07-01 13:15:32,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-01 13:15:32,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-01 13:15:32,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 28 transitions. [2020-07-01 13:15:32,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:15:32,478 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 28 transitions. [2020-07-01 13:15:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 28 transitions. [2020-07-01 13:15:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 9. [2020-07-01 13:15:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 13:15:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2020-07-01 13:15:32,480 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 18 transitions. [2020-07-01 13:15:32,480 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 18 transitions. [2020-07-01 13:15:32,480 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 13:15:32,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 18 transitions. [2020-07-01 13:15:32,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-01 13:15:32,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:32,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:32,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 13:15:32,481 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:15:32,482 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 |v_#NULL.base_2|) (= 0 v_~a~0.offset_7) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= 0 v_~b~0.offset_12) (= 1 v_~n~0_16) (= 0 v_~a~0.base_8) (= 0 v_~b~0.base_15) (= |v_#valid_22| (store |v_#valid_23| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 122#L633-2 [121] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 124#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< |v_ULTIMATE.start_main_#t~malloc4.base_2| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* v_~n~0_6 4))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1)) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 119#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|))) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 120#L625-2 [2020-07-01 13:15:32,482 INFO L796 eck$LassoCheckResult]: Loop: 120#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 123#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (and (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) (+ (* v_ULTIMATE.start_foo_~i~0_23 4) v_~a~0.offset_8) v_~n~0_20))) (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= 1 (select |v_#valid_25| v_~a~0.base_9)) (<= 0 (+ .cse0 v_~a~0.offset_8)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 120#L625-2 [2020-07-01 13:15:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash 5542332, now seen corresponding path program 1 times [2020-07-01 13:15:32,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:32,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524288226] [2020-07-01 13:15:32,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:32,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash 3657, now seen corresponding path program 2 times [2020-07-01 13:15:32,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:32,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809070459] [2020-07-01 13:15:32,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:32,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1031216452, now seen corresponding path program 1 times [2020-07-01 13:15:32,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:32,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313472021] [2020-07-01 13:15:32,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:32,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:32,777 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2020-07-01 13:15:32,835 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:15:32,835 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:15:32,835 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:15:32,835 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:15:32,835 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:15:32,835 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:32,835 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:15:32,836 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:15:32,836 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-07-01 13:15:32,836 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:15:32,836 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:15:32,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:32,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:32,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:33,305 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:15:33,305 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:33,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:33,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:33,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:33,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:33,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:33,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:33,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:33,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:33,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:33,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:33,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:33,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:33,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:33,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:33,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:33,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:33,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:33,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:33,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:33,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:33,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:33,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:33,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:33,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:33,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:33,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:33,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:33,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:33,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:33,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:33,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:33,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:33,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:33,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:33,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:33,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:33,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:33,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:33,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:33,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:33,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:33,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:33,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:33,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:33,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:33,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:33,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:33,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:33,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:33,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:33,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:33,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:33,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:33,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:33,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:33,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:33,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:33,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:33,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:33,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:33,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:33,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:33,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:33,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:33,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:33,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:33,631 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:15:33,673 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-07-01 13:15:33,673 INFO L444 ModelExtractionUtils]: 12 out of 31 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:33,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:15:33,680 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-01 13:15:33,681 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:15:33,681 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_foo_~i~0, ~a~0.offset) = -4*ULTIMATE.start_foo_~i~0 - 1*~a~0.offset + 2 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_1 + 4 >= 0] [2020-07-01 13:15:33,729 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2020-07-01 13:15:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:33,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 13:15:33,766 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:33,791 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2020-07-01 13:15:33,791 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 1 case distinctions, treesize of input 13 treesize of output 15 [2020-07-01 13:15:33,791 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:15:33,800 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:15:33,802 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:15:33,802 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:30 [2020-07-01 13:15:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:33,834 WARN L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:15:33,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:33,835 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:15:33,896 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 13:15:33,896 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2020-07-01 13:15:33,896 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 18 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-01 13:15:34,118 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 18 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 27 states and 48 transitions. Complement of second has 14 states. [2020-07-01 13:15:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2020-07-01 13:15:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 13:15:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-01 13:15:34,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-01 13:15:34,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:34,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-01 13:15:34,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:34,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-01 13:15:34,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:34,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 48 transitions. [2020-07-01 13:15:34,125 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-01 13:15:34,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 35 transitions. [2020-07-01 13:15:34,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-01 13:15:34,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-01 13:15:34,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 35 transitions. [2020-07-01 13:15:34,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:15:34,127 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-07-01 13:15:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 35 transitions. [2020-07-01 13:15:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2020-07-01 13:15:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:15:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2020-07-01 13:15:34,128 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 28 transitions. [2020-07-01 13:15:34,128 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 28 transitions. [2020-07-01 13:15:34,128 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 13:15:34,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 28 transitions. [2020-07-01 13:15:34,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-01 13:15:34,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:34,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:34,130 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:15:34,140 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:15:34,141 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 |v_#NULL.base_2|) (= 0 v_~a~0.offset_7) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= 0 v_~b~0.offset_12) (= 1 v_~n~0_16) (= 0 v_~a~0.base_8) (= 0 v_~b~0.base_15) (= |v_#valid_22| (store |v_#valid_23| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 262#L633-2 [121] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 266#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< |v_ULTIMATE.start_main_#t~malloc4.base_2| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* v_~n~0_6 4))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1)) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 269#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|))) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 270#L625-2 [153] L625-2-->L627-2: Formula: (and (= 0 v_ULTIMATE.start_foo_~i~0_20) (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 258#L627-2 [2020-07-01 13:15:34,141 INFO L796 eck$LassoCheckResult]: Loop: 258#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 257#L628 [155] L628-->L627-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (and (= 1 (select |v_#valid_26| v_~b~0.base_16)) (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) (+ v_~b~0.offset_13 (* v_ULTIMATE.start_foo_~i~0_25 4)) v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse0 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 (+ v_~b~0.offset_13 .cse0)))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 258#L627-2 [2020-07-01 13:15:34,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash 171812445, now seen corresponding path program 1 times [2020-07-01 13:15:34,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:34,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336464871] [2020-07-01 13:15:34,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:34,164 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:15:34,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336464871] [2020-07-01 13:15:34,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:34,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:15:34,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312224697] [2020-07-01 13:15:34,165 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:15:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 1 times [2020-07-01 13:15:34,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:34,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926673367] [2020-07-01 13:15:34,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,174 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:34,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:15:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:34,203 INFO L87 Difference]: Start difference. First operand 14 states and 28 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-07-01 13:15:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:34,236 INFO L93 Difference]: Finished difference Result 19 states and 32 transitions. [2020-07-01 13:15:34,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:15:34,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 32 transitions. [2020-07-01 13:15:34,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-01 13:15:34,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 32 transitions. [2020-07-01 13:15:34,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-01 13:15:34,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-01 13:15:34,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 32 transitions. [2020-07-01 13:15:34,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:15:34,241 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-07-01 13:15:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 32 transitions. [2020-07-01 13:15:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2020-07-01 13:15:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 13:15:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2020-07-01 13:15:34,243 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 28 transitions. [2020-07-01 13:15:34,243 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 28 transitions. [2020-07-01 13:15:34,243 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 13:15:34,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 28 transitions. [2020-07-01 13:15:34,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-01 13:15:34,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:34,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:34,245 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:15:34,245 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:15:34,245 INFO L794 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 |v_#NULL.base_2|) (= 0 v_~a~0.offset_7) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= 0 v_~b~0.offset_12) (= 1 v_~n~0_16) (= 0 v_~a~0.base_8) (= 0 v_~b~0.base_15) (= |v_#valid_22| (store |v_#valid_23| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 302#L633-2 [124] L633-2-->L633-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= v_~n~0_4 (+ v_~n~0_5 1)) (< v_~n~0_5 30)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 308#L633-2 [122] L633-2-->L633-3: Formula: (>= v_~n~0_3 30) InVars {~n~0=v_~n~0_3} OutVars{~n~0=v_~n~0_3, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 309#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< |v_ULTIMATE.start_main_#t~malloc4.base_2| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* v_~n~0_6 4))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1)) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 311#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|))) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 310#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 303#L626 [2020-07-01 13:15:34,245 INFO L796 eck$LassoCheckResult]: Loop: 303#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (and (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) (+ (* v_ULTIMATE.start_foo_~i~0_23 4) v_~a~0.offset_8) v_~n~0_20))) (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= 1 (select |v_#valid_25| v_~a~0.base_9)) (<= 0 (+ .cse0 v_~a~0.offset_8)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 304#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 303#L626 [2020-07-01 13:15:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1033816133, now seen corresponding path program 1 times [2020-07-01 13:15:34,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:34,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386039594] [2020-07-01 13:15:34,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:34,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386039594] [2020-07-01 13:15:34,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394279708] [2020-07-01 13:15:34,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:15:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:34,295 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:15:34,296 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:34,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:15:34,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-01 13:15:34,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035169827] [2020-07-01 13:15:34,298 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:15:34,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:34,299 INFO L82 PathProgramCache]: Analyzing trace with hash 5817, now seen corresponding path program 3 times [2020-07-01 13:15:34,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:34,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545117573] [2020-07-01 13:15:34,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,305 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:34,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:34,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:15:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:34,330 INFO L87 Difference]: Start difference. First operand 15 states and 28 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-01 13:15:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:34,386 INFO L93 Difference]: Finished difference Result 25 states and 44 transitions. [2020-07-01 13:15:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:15:34,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 44 transitions. [2020-07-01 13:15:34,389 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-07-01 13:15:34,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 44 transitions. [2020-07-01 13:15:34,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-07-01 13:15:34,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-01 13:15:34,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 44 transitions. [2020-07-01 13:15:34,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:15:34,391 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 44 transitions. [2020-07-01 13:15:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 44 transitions. [2020-07-01 13:15:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2020-07-01 13:15:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:15:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2020-07-01 13:15:34,392 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 31 transitions. [2020-07-01 13:15:34,393 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 31 transitions. [2020-07-01 13:15:34,393 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 13:15:34,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 31 transitions. [2020-07-01 13:15:34,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-01 13:15:34,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:34,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:34,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:15:34,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:15:34,394 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 |v_#NULL.base_2|) (= 0 v_~a~0.offset_7) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= 0 v_~b~0.offset_12) (= 1 v_~n~0_16) (= 0 v_~a~0.base_8) (= 0 v_~b~0.base_15) (= |v_#valid_22| (store |v_#valid_23| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 364#L633-2 [124] L633-2-->L633-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= v_~n~0_4 (+ v_~n~0_5 1)) (< v_~n~0_5 30)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 370#L633-2 [121] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 371#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< |v_ULTIMATE.start_main_#t~malloc4.base_2| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* v_~n~0_6 4))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1)) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 361#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|))) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 362#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 365#L626 [2020-07-01 13:15:34,395 INFO L796 eck$LassoCheckResult]: Loop: 365#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (and (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) (+ (* v_ULTIMATE.start_foo_~i~0_23 4) v_~a~0.offset_8) v_~n~0_20))) (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= 1 (select |v_#valid_25| v_~a~0.base_9)) (<= 0 (+ .cse0 v_~a~0.offset_8)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 366#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 365#L626 [2020-07-01 13:15:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1033786342, now seen corresponding path program 1 times [2020-07-01 13:15:34,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:34,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207154297] [2020-07-01 13:15:34,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,408 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:34,409 INFO L82 PathProgramCache]: Analyzing trace with hash 5817, now seen corresponding path program 4 times [2020-07-01 13:15:34,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:34,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19584565] [2020-07-01 13:15:34,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,414 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1331234142, now seen corresponding path program 1 times [2020-07-01 13:15:34,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:34,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447658294] [2020-07-01 13:15:34,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:34,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:34,669 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-07-01 13:15:34,722 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:15:34,723 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:15:34,723 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:15:34,723 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:15:34,723 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:15:34,723 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:34,723 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:15:34,723 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:15:34,723 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-07-01 13:15:34,724 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:15:34,724 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:15:34,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:34,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:35,111 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:15:35,112 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:35,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:35,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:35,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:35,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:35,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:35,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:35,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:35,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:35,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:35,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:35,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:35,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:35,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:35,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:35,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:35,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:35,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:35,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:35,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:35,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:35,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:35,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:35,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:35,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:35,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:35,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:35,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:35,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:35,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:35,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:35,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:35,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:35,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:35,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:35,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:35,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:35,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:35,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:35,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:35,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:15:35,325 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-01 13:15:35,326 INFO L444 ModelExtractionUtils]: 13 out of 28 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:35,328 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:15:35,331 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-01 13:15:35,331 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:15:35,331 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_foo_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_2) = -4*ULTIMATE.start_foo_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_2 Supporting invariants [1*~a~0.offset >= 0] [2020-07-01 13:15:35,384 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2020-07-01 13:15:35,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:35,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:35,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 13:15:35,425 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:35,436 WARN L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:15:35,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:35,458 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:15:35,512 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-07-01 13:15:35,512 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2020-07-01 13:15:35,513 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 31 transitions. cyclomatic complexity: 19 Second operand 4 states. [2020-07-01 13:15:35,610 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 31 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 24 states and 41 transitions. Complement of second has 8 states. [2020-07-01 13:15:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-01 13:15:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 13:15:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-01 13:15:35,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-01 13:15:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:35,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-01 13:15:35,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:35,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-01 13:15:35,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:35,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 41 transitions. [2020-07-01 13:15:35,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 13:15:35,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 34 transitions. [2020-07-01 13:15:35,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-01 13:15:35,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-01 13:15:35,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 34 transitions. [2020-07-01 13:15:35,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:15:35,617 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 34 transitions. [2020-07-01 13:15:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 34 transitions. [2020-07-01 13:15:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2020-07-01 13:15:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 13:15:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2020-07-01 13:15:35,618 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 29 transitions. [2020-07-01 13:15:35,618 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 29 transitions. [2020-07-01 13:15:35,618 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 13:15:35,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 29 transitions. [2020-07-01 13:15:35,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 13:15:35,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:35,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:35,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:35,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:15:35,620 INFO L794 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 |v_#NULL.base_2|) (= 0 v_~a~0.offset_7) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= 0 v_~b~0.offset_12) (= 1 v_~n~0_16) (= 0 v_~a~0.base_8) (= 0 v_~b~0.base_15) (= |v_#valid_22| (store |v_#valid_23| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 498#L633-2 [121] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 502#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< |v_ULTIMATE.start_main_#t~malloc4.base_2| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* v_~n~0_6 4))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1)) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 495#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|))) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 496#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 501#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (and (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) (+ (* v_ULTIMATE.start_foo_~i~0_23 4) v_~a~0.offset_8) v_~n~0_20))) (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= 1 (select |v_#valid_25| v_~a~0.base_9)) (<= 0 (+ .cse0 v_~a~0.offset_8)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 500#L625-2 [153] L625-2-->L627-2: Formula: (and (= 0 v_ULTIMATE.start_foo_~i~0_20) (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 494#L627-2 [2020-07-01 13:15:35,620 INFO L796 eck$LassoCheckResult]: Loop: 494#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 493#L628 [155] L628-->L627-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (and (= 1 (select |v_#valid_26| v_~b~0.base_16)) (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) (+ v_~b~0.offset_13 (* v_ULTIMATE.start_foo_~i~0_25 4)) v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse0 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 (+ v_~b~0.offset_13 .cse0)))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 494#L627-2 [2020-07-01 13:15:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1902939093, now seen corresponding path program 1 times [2020-07-01 13:15:35,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:35,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962345422] [2020-07-01 13:15:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:35,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:35,636 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 2 times [2020-07-01 13:15:35,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:35,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736741103] [2020-07-01 13:15:35,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:35,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:35,642 INFO L82 PathProgramCache]: Analyzing trace with hash -931597150, now seen corresponding path program 1 times [2020-07-01 13:15:35,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:35,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856974850] [2020-07-01 13:15:35,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:15:35,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856974850] [2020-07-01 13:15:35,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:15:35,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:15:35,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075406235] [2020-07-01 13:15:35,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:35,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:15:35,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:15:35,692 INFO L87 Difference]: Start difference. First operand 15 states and 29 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-07-01 13:15:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:35,734 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2020-07-01 13:15:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:15:35,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 33 transitions. [2020-07-01 13:15:35,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 13:15:35,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 12 states and 22 transitions. [2020-07-01 13:15:35,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-01 13:15:35,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-01 13:15:35,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 22 transitions. [2020-07-01 13:15:35,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:15:35,739 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 22 transitions. [2020-07-01 13:15:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 22 transitions. [2020-07-01 13:15:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 13:15:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 13:15:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2020-07-01 13:15:35,740 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 22 transitions. [2020-07-01 13:15:35,740 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 22 transitions. [2020-07-01 13:15:35,740 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 13:15:35,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 22 transitions. [2020-07-01 13:15:35,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 13:15:35,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:35,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:35,741 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:35,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:15:35,742 INFO L794 eck$LassoCheckResult]: Stem: 540#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 |v_#NULL.base_2|) (= 0 v_~a~0.offset_7) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= 0 v_~b~0.offset_12) (= 1 v_~n~0_16) (= 0 v_~a~0.base_8) (= 0 v_~b~0.base_15) (= |v_#valid_22| (store |v_#valid_23| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 541#L633-2 [124] L633-2-->L633-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= v_~n~0_4 (+ v_~n~0_5 1)) (< v_~n~0_5 30)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 545#L633-2 [121] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 546#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< |v_ULTIMATE.start_main_#t~malloc4.base_2| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* v_~n~0_6 4))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1)) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 538#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|))) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 539#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 542#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (and (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) (+ (* v_ULTIMATE.start_foo_~i~0_23 4) v_~a~0.offset_8) v_~n~0_20))) (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= 1 (select |v_#valid_25| v_~a~0.base_9)) (<= 0 (+ .cse0 v_~a~0.offset_8)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 543#L625-2 [153] L625-2-->L627-2: Formula: (and (= 0 v_ULTIMATE.start_foo_~i~0_20) (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 537#L627-2 [2020-07-01 13:15:35,742 INFO L796 eck$LassoCheckResult]: Loop: 537#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 536#L628 [155] L628-->L627-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (and (= 1 (select |v_#valid_26| v_~b~0.base_16)) (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) (+ v_~b~0.offset_13 (* v_ULTIMATE.start_foo_~i~0_25 4)) v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse0 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 (+ v_~b~0.offset_13 .cse0)))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 537#L627-2 [2020-07-01 13:15:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1331234213, now seen corresponding path program 1 times [2020-07-01 13:15:35,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:35,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260596047] [2020-07-01 13:15:35,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:35,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260596047] [2020-07-01 13:15:35,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714419167] [2020-07-01 13:15:35,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:15:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:35,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 13:15:35,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:15:35,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:15:35,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-01 13:15:35,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728149942] [2020-07-01 13:15:35,844 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:15:35,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 3 times [2020-07-01 13:15:35,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:35,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931580561] [2020-07-01 13:15:35,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,850 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:35,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:15:35,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:15:35,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:15:35,875 INFO L87 Difference]: Start difference. First operand 12 states and 22 transitions. cyclomatic complexity: 13 Second operand 8 states. [2020-07-01 13:15:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:15:35,939 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2020-07-01 13:15:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 13:15:35,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 28 transitions. [2020-07-01 13:15:35,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 13:15:35,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 28 transitions. [2020-07-01 13:15:35,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-01 13:15:35,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-01 13:15:35,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2020-07-01 13:15:35,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:15:35,943 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-07-01 13:15:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2020-07-01 13:15:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2020-07-01 13:15:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:15:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-07-01 13:15:35,945 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 23 transitions. [2020-07-01 13:15:35,945 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 23 transitions. [2020-07-01 13:15:35,945 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-01 13:15:35,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 23 transitions. [2020-07-01 13:15:35,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 13:15:35,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:15:35,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:15:35,946 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:15:35,946 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:15:35,947 INFO L794 eck$LassoCheckResult]: Stem: 604#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 |v_#NULL.base_2|) (= 0 v_~a~0.offset_7) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= 0 v_~b~0.offset_12) (= 1 v_~n~0_16) (= 0 v_~a~0.base_8) (= 0 v_~b~0.base_15) (= |v_#valid_22| (store |v_#valid_23| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 605#L633-2 [124] L633-2-->L633-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= v_~n~0_4 (+ v_~n~0_5 1)) (< v_~n~0_5 30)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 610#L633-2 [121] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 611#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< |v_ULTIMATE.start_main_#t~malloc4.base_2| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* v_~n~0_6 4))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1)) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 602#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|))) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 603#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 606#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (and (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) (+ (* v_ULTIMATE.start_foo_~i~0_23 4) v_~a~0.offset_8) v_~n~0_20))) (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= 1 (select |v_#valid_25| v_~a~0.base_9)) (<= 0 (+ .cse0 v_~a~0.offset_8)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 607#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 608#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (and (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) (+ (* v_ULTIMATE.start_foo_~i~0_23 4) v_~a~0.offset_8) v_~n~0_20))) (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= 1 (select |v_#valid_25| v_~a~0.base_9)) (<= 0 (+ .cse0 v_~a~0.offset_8)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 609#L625-2 [153] L625-2-->L627-2: Formula: (and (= 0 v_ULTIMATE.start_foo_~i~0_20) (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 601#L627-2 [2020-07-01 13:15:35,947 INFO L796 eck$LassoCheckResult]: Loop: 601#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 600#L628 [155] L628-->L627-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (and (= 1 (select |v_#valid_26| v_~b~0.base_16)) (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) (+ v_~b~0.offset_13 (* v_ULTIMATE.start_foo_~i~0_25 4)) v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse0 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 (+ v_~b~0.offset_13 .cse0)))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 601#L627-2 [2020-07-01 13:15:35,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash -584238819, now seen corresponding path program 2 times [2020-07-01 13:15:35,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:35,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301929529] [2020-07-01 13:15:35,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 4 times [2020-07-01 13:15:35,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:35,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271582209] [2020-07-01 13:15:35,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,970 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1187213290, now seen corresponding path program 1 times [2020-07-01 13:15:35,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:15:35,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183968264] [2020-07-01 13:15:35,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:15:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:15:35,988 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:15:36,393 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2020-07-01 13:15:36,480 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:15:36,480 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:15:36,480 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:15:36,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:15:36,481 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:15:36,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:36,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:15:36,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:15:36,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso [2020-07-01 13:15:36,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:15:36,481 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:15:36,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:15:36,948 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:15:36,948 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:36,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:36,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:36,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:36,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:36,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:36,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:36,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:36,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:36,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:37,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:37,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:37,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:37,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:37,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:37,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:37,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:37,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:37,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:37,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:37,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:37,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:37,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:37,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:37,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:37,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:37,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:37,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:37,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:37,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:37,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:15:37,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:37,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:37,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:37,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:15:37,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:15:37,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:37,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:37,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:37,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:37,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:37,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:37,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:37,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:37,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:37,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:37,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:37,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:37,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:37,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:37,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:37,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:37,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:37,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:15:37,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:15:37,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:15:37,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:15:37,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:15:37,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:15:37,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:15:37,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:15:37,269 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2020-07-01 13:15:37,269 INFO L444 ModelExtractionUtils]: 11 out of 37 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:15:37,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:15:37,276 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-01 13:15:37,276 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:15:37,276 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_3, ULTIMATE.start_foo_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_3 - 4*ULTIMATE.start_foo_~i~0 Supporting invariants [1*~b~0.offset - 1*v_rep(select #length ~b~0.base)_1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_3 >= 0] [2020-07-01 13:15:37,329 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2020-07-01 13:15:37,331 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:15:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:37,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-01 13:15:37,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:37,412 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2020-07-01 13:15:37,413 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 1 case distinctions, treesize of input 13 treesize of output 15 [2020-07-01 13:15:37,413 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:15:37,427 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:15:37,428 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:15:37,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:44 [2020-07-01 13:15:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:15:37,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 13:15:37,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:15:37,743 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:15:38,021 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-07-01 13:15:38,021 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2020-07-01 13:15:38,022 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 23 transitions. cyclomatic complexity: 13 Second operand 9 states. [2020-07-01 13:15:47,102 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-07-01 13:15:49,700 WARN L192 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-07-01 13:15:58,827 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-01 13:15:58,903 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 23 transitions. cyclomatic complexity: 13. Second operand 9 states. Result 33 states and 48 transitions. Complement of second has 25 states. [2020-07-01 13:15:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 14 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 13:15:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 13:15:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2020-07-01 13:15:58,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 47 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-01 13:15:58,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:58,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-01 13:15:58,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:58,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 47 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-01 13:15:58,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:15:58,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2020-07-01 13:15:58,910 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:15:58,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2020-07-01 13:15:58,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 13:15:58,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 13:15:58,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 13:15:58,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:15:58,911 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:15:58,911 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:15:58,911 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:15:58,911 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-01 13:15:58,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:15:58,911 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:15:58,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 13:15:58,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:15:58 BasicIcfg [2020-07-01 13:15:58,918 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 13:15:58,919 INFO L168 Benchmark]: Toolchain (without parser) took 34162.31 ms. Allocated memory was 514.9 MB in the beginning and 732.4 MB in the end (delta: 217.6 MB). Free memory was 437.1 MB in the beginning and 610.2 MB in the end (delta: -173.1 MB). Peak memory consumption was 44.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:58,919 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:15:58,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.73 ms. Allocated memory was 514.9 MB in the beginning and 564.7 MB in the end (delta: 49.8 MB). Free memory was 436.5 MB in the beginning and 517.2 MB in the end (delta: -80.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:58,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.53 ms. Allocated memory is still 564.7 MB. Free memory was 517.2 MB in the beginning and 514.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:58,920 INFO L168 Benchmark]: Boogie Preprocessor took 28.30 ms. Allocated memory is still 564.7 MB. Free memory was 514.7 MB in the beginning and 513.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:58,921 INFO L168 Benchmark]: RCFGBuilder took 343.38 ms. Allocated memory is still 564.7 MB. Free memory was 512.3 MB in the beginning and 490.6 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:58,921 INFO L168 Benchmark]: BlockEncodingV2 took 121.46 ms. Allocated memory is still 564.7 MB. Free memory was 490.6 MB in the beginning and 481.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:58,921 INFO L168 Benchmark]: TraceAbstraction took 5968.77 ms. Allocated memory was 564.7 MB in the beginning and 637.0 MB in the end (delta: 72.4 MB). Free memory was 481.6 MB in the beginning and 527.6 MB in the end (delta: -46.0 MB). Peak memory consumption was 155.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:58,922 INFO L168 Benchmark]: BuchiAutomizer took 27167.71 ms. Allocated memory was 637.0 MB in the beginning and 732.4 MB in the end (delta: 95.4 MB). Free memory was 524.1 MB in the beginning and 610.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:15:58,924 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 36 edges - StatisticsResult: Encoded RCFG 20 locations, 37 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 479.73 ms. Allocated memory was 514.9 MB in the beginning and 564.7 MB in the end (delta: 49.8 MB). Free memory was 436.5 MB in the beginning and 517.2 MB in the end (delta: -80.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 46.53 ms. Allocated memory is still 564.7 MB. Free memory was 517.2 MB in the beginning and 514.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.30 ms. Allocated memory is still 564.7 MB. Free memory was 514.7 MB in the beginning and 513.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 343.38 ms. Allocated memory is still 564.7 MB. Free memory was 512.3 MB in the beginning and 490.6 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 121.46 ms. Allocated memory is still 564.7 MB. Free memory was 490.6 MB in the beginning and 481.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 5968.77 ms. Allocated memory was 564.7 MB in the beginning and 637.0 MB in the end (delta: 72.4 MB). Free memory was 481.6 MB in the beginning and 527.6 MB in the end (delta: -46.0 MB). Peak memory consumption was 155.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 27167.71 ms. Allocated memory was 637.0 MB in the beginning and 732.4 MB in the end (delta: 95.4 MB). Free memory was 524.1 MB in the beginning and 610.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 9.4 MB. 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 - 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: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: a == 0 && 1 <= n - InvariantResult [Line: 627]: Loop Invariant [2020-07-01 13:15:58,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,936 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,937 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,937 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((n * 4 == unknown-#length-unknown[b] && 4 <= b) && 0 <= i) && a == 0) && 1 == \valid[b]) && 2 <= n) && n * 4 == unknown-#length-unknown[a]) && 1 == \valid[a]) && 4 * n + b <= unknown-#length-unknown[b] + 4) && n <= 2) || ((((((((n * 4 == unknown-#length-unknown[b] && 4 <= b) && 0 <= i) && a == 0) && 1 == \valid[b]) && i + 1 <= n) && n * 4 == unknown-#length-unknown[a]) && 1 == \valid[a]) && 4 * n + b <= unknown-#length-unknown[b] + 4)) || ((((((((n * 4 == unknown-#length-unknown[b] && 0 <= i) && a == 0) && 8 <= 4 * n + b) && 1 == \valid[b]) && n * 4 == unknown-#length-unknown[a]) && 1 == \valid[a]) && 4 * n + b <= unknown-#length-unknown[b] + 4) && n <= 1) - InvariantResult [Line: 625]: Loop Invariant [2020-07-01 13:15:58,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:15:58,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((n * 4 == unknown-#length-unknown[b] && 4 <= b) && 0 <= i) && a == 0) && 8 <= 4 * n + b) && 1 == \valid[b]) && n * 4 == unknown-#length-unknown[a]) && 1 == \valid[a]) && 4 * n + b <= unknown-#length-unknown[b] + 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 10 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.2s, OverallIterations: 18, TraceHistogramMax: 3, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 45 SDtfs, 564 SDslu, 173 SDs, 0 SdLazy, 1195 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=6, 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, 18 MinimizatonAttempts, 48 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 19 NumberOfFragments, 213 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2892 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2193 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 241 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 217 ConstructedInterpolants, 5 QuantifiedInterpolants, 13053 SizeOfPredicates, 16 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 24 InterpolantComputations, 15 PerfectInterpolantSequences, 74/91 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 - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -2 * n + 59 and consists of 3 locations. One nondeterministic module has affine ranking function -4 * i + -1 * a + 2 and consists of 10 locations. One nondeterministic module has affine ranking function -4 * i + unknown-#length-unknown[malloc (n * sizeof(*a))] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc (n * sizeof(*a))] + -4 * i and consists of 17 locations. 5 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.1s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 1.0s. Büchi inclusion checks took 21.6s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 5. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 296 SDslu, 61 SDs, 0 SdLazy, 519 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital100 mio100 ax100 hnf100 lsp88 ukn84 mio100 lsp76 div100 bol100 ite100 ukn100 eq173 hnf91 smp98 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 13:15:21.501 ----------------------------------------------- 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/sandbox/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/sandbox/tmp/BenchExec_run_MOrOK3/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:15:59.567 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check