YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:27:57,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:27:57,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:27:57,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:27:57,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:27:57,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:27:57,176 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:27:57,178 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:27:57,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:27:57,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:27:57,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:27:57,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:27:57,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:27:57,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:27:57,184 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:27:57,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:27:57,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:27:57,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:27:57,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:27:57,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:27:57,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:27:57,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:27:57,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:27:57,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:27:57,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:27:57,196 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:27:57,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:27:57,198 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:27:57,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:27:57,199 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:27:57,199 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:27:57,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:27:57,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:27:57,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:27:57,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:27:57,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:27:57,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:27:57,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:27:57,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:27:57,204 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 04:27:57,218 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:27:57,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:27:57,219 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:27:57,219 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:27:57,220 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:27:57,220 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:27:57,220 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:27:57,220 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:27:57,220 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:27:57,221 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:27:57,221 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:27:57,221 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:27:57,221 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:27:57,221 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:27:57,221 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:27:57,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:27:57,222 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:27:57,222 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:27:57,222 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:27:57,222 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:27:57,223 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:27:57,223 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:27:57,223 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:27:57,223 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:27:57,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:27:57,224 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:27:57,224 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:27:57,224 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:27:57,224 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:27:57,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:27:57,262 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:27:57,266 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:27:57,267 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:27:57,268 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:27:57,268 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:27:57,335 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/76957d96d991404e9e0b34eeaec23082/FLAG7ce3ca908 [2020-06-22 04:27:57,667 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:27:57,668 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:27:57,674 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/76957d96d991404e9e0b34eeaec23082/FLAG7ce3ca908 [2020-06-22 04:27:58,075 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/76957d96d991404e9e0b34eeaec23082 [2020-06-22 04:27:58,086 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:27:58,088 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:27:58,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:27:58,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:27:58,092 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:27:58,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb26711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58, skipping insertion in model container [2020-06-22 04:27:58,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:27:58,121 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:27:58,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:27:58,286 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:27:58,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:27:58,369 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:27:58,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58 WrapperNode [2020-06-22 04:27:58,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:27:58,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:27:58,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:27:58,371 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:27:58,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:27:58,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:27:58,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:27:58,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:27:58,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:27:58,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:27:58,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:27:58,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:27:58,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:27:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:27:58,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:27:58,661 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:27:58,662 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2020-06-22 04:27:58,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:27:58 BoogieIcfgContainer [2020-06-22 04:27:58,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:27:58,664 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:27:58,664 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:27:58,666 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:27:58,667 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:27:58" (1/1) ... [2020-06-22 04:27:58,683 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges [2020-06-22 04:27:58,685 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:27:58,687 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:27:58,687 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:27:58,688 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:27:58,690 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:27:58,691 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:27:58,691 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:27:58,707 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:27:58,714 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 04:27:58,719 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 04:27:58,721 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:27:58,738 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 04:27:58,741 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 04:27:58,742 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:27:58,742 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:27:58,742 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:27:58,743 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:27:58,743 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2020-06-22 04:27:58,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:27:58 BasicIcfg [2020-06-22 04:27:58,744 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:27:58,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:27:58,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:27:58,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:27:58,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:27:58" (1/4) ... [2020-06-22 04:27:58,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a8d54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:27:58, skipping insertion in model container [2020-06-22 04:27:58,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (2/4) ... [2020-06-22 04:27:58,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a8d54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:27:58, skipping insertion in model container [2020-06-22 04:27:58,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:27:58" (3/4) ... [2020-06-22 04:27:58,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a8d54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:27:58, skipping insertion in model container [2020-06-22 04:27:58,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:27:58" (4/4) ... [2020-06-22 04:27:58,752 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:27:58,763 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:27:58,771 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 04:27:58,788 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 04:27:58,817 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:27:58,818 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:27:58,818 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:27:58,818 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:27:58,818 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:27:58,818 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:27:58,818 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:27:58,818 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:27:58,819 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:27:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-06-22 04:27:58,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:27:58,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-06-22 04:27:58,917 INFO L451 ceAbstractionStarter]: At program point L19-2(lines 19 25) the Hoare annotation is: true [2020-06-22 04:27:58,918 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:27:58,918 INFO L451 ceAbstractionStarter]: At program point L21-2(lines 21 23) the Hoare annotation is: true [2020-06-22 04:27:58,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:27:58 BasicIcfg [2020-06-22 04:27:58,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:27:58,929 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:27:58,930 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:27:58,934 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:27:58,935 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:27:58,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:27:58" (1/5) ... [2020-06-22 04:27:58,936 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4197a97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:27:58, skipping insertion in model container [2020-06-22 04:27:58,936 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:27:58,936 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:27:58" (2/5) ... [2020-06-22 04:27:58,937 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4197a97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:27:58, skipping insertion in model container [2020-06-22 04:27:58,937 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:27:58,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:27:58" (3/5) ... [2020-06-22 04:27:58,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4197a97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:27:58, skipping insertion in model container [2020-06-22 04:27:58,938 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:27:58,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:27:58" (4/5) ... [2020-06-22 04:27:58,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4197a97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:27:58, skipping insertion in model container [2020-06-22 04:27:58,939 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:27:58,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:27:58" (5/5) ... [2020-06-22 04:27:58,940 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:27:58,975 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:27:58,976 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:27:58,976 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:27:58,976 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:27:58,976 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:27:58,976 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:27:58,976 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:27:58,977 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:27:58,977 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:27:58,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 04:27:58,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 04:27:58,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:59,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:59,005 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:27:59,005 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:27:59,005 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:27:59,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 04:27:59,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 04:27:59,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:59,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:59,007 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:27:59,007 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 04:27:59,012 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 4#L19-2true [2020-06-22 04:27:59,012 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-2true [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 5#L21-2true [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 4#L19-2true [2020-06-22 04:27:59,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 1 times [2020-06-22 04:27:59,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:59,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2122, now seen corresponding path program 1 times [2020-06-22 04:27:59,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:59,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:27:59,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 04:27:59,152 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:27:59,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:27:59,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:27:59,169 INFO L87 Difference]: Start difference. First operand 3 states. Second operand 3 states. [2020-06-22 04:27:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:27:59,188 INFO L93 Difference]: Finished difference Result 4 states and 5 transitions. [2020-06-22 04:27:59,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:27:59,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4 states and 5 transitions. [2020-06-22 04:27:59,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 04:27:59,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4 states to 4 states and 5 transitions. [2020-06-22 04:27:59,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 04:27:59,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 04:27:59,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 5 transitions. [2020-06-22 04:27:59,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:27:59,199 INFO L706 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2020-06-22 04:27:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 5 transitions. [2020-06-22 04:27:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2020-06-22 04:27:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:27:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-06-22 04:27:59,230 INFO L729 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2020-06-22 04:27:59,230 INFO L609 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2020-06-22 04:27:59,230 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:27:59,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 5 transitions. [2020-06-22 04:27:59,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 04:27:59,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:59,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:59,231 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:27:59,231 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:27:59,232 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 17#L19-2 [2020-06-22 04:27:59,232 INFO L796 eck$LassoCheckResult]: Loop: 17#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 18#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 19#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 17#L19-2 [2020-06-22 04:27:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 2 times [2020-06-22 04:27:59,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:59,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash 65672, now seen corresponding path program 1 times [2020-06-22 04:27:59,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:27:59,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:27:59,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:59,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 04:27:59,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:27:59,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2020-06-22 04:27:59,358 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:27:59,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 04:27:59,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 04:27:59,359 INFO L87 Difference]: Start difference. First operand 4 states and 5 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-06-22 04:27:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:27:59,378 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-06-22 04:27:59,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 04:27:59,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5 states and 6 transitions. [2020-06-22 04:27:59,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 04:27:59,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5 states to 5 states and 6 transitions. [2020-06-22 04:27:59,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 04:27:59,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 04:27:59,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2020-06-22 04:27:59,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:27:59,382 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 04:27:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2020-06-22 04:27:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-06-22 04:27:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 04:27:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2020-06-22 04:27:59,383 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 04:27:59,383 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 04:27:59,384 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:27:59,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2020-06-22 04:27:59,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 04:27:59,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:59,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:59,385 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:27:59,385 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-06-22 04:27:59,385 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 39#L19-2 [2020-06-22 04:27:59,386 INFO L796 eck$LassoCheckResult]: Loop: 39#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 40#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 41#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 42#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 39#L19-2 [2020-06-22 04:27:59,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,386 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 3 times [2020-06-22 04:27:59,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:27:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2035722, now seen corresponding path program 2 times [2020-06-22 04:27:59,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:59,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:27:59,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:27:59,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 04:27:59,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 04:27:59,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:27:59,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:27:59,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:27:59,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-06-22 04:27:59,509 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:27:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 04:27:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 04:27:59,510 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-06-22 04:27:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:27:59,533 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2020-06-22 04:27:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 04:27:59,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2020-06-22 04:27:59,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 04:27:59,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2020-06-22 04:27:59,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 04:27:59,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 04:27:59,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2020-06-22 04:27:59,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:27:59,536 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-06-22 04:27:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2020-06-22 04:27:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2020-06-22 04:27:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 04:27:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-06-22 04:27:59,538 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-06-22 04:27:59,538 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-06-22 04:27:59,538 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:27:59,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-06-22 04:27:59,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 04:27:59,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:59,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:59,539 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:27:59,539 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1] [2020-06-22 04:27:59,539 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 67#L19-2 [2020-06-22 04:27:59,540 INFO L796 eck$LassoCheckResult]: Loop: 67#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 68#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 69#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 71#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 70#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 67#L19-2 [2020-06-22 04:27:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 4 times [2020-06-22 04:27:59,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:59,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,548 INFO L82 PathProgramCache]: Analyzing trace with hash 63107272, now seen corresponding path program 3 times [2020-06-22 04:27:59,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:59,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:27:59,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:27:59,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 04:27:59,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-06-22 04:27:59,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:27:59,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 04:27:59,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:27:59,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 04:27:59,667 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:27:59,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 04:27:59,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-06-22 04:27:59,668 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-06-22 04:27:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:27:59,683 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-06-22 04:27:59,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 04:27:59,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2020-06-22 04:27:59,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:27:59,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2020-06-22 04:27:59,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 04:27:59,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 04:27:59,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-06-22 04:27:59,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:27:59,686 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-06-22 04:27:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-06-22 04:27:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-06-22 04:27:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 04:27:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-06-22 04:27:59,687 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-06-22 04:27:59,687 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-06-22 04:27:59,687 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:27:59,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-06-22 04:27:59,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:27:59,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:59,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:59,688 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:27:59,688 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1] [2020-06-22 04:27:59,689 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 101#L19-2 [2020-06-22 04:27:59,689 INFO L796 eck$LassoCheckResult]: Loop: 101#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 102#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 103#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 106#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 105#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 104#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 101#L19-2 [2020-06-22 04:27:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 5 times [2020-06-22 04:27:59,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:59,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1956325322, now seen corresponding path program 4 times [2020-06-22 04:27:59,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:27:59,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:27:59,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-22 04:27:59,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-22 04:27:59,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:27:59,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 04:27:59,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:27:59,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 04:27:59,811 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:27:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:27:59,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:27:59,812 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 7 states. [2020-06-22 04:27:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:27:59,839 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-06-22 04:27:59,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 04:27:59,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2020-06-22 04:27:59,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 04:27:59,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2020-06-22 04:27:59,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 04:27:59,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 04:27:59,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2020-06-22 04:27:59,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:27:59,842 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-06-22 04:27:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2020-06-22 04:27:59,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-06-22 04:27:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 04:27:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-06-22 04:27:59,843 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-06-22 04:27:59,843 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-06-22 04:27:59,843 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:27:59,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-06-22 04:27:59,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 04:27:59,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:27:59,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:27:59,844 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:27:59,845 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1] [2020-06-22 04:27:59,845 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 141#L19-2 [2020-06-22 04:27:59,845 INFO L796 eck$LassoCheckResult]: Loop: 141#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 142#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 143#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 147#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 146#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 145#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 144#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 141#L19-2 [2020-06-22 04:27:59,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 6 times [2020-06-22 04:27:59,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:59,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:27:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:27:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash 516542728, now seen corresponding path program 5 times [2020-06-22 04:27:59,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:27:59,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:27:59,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:27:59,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:27:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:27:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:27:59,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:27:59,931 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2020-06-22 04:27:59,941 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-06-22 04:27:59,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:27:59,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 04:27:59,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:27:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:27:59,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:27:59,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-06-22 04:27:59,977 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:27:59,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 04:27:59,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-06-22 04:27:59,977 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-06-22 04:28:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:28:00,001 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-06-22 04:28:00,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 04:28:00,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-06-22 04:28:00,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 04:28:00,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2020-06-22 04:28:00,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 04:28:00,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 04:28:00,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-06-22 04:28:00,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:28:00,004 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-06-22 04:28:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-06-22 04:28:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 04:28:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 04:28:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-06-22 04:28:00,005 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-06-22 04:28:00,006 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-06-22 04:28:00,006 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 04:28:00,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-06-22 04:28:00,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 04:28:00,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:28:00,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:28:00,007 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:28:00,007 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1] [2020-06-22 04:28:00,007 INFO L794 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 187#L19-2 [2020-06-22 04:28:00,008 INFO L796 eck$LassoCheckResult]: Loop: 187#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 188#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 189#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 194#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 193#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 192#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 191#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 190#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 187#L19-2 [2020-06-22 04:28:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 7 times [2020-06-22 04:28:00,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:00,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:00,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:28:00,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:00,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1167044726, now seen corresponding path program 6 times [2020-06-22 04:28:00,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:00,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:28:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:28:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:28:00,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:28:00,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:28:00,111 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2020-06-22 04:28:00,121 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-06-22 04:28:00,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:28:00,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:28:00,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:28:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:28:00,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:28:00,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-06-22 04:28:00,167 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:28:00,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 04:28:00,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-06-22 04:28:00,168 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 9 states. [2020-06-22 04:28:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:28:00,192 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-06-22 04:28:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 04:28:00,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-06-22 04:28:00,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 04:28:00,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2020-06-22 04:28:00,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 04:28:00,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 04:28:00,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-06-22 04:28:00,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:28:00,194 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-06-22 04:28:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-06-22 04:28:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 04:28:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 04:28:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-06-22 04:28:00,196 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-06-22 04:28:00,196 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-06-22 04:28:00,196 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 04:28:00,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-06-22 04:28:00,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 04:28:00,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:28:00,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:28:00,197 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:28:00,197 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1] [2020-06-22 04:28:00,198 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 239#L19-2 [2020-06-22 04:28:00,198 INFO L796 eck$LassoCheckResult]: Loop: 239#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 240#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 241#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 247#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 246#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 245#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 244#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 243#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 242#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 239#L19-2 [2020-06-22 04:28:00,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 8 times [2020-06-22 04:28:00,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:00,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:00,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:28:00,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1818648248, now seen corresponding path program 7 times [2020-06-22 04:28:00,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:00,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:00,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:28:00,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:28:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:28:00,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:28:00,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:28:00,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:28:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:28:00,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 04:28:00,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:28:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:28:00,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:28:00,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 04:28:00,338 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:28:00,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 04:28:00,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-06-22 04:28:00,339 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-06-22 04:28:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:28:00,363 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-06-22 04:28:00,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 04:28:00,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-06-22 04:28:00,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 04:28:00,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-06-22 04:28:00,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:28:00,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 04:28:00,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-06-22 04:28:00,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:28:00,366 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 04:28:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-06-22 04:28:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 04:28:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 04:28:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-06-22 04:28:00,367 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 04:28:00,367 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 04:28:00,367 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 04:28:00,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-06-22 04:28:00,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 04:28:00,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:28:00,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:28:00,369 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:28:00,369 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1] [2020-06-22 04:28:00,369 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 297#L19-2 [2020-06-22 04:28:00,369 INFO L796 eck$LassoCheckResult]: Loop: 297#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 298#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 299#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 306#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 305#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 304#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 303#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 302#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 301#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 300#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 297#L19-2 [2020-06-22 04:28:00,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:00,370 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 9 times [2020-06-22 04:28:00,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:00,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:28:00,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash -543520950, now seen corresponding path program 8 times [2020-06-22 04:28:00,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:00,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:28:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:28:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:28:00,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:28:00,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:28:00,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 04:28:00,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 04:28:00,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:28:00,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 04:28:00,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:28:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:28:00,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:28:00,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-06-22 04:28:00,543 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:28:00,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 04:28:00,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-06-22 04:28:00,544 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 11 states. [2020-06-22 04:28:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:28:00,568 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-06-22 04:28:00,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 04:28:00,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-06-22 04:28:00,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 04:28:00,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2020-06-22 04:28:00,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 04:28:00,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 04:28:00,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-06-22 04:28:00,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:28:00,570 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-06-22 04:28:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-06-22 04:28:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 04:28:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 04:28:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-06-22 04:28:00,572 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-06-22 04:28:00,572 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-06-22 04:28:00,572 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 04:28:00,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2020-06-22 04:28:00,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 04:28:00,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:28:00,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:28:00,573 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:28:00,573 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1] [2020-06-22 04:28:00,574 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 361#L19-2 [2020-06-22 04:28:00,574 INFO L796 eck$LassoCheckResult]: Loop: 361#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 362#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 363#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 371#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 370#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 369#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 368#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 367#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 366#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 365#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 364#L21-2 [45] L21-2-->L19-2: Formula: (and (<= v_ULTIMATE.start_main_~x2~0_10 1) (= v_ULTIMATE.start_main_~x1~0_11 (+ v_ULTIMATE.start_main_~x1~0_12 1))) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_12, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_11, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x1~0] 361#L19-2 [2020-06-22 04:28:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 10 times [2020-06-22 04:28:00,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:00,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:28:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:00,580 INFO L82 PathProgramCache]: Analyzing trace with hash 330719624, now seen corresponding path program 9 times [2020-06-22 04:28:00,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:00,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:00,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:28:00,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:00,596 INFO L82 PathProgramCache]: Analyzing trace with hash -256086390, now seen corresponding path program 1 times [2020-06-22 04:28:00,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:00,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:00,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:28:00,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:00,720 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2020-06-22 04:28:00,742 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:28:00,743 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:28:00,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:28:00,743 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:28:00,744 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:28:00,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:00,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:28:00,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:28:00,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-22 04:28:00,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:28:00,744 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:28:00,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:00,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:00,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:00,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:00,840 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:28:00,841 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:00,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:28:00,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:28:00,879 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:28:00,879 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:00,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:28:00,884 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:28:00,911 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:28:00,911 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:00,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:28:00,917 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:00,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:28:00,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:28:01,007 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:28:01,010 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:28:01,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:28:01,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:28:01,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:28:01,010 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:28:01,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:28:01,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:28:01,011 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:28:01,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-22 04:28:01,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:28:01,011 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:28:01,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:01,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:01,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:01,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-06-22 04:28:01,115 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:28:01,120 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:28:01,122 INFO L122 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-06-22 04:28:01,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:28:01,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:28:01,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:28:01,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:28:01,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:28:01,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:28:01,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:28:01,133 INFO L122 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-06-22 04:28:01,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:28:01,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:28:01,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:28:01,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:28:01,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:28:01,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:28:01,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:28:01,140 INFO L122 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-06-22 04:28:01,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:28:01,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:28:01,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:28:01,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:28:01,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:28:01,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:28:01,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:28:01,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:28:01,145 INFO L122 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-06-22 04:28:01,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:28:01,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:28:01,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:28:01,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:28:01,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:28:01,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:28:01,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:28:01,149 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:28:01,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:28:01,153 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 04:28:01,155 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:28:01,155 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:28:01,155 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:28:01,156 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x1~0) = -2*ULTIMATE.start_main_~x1~0 + 21 Supporting invariants [] [2020-06-22 04:28:01,157 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:28:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:28:01,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:28:01,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:28:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:28:01,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:28:01,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:28:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-06-22 04:28:01,256 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 04:28:01,259 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 2 loop predicates [2020-06-22 04:28:01,260 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-06-22 04:28:01,281 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 23 states and 26 transitions. Complement of second has 4 states. [2020-06-22 04:28:01,282 INFO L142 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-06-22 04:28:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:28:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-06-22 04:28:01,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 1 letters. Loop has 11 letters. [2020-06-22 04:28:01,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:28:01,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 11 letters. [2020-06-22 04:28:01,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:28:01,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 1 letters. Loop has 22 letters. [2020-06-22 04:28:01,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:28:01,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2020-06-22 04:28:01,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:28:01,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2020-06-22 04:28:01,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:28:01,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 04:28:01,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2020-06-22 04:28:01,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:28:01,293 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-06-22 04:28:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2020-06-22 04:28:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2020-06-22 04:28:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 04:28:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-06-22 04:28:01,295 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-06-22 04:28:01,295 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-06-22 04:28:01,295 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 04:28:01,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-06-22 04:28:01,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 04:28:01,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:28:01,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:28:01,296 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 04:28:01,296 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 04:28:01,297 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x1~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~x2~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_1, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~x1~0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~x2~0, ULTIMATE.start_main_#res] 453#L19-2 [36] L19-2-->L21-2: Formula: (and (<= v_ULTIMATE.start_main_~x1~0_9 10) (= v_ULTIMATE.start_main_~x2~0_9 10)) InVars {ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9} OutVars{ULTIMATE.start_main_~x1~0=v_ULTIMATE.start_main_~x1~0_9, ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 455#L21-2 [2020-06-22 04:28:01,297 INFO L796 eck$LassoCheckResult]: Loop: 455#L21-2 [40] L21-2-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~x2~0_7 (+ v_ULTIMATE.start_main_~x2~0_8 (- 1))) (< 1 v_ULTIMATE.start_main_~x2~0_8)) InVars {ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_8} OutVars{ULTIMATE.start_main_~x2~0=v_ULTIMATE.start_main_~x2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~x2~0] 455#L21-2 [2020-06-22 04:28:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:01,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1989, now seen corresponding path program 1 times [2020-06-22 04:28:01,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:01,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:01,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:01,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:28:01,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:01,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times [2020-06-22 04:28:01,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:01,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:01,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:01,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:28:01,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash 61699, now seen corresponding path program 1 times [2020-06-22 04:28:01,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:28:01,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:28:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:01,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:28:01,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:28:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:28:01,324 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:28:01,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:28:01,324 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:28:01,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:28:01,324 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:28:01,324 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:01,324 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:28:01,325 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:28:01,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-06-22 04:28:01,325 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:28:01,325 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:28:01,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:01,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:01,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:01,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:28:01,373 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:01,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:28:01,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:28:01,405 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:28:01,405 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:01,410 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:28:01,410 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:28:01,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 04:28:01,437 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:01,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:28:01,442 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:28:01,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:28:01,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:28:01,509 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:28:01,511 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:28:01,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:28:01,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:28:01,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:28:01,511 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:28:01,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:28:01,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:28:01,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:28:01,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-06-22 04:28:01,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:28:01,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:28:01,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:01,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:01,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:28:01,561 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:28:01,561 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:28:01,561 INFO L122 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-06-22 04:28:01,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:28:01,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:28:01,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:28:01,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:28:01,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:28:01,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:28:01,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:28:01,567 INFO L122 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-06-22 04:28:01,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:28:01,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:28:01,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:28:01,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:28:01,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:28:01,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:28:01,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:28:01,571 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:28:01,574 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:28:01,574 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:28:01,574 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:28:01,575 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:28:01,575 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:28:01,575 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2020-06-22 04:28:01,575 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:28:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:28:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:28:01,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:28:01,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:28:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:28:01,613 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:28:01,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:28:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:28:01,614 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 04:28:01,614 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-06-22 04:28:01,615 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-06-22 04:28:01,626 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2020-06-22 04:28:01,626 INFO L142 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-06-22 04:28:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-06-22 04:28:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-22 04:28:01,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 1 letters. [2020-06-22 04:28:01,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:28:01,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2020-06-22 04:28:01,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:28:01,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 2 letters. [2020-06-22 04:28:01,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:28:01,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-06-22 04:28:01,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:28:01,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-06-22 04:28:01,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:28:01,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:28:01,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:28:01,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:28:01,630 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:28:01,630 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:28:01,630 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:28:01,630 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 04:28:01,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:28:01,631 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:28:01,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 04:28:01,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:28:01 BasicIcfg [2020-06-22 04:28:01,637 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:28:01,638 INFO L168 Benchmark]: Toolchain (without parser) took 3550.86 ms. Allocated memory was 514.9 MB in the beginning and 590.9 MB in the end (delta: 76.0 MB). Free memory was 440.2 MB in the beginning and 552.2 MB in the end (delta: -112.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:28:01,639 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:28:01,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.60 ms. Allocated memory was 514.9 MB in the beginning and 555.2 MB in the end (delta: 40.4 MB). Free memory was 440.2 MB in the beginning and 525.6 MB in the end (delta: -85.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:01,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.45 ms. Allocated memory is still 555.2 MB. Free memory was 525.6 MB in the beginning and 523.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:01,641 INFO L168 Benchmark]: Boogie Preprocessor took 18.85 ms. Allocated memory is still 555.2 MB. Free memory was 523.4 MB in the beginning and 521.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:01,641 INFO L168 Benchmark]: RCFGBuilder took 238.83 ms. Allocated memory is still 555.2 MB. Free memory was 521.9 MB in the beginning and 511.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:01,642 INFO L168 Benchmark]: BlockEncodingV2 took 79.94 ms. Allocated memory is still 555.2 MB. Free memory was 511.4 MB in the beginning and 506.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:01,642 INFO L168 Benchmark]: TraceAbstraction took 183.99 ms. Allocated memory is still 555.2 MB. Free memory was 505.4 MB in the beginning and 496.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:28:01,643 INFO L168 Benchmark]: BuchiAutomizer took 2707.82 ms. Allocated memory was 555.2 MB in the beginning and 590.9 MB in the end (delta: 35.7 MB). Free memory was 496.7 MB in the beginning and 552.2 MB in the end (delta: -55.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:28:01,647 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 11 edges - StatisticsResult: Encoded RCFG 3 locations, 4 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 281.60 ms. Allocated memory was 514.9 MB in the beginning and 555.2 MB in the end (delta: 40.4 MB). Free memory was 440.2 MB in the beginning and 525.6 MB in the end (delta: -85.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.45 ms. Allocated memory is still 555.2 MB. Free memory was 525.6 MB in the beginning and 523.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.85 ms. Allocated memory is still 555.2 MB. Free memory was 523.4 MB in the beginning and 521.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 238.83 ms. Allocated memory is still 555.2 MB. Free memory was 521.9 MB in the beginning and 511.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 79.94 ms. Allocated memory is still 555.2 MB. Free memory was 511.4 MB in the beginning and 506.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 183.99 ms. Allocated memory is still 555.2 MB. Free memory was 505.4 MB in the beginning and 496.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2707.82 ms. Allocated memory was 555.2 MB in the beginning and 590.9 MB in the end (delta: 35.7 MB). Free memory was 496.7 MB in the beginning and 552.2 MB in the end (delta: -55.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (9 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -2 * x1 + 21 and consists of 3 locations. One nondeterministic module has affine ranking function x2 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 12 iterations. TraceHistogramMax:9. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 37 SDtfs, 12 SDslu, 1 SDs, 0 SdLazy, 126 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax197 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 04:27:54.816 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 04:28:01.888 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check