103.49/69.60 YES 103.49/69.60 103.49/69.60 Ultimate: Cannot open display: 103.49/69.60 This is Ultimate 0.1.24-8dc7c08-m 103.49/69.60 [2019-03-28 11:58:15,686 INFO L170 SettingsManager]: Resetting all preferences to default values... 103.49/69.60 [2019-03-28 11:58:15,688 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 103.49/69.60 [2019-03-28 11:58:15,701 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 103.49/69.60 [2019-03-28 11:58:15,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 103.49/69.60 [2019-03-28 11:58:15,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 103.49/69.60 [2019-03-28 11:58:15,703 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 103.49/69.60 [2019-03-28 11:58:15,705 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 103.49/69.60 [2019-03-28 11:58:15,707 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 103.49/69.60 [2019-03-28 11:58:15,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 103.49/69.60 [2019-03-28 11:58:15,708 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 103.49/69.60 [2019-03-28 11:58:15,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 103.49/69.60 [2019-03-28 11:58:15,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 103.49/69.60 [2019-03-28 11:58:15,710 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 103.49/69.60 [2019-03-28 11:58:15,711 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 103.49/69.60 [2019-03-28 11:58:15,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 103.49/69.60 [2019-03-28 11:58:15,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 103.49/69.60 [2019-03-28 11:58:15,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 103.49/69.60 [2019-03-28 11:58:15,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 103.49/69.60 [2019-03-28 11:58:15,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 103.49/69.60 [2019-03-28 11:58:15,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 103.49/69.60 [2019-03-28 11:58:15,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 103.49/69.60 [2019-03-28 11:58:15,722 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 103.49/69.60 [2019-03-28 11:58:15,722 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 103.49/69.60 [2019-03-28 11:58:15,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 103.49/69.60 [2019-03-28 11:58:15,723 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 103.49/69.60 [2019-03-28 11:58:15,723 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 103.49/69.60 [2019-03-28 11:58:15,724 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 103.49/69.60 [2019-03-28 11:58:15,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 103.49/69.60 [2019-03-28 11:58:15,725 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 103.49/69.60 [2019-03-28 11:58:15,726 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 103.49/69.60 [2019-03-28 11:58:15,726 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 103.49/69.60 [2019-03-28 11:58:15,727 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 103.49/69.60 [2019-03-28 11:58:15,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 103.49/69.60 [2019-03-28 11:58:15,728 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 103.49/69.60 [2019-03-28 11:58:15,728 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 103.49/69.60 [2019-03-28 11:58:15,729 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 103.49/69.60 [2019-03-28 11:58:15,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 103.49/69.60 [2019-03-28 11:58:15,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 103.49/69.60 [2019-03-28 11:58:15,730 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 103.49/69.60 [2019-03-28 11:58:15,745 INFO L110 SettingsManager]: Loading preferences was successful 103.49/69.60 [2019-03-28 11:58:15,745 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 103.49/69.60 [2019-03-28 11:58:15,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 103.49/69.60 [2019-03-28 11:58:15,746 INFO L133 SettingsManager]: * Rewrite not-equals=true 103.49/69.60 [2019-03-28 11:58:15,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 103.49/69.60 [2019-03-28 11:58:15,747 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 103.49/69.60 [2019-03-28 11:58:15,747 INFO L133 SettingsManager]: * Use SBE=true 103.49/69.60 [2019-03-28 11:58:15,747 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 103.49/69.60 [2019-03-28 11:58:15,747 INFO L133 SettingsManager]: * Use old map elimination=false 103.49/69.60 [2019-03-28 11:58:15,747 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 103.49/69.60 [2019-03-28 11:58:15,747 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 103.49/69.60 [2019-03-28 11:58:15,748 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 103.49/69.60 [2019-03-28 11:58:15,748 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 103.49/69.60 [2019-03-28 11:58:15,748 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 103.49/69.60 [2019-03-28 11:58:15,748 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:15,748 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 103.49/69.60 [2019-03-28 11:58:15,748 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 103.49/69.60 [2019-03-28 11:58:15,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE 103.49/69.60 [2019-03-28 11:58:15,749 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 103.49/69.60 [2019-03-28 11:58:15,749 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 103.49/69.60 [2019-03-28 11:58:15,749 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 103.49/69.60 [2019-03-28 11:58:15,749 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 103.49/69.60 [2019-03-28 11:58:15,749 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 103.49/69.60 [2019-03-28 11:58:15,750 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 103.49/69.60 [2019-03-28 11:58:15,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 103.49/69.60 [2019-03-28 11:58:15,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 103.49/69.60 [2019-03-28 11:58:15,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 103.49/69.60 [2019-03-28 11:58:15,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 103.49/69.60 [2019-03-28 11:58:15,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 103.49/69.60 [2019-03-28 11:58:15,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 103.49/69.60 [2019-03-28 11:58:15,790 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 103.49/69.60 [2019-03-28 11:58:15,793 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 103.49/69.60 [2019-03-28 11:58:15,795 INFO L271 PluginConnector]: Initializing CDTParser... 103.49/69.60 [2019-03-28 11:58:15,795 INFO L276 PluginConnector]: CDTParser initialized 103.49/69.60 [2019-03-28 11:58:15,796 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 103.49/69.60 [2019-03-28 11:58:15,859 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/7ea595e0b99640789f958c05429afcb5/FLAGaa1af432a 103.49/69.60 [2019-03-28 11:58:16,210 INFO L307 CDTParser]: Found 1 translation units. 103.49/69.60 [2019-03-28 11:58:16,210 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 103.49/69.60 [2019-03-28 11:58:16,217 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/7ea595e0b99640789f958c05429afcb5/FLAGaa1af432a 103.49/69.60 [2019-03-28 11:58:16,623 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/7ea595e0b99640789f958c05429afcb5 103.49/69.60 [2019-03-28 11:58:16,634 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 103.49/69.60 [2019-03-28 11:58:16,636 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 103.49/69.60 [2019-03-28 11:58:16,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 103.49/69.60 [2019-03-28 11:58:16,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 103.49/69.60 [2019-03-28 11:58:16,641 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 103.49/69.60 [2019-03-28 11:58:16,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b00aa81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16, skipping insertion in model container 103.49/69.60 [2019-03-28 11:58:16,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 103.49/69.60 [2019-03-28 11:58:16,672 INFO L176 MainTranslator]: Built tables and reachable declarations 103.49/69.60 [2019-03-28 11:58:16,829 INFO L206 PostProcessor]: Analyzing one entry point: main 103.49/69.60 [2019-03-28 11:58:16,833 INFO L191 MainTranslator]: Completed pre-run 103.49/69.60 [2019-03-28 11:58:16,850 INFO L206 PostProcessor]: Analyzing one entry point: main 103.49/69.60 [2019-03-28 11:58:16,866 INFO L195 MainTranslator]: Completed translation 103.49/69.60 [2019-03-28 11:58:16,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16 WrapperNode 103.49/69.60 [2019-03-28 11:58:16,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 103.49/69.60 [2019-03-28 11:58:16,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 103.49/69.60 [2019-03-28 11:58:16,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 103.49/69.60 [2019-03-28 11:58:16,867 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 103.49/69.60 [2019-03-28 11:58:16,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 103.49/69.60 [2019-03-28 11:58:16,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 103.49/69.60 [2019-03-28 11:58:16,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 103.49/69.60 [2019-03-28 11:58:16,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized 103.49/69.60 [2019-03-28 11:58:16,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 [2019-03-28 11:58:16,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 103.49/69.60 [2019-03-28 11:58:16,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 103.49/69.60 [2019-03-28 11:58:16,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... 103.49/69.60 [2019-03-28 11:58:16,977 INFO L276 PluginConnector]: RCFGBuilder initialized 103.49/69.60 [2019-03-28 11:58:16,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (1/1) ... 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 103.49/69.60 [2019-03-28 11:58:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 103.49/69.60 [2019-03-28 11:58:17,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 103.49/69.60 [2019-03-28 11:58:17,190 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 103.49/69.60 [2019-03-28 11:58:17,190 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 103.49/69.60 [2019-03-28 11:58:17,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:58:17 BoogieIcfgContainer 103.49/69.60 [2019-03-28 11:58:17,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 103.49/69.60 [2019-03-28 11:58:17,192 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 103.49/69.60 [2019-03-28 11:58:17,192 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 103.49/69.60 [2019-03-28 11:58:17,194 INFO L276 PluginConnector]: BlockEncodingV2 initialized 103.49/69.60 [2019-03-28 11:58:17,195 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:58:17" (1/1) ... 103.49/69.60 [2019-03-28 11:58:17,210 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 15 edges 103.49/69.60 [2019-03-28 11:58:17,212 INFO L258 BlockEncoder]: Using Remove infeasible edges 103.49/69.60 [2019-03-28 11:58:17,213 INFO L263 BlockEncoder]: Using Maximize final states 103.49/69.60 [2019-03-28 11:58:17,213 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 103.49/69.60 [2019-03-28 11:58:17,214 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 103.49/69.60 [2019-03-28 11:58:17,216 INFO L296 BlockEncoder]: Using Remove sink states 103.49/69.60 [2019-03-28 11:58:17,217 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 103.49/69.60 [2019-03-28 11:58:17,217 INFO L179 BlockEncoder]: Using Rewrite not-equals 103.49/69.60 [2019-03-28 11:58:17,234 INFO L185 BlockEncoder]: Using Use SBE 103.49/69.60 [2019-03-28 11:58:17,251 INFO L200 BlockEncoder]: SBE split 4 edges 103.49/69.60 [2019-03-28 11:58:17,256 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility 103.49/69.60 [2019-03-28 11:58:17,257 INFO L71 MaximizeFinalStates]: 0 new accepting states 103.49/69.60 [2019-03-28 11:58:17,269 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 103.49/69.60 [2019-03-28 11:58:17,272 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 103.49/69.60 [2019-03-28 11:58:17,273 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 103.49/69.60 [2019-03-28 11:58:17,273 INFO L71 MaximizeFinalStates]: 0 new accepting states 103.49/69.60 [2019-03-28 11:58:17,273 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 103.49/69.60 [2019-03-28 11:58:17,274 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 103.49/69.60 [2019-03-28 11:58:17,274 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 12 edges 103.49/69.60 [2019-03-28 11:58:17,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:58:17 BasicIcfg 103.49/69.60 [2019-03-28 11:58:17,275 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 103.49/69.60 [2019-03-28 11:58:17,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 103.49/69.60 [2019-03-28 11:58:17,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... 103.49/69.60 [2019-03-28 11:58:17,279 INFO L276 PluginConnector]: TraceAbstraction initialized 103.49/69.60 [2019-03-28 11:58:17,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:58:16" (1/4) ... 103.49/69.60 [2019-03-28 11:58:17,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301f5a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:58:17, skipping insertion in model container 103.49/69.60 [2019-03-28 11:58:17,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (2/4) ... 103.49/69.60 [2019-03-28 11:58:17,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301f5a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:58:17, skipping insertion in model container 103.49/69.60 [2019-03-28 11:58:17,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:58:17" (3/4) ... 103.49/69.60 [2019-03-28 11:58:17,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301f5a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:58:17, skipping insertion in model container 103.49/69.60 [2019-03-28 11:58:17,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:58:17" (4/4) ... 103.49/69.60 [2019-03-28 11:58:17,284 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 103.49/69.60 [2019-03-28 11:58:17,294 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 103.49/69.60 [2019-03-28 11:58:17,303 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 103.49/69.60 [2019-03-28 11:58:17,321 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 103.49/69.60 [2019-03-28 11:58:17,351 INFO L133 ementStrategyFactory]: Using default assertion order modulation 103.49/69.60 [2019-03-28 11:58:17,351 INFO L382 AbstractCegarLoop]: Interprodecural is true 103.49/69.60 [2019-03-28 11:58:17,352 INFO L383 AbstractCegarLoop]: Hoare is true 103.49/69.60 [2019-03-28 11:58:17,352 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 103.49/69.60 [2019-03-28 11:58:17,352 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 103.49/69.60 [2019-03-28 11:58:17,352 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 103.49/69.60 [2019-03-28 11:58:17,352 INFO L387 AbstractCegarLoop]: Difference is false 103.49/69.60 [2019-03-28 11:58:17,353 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 103.49/69.60 [2019-03-28 11:58:17,353 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 103.49/69.60 [2019-03-28 11:58:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. 103.49/69.60 [2019-03-28 11:58:17,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 103.49/69.60 [2019-03-28 11:58:17,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. 103.49/69.60 [2019-03-28 11:58:17,431 INFO L451 ceAbstractionStarter]: At program point L18-2(lines 18 20) the Hoare annotation is: true 103.49/69.60 [2019-03-28 11:58:17,432 INFO L448 ceAbstractionStarter]: For program point L18-3(lines 18 20) no Hoare annotation was computed. 103.49/69.60 [2019-03-28 11:58:17,432 INFO L451 ceAbstractionStarter]: At program point L16-2(lines 16 22) the Hoare annotation is: true 103.49/69.60 [2019-03-28 11:58:17,432 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 103.49/69.60 [2019-03-28 11:58:17,432 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 16 22) no Hoare annotation was computed. 103.49/69.60 [2019-03-28 11:58:17,433 INFO L451 ceAbstractionStarter]: At program point L14-2(lines 14 24) the Hoare annotation is: true 103.49/69.60 [2019-03-28 11:58:17,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:58:17 BasicIcfg 103.49/69.60 [2019-03-28 11:58:17,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 103.49/69.60 [2019-03-28 11:58:17,443 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 103.49/69.60 [2019-03-28 11:58:17,443 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 103.49/69.60 [2019-03-28 11:58:17,446 INFO L276 PluginConnector]: BuchiAutomizer initialized 103.49/69.60 [2019-03-28 11:58:17,447 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 103.49/69.60 [2019-03-28 11:58:17,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:58:16" (1/5) ... 103.49/69.60 [2019-03-28 11:58:17,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fbf838c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:58:17, skipping insertion in model container 103.49/69.60 [2019-03-28 11:58:17,448 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 103.49/69.60 [2019-03-28 11:58:17,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:16" (2/5) ... 103.49/69.60 [2019-03-28 11:58:17,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fbf838c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:58:17, skipping insertion in model container 103.49/69.60 [2019-03-28 11:58:17,449 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 103.49/69.60 [2019-03-28 11:58:17,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:58:17" (3/5) ... 103.49/69.60 [2019-03-28 11:58:17,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fbf838c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:58:17, skipping insertion in model container 103.49/69.60 [2019-03-28 11:58:17,450 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 103.49/69.60 [2019-03-28 11:58:17,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:58:17" (4/5) ... 103.49/69.60 [2019-03-28 11:58:17,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fbf838c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:58:17, skipping insertion in model container 103.49/69.60 [2019-03-28 11:58:17,450 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 103.49/69.60 [2019-03-28 11:58:17,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:58:17" (5/5) ... 103.49/69.60 [2019-03-28 11:58:17,452 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 103.49/69.60 [2019-03-28 11:58:17,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation 103.49/69.60 [2019-03-28 11:58:17,480 INFO L374 BuchiCegarLoop]: Interprodecural is true 103.49/69.60 [2019-03-28 11:58:17,480 INFO L375 BuchiCegarLoop]: Hoare is true 103.49/69.60 [2019-03-28 11:58:17,480 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 103.49/69.60 [2019-03-28 11:58:17,480 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 103.49/69.60 [2019-03-28 11:58:17,480 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 103.49/69.60 [2019-03-28 11:58:17,480 INFO L379 BuchiCegarLoop]: Difference is false 103.49/69.60 [2019-03-28 11:58:17,480 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 103.49/69.60 [2019-03-28 11:58:17,481 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 103.49/69.60 [2019-03-28 11:58:17,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 103.49/69.60 [2019-03-28 11:58:17,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 103.49/69.60 [2019-03-28 11:58:17,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.49/69.60 [2019-03-28 11:58:17,503 INFO L119 BuchiIsEmpty]: Starting construction of run 103.49/69.60 [2019-03-28 11:58:17,509 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 103.49/69.60 [2019-03-28 11:58:17,509 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 103.49/69.60 [2019-03-28 11:58:17,509 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 103.49/69.60 [2019-03-28 11:58:17,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 103.49/69.60 [2019-03-28 11:58:17,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 103.49/69.60 [2019-03-28 11:58:17,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.49/69.60 [2019-03-28 11:58:17,510 INFO L119 BuchiIsEmpty]: Starting construction of run 103.49/69.60 [2019-03-28 11:58:17,511 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 103.49/69.60 [2019-03-28 11:58:17,511 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 103.49/69.60 [2019-03-28 11:58:17,516 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 6#L14-2true 103.49/69.60 [2019-03-28 11:58:17,516 INFO L796 eck$LassoCheckResult]: Loop: 6#L14-2true [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8#L16-2true [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 7#L16-3true [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 6#L14-2true 103.49/69.60 [2019-03-28 11:58:17,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:17,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:17,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:17,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 81800, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:17,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:17,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:17,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:17,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:17,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2316125, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:17,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:17,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:17,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:17,688 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:17,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:17,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:17,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:17,689 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.49/69.60 [2019-03-28 11:58:17,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:17,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:17,690 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:17,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 103.49/69.60 [2019-03-28 11:58:17,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:17,691 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:17,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:17,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:17,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:17,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:17,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:17,821 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:17,822 INFO L412 LassoAnalysis]: Checking for nontermination... 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:17,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:17,835 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:17,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:17,872 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:17,893 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:17,893 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=0} Honda state: {ULTIMATE.start_main_~y~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~y~0=2}, {ULTIMATE.start_main_~y~0=1}, {ULTIMATE.start_main_~y~0=-2}] Lambdas: [1, 1, 1] Nus: [0, 0] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:17,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:17,924 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:17,928 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:17,928 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:17,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:17,959 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:17,963 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:17,963 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:17,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:17,992 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:18,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:18,024 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:18,056 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.49/69.60 [2019-03-28 11:58:18,058 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:18,058 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:18,058 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:18,058 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:18,058 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.49/69.60 [2019-03-28 11:58:18,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:18,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:18,059 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:18,059 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 103.49/69.60 [2019-03-28 11:58:18,059 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:18,059 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:18,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,130 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:18,136 INFO L497 LassoAnalysis]: Using template 'affine'. 103.49/69.60 [2019-03-28 11:58:18,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:18,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:18,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:18,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:18,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:18,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:18,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:18,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:18,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:18,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:18,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:18,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:18,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:18,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:18,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:18,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:18,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:18,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:18,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:18,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:18,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:18,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:18,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:18,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:18,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:18,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:18,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:18,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:18,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:18,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:18,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:18,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:18,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:18,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:18,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:18,166 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.49/69.60 [2019-03-28 11:58:18,169 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 103.49/69.60 [2019-03-28 11:58:18,170 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 103.49/69.60 [2019-03-28 11:58:18,172 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.49/69.60 [2019-03-28 11:58:18,172 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.49/69.60 [2019-03-28 11:58:18,172 INFO L518 LassoAnalysis]: Proved termination. 103.49/69.60 [2019-03-28 11:58:18,173 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.49/69.60 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 103.49/69.60 Supporting invariants [] 103.49/69.60 [2019-03-28 11:58:18,174 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.49/69.60 [2019-03-28 11:58:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:18,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:18,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:18,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:18,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 103.49/69.60 [2019-03-28 11:58:18,275 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 103.49/69.60 [2019-03-28 11:58:18,280 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 3 loop predicates 103.49/69.60 [2019-03-28 11:58:18,281 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. 103.49/69.60 [2019-03-28 11:58:18,366 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 20 states and 45 transitions. Complement of second has 6 states. 103.49/69.60 [2019-03-28 11:58:18,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 103.49/69.60 [2019-03-28 11:58:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 103.49/69.60 [2019-03-28 11:58:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. 103.49/69.60 [2019-03-28 11:58:18,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 1 letters. Loop has 3 letters. 103.49/69.60 [2019-03-28 11:58:18,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:18,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 4 letters. Loop has 3 letters. 103.49/69.60 [2019-03-28 11:58:18,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:18,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 1 letters. Loop has 6 letters. 103.49/69.60 [2019-03-28 11:58:18,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:18,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 45 transitions. 103.49/69.60 [2019-03-28 11:58:18,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 103.49/69.60 [2019-03-28 11:58:18,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 39 transitions. 103.49/69.60 [2019-03-28 11:58:18,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 103.49/69.60 [2019-03-28 11:58:18,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 103.49/69.60 [2019-03-28 11:58:18,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 39 transitions. 103.49/69.60 [2019-03-28 11:58:18,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.49/69.60 [2019-03-28 11:58:18,391 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 39 transitions. 103.49/69.60 [2019-03-28 11:58:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 39 transitions. 103.49/69.60 [2019-03-28 11:58:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. 103.49/69.60 [2019-03-28 11:58:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 103.49/69.60 [2019-03-28 11:58:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. 103.49/69.60 [2019-03-28 11:58:18,423 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 35 transitions. 103.49/69.60 [2019-03-28 11:58:18,423 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 35 transitions. 103.49/69.60 [2019-03-28 11:58:18,423 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 103.49/69.60 [2019-03-28 11:58:18,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 35 transitions. 103.49/69.60 [2019-03-28 11:58:18,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 103.49/69.60 [2019-03-28 11:58:18,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.49/69.60 [2019-03-28 11:58:18,424 INFO L119 BuchiIsEmpty]: Starting construction of run 103.49/69.60 [2019-03-28 11:58:18,425 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 103.49/69.60 [2019-03-28 11:58:18,425 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 103.49/69.60 [2019-03-28 11:58:18,425 INFO L794 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 71#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 75#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 72#L18-2 103.49/69.60 [2019-03-28 11:58:18,426 INFO L796 eck$LassoCheckResult]: Loop: 72#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 66#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 67#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 72#L18-2 103.49/69.60 [2019-03-28 11:58:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash 74715, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:18,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:18,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:18,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:18,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:18,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash 96569, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:18,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:18,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2069065953, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:18,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:18,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:18,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:18,489 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:18,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:18,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:18,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:18,490 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.49/69.60 [2019-03-28 11:58:18,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:18,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:18,490 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:18,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 103.49/69.60 [2019-03-28 11:58:18,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:18,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:18,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:18,555 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:18,555 INFO L412 LassoAnalysis]: Checking for nontermination... 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:18,562 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:18,562 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:18,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:18,567 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:18,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:18,597 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:18,624 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:18,625 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:18,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:18,632 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:18,636 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:18,636 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:18,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:18,665 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:18,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:18,699 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:19,065 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.49/69.60 [2019-03-28 11:58:19,067 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:19,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:19,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:19,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:19,069 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.49/69.60 [2019-03-28 11:58:19,069 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:19,069 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:19,069 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:19,069 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 103.49/69.60 [2019-03-28 11:58:19,069 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:19,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:19,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,123 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:19,123 INFO L497 LassoAnalysis]: Using template 'affine'. 103.49/69.60 [2019-03-28 11:58:19,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:19,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:19,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:19,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:19,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:19,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:19,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:19,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:19,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:19,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:19,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:19,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:19,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:19,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:19,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:19,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:19,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:19,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:19,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:19,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:19,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:19,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:19,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:19,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:19,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:19,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:19,140 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.49/69.60 [2019-03-28 11:58:19,145 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 103.49/69.60 [2019-03-28 11:58:19,145 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 103.49/69.60 [2019-03-28 11:58:19,145 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.49/69.60 [2019-03-28 11:58:19,145 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.49/69.60 [2019-03-28 11:58:19,146 INFO L518 LassoAnalysis]: Proved termination. 103.49/69.60 [2019-03-28 11:58:19,146 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.49/69.60 Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~y~0 - 1*ULTIMATE.start_main_~x~0 103.49/69.60 Supporting invariants [] 103.49/69.60 [2019-03-28 11:58:19,146 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.49/69.60 [2019-03-28 11:58:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:19,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:19,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:19,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:19,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 103.49/69.60 [2019-03-28 11:58:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:19,205 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:19,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:19,225 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 103.49/69.60 [2019-03-28 11:58:19,226 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 3 loop predicates 103.49/69.60 [2019-03-28 11:58:19,226 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 35 transitions. cyclomatic complexity: 22 Second operand 4 states. 103.49/69.60 [2019-03-28 11:58:19,288 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 35 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 37 states and 85 transitions. Complement of second has 6 states. 103.49/69.60 [2019-03-28 11:58:19,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 103.49/69.60 [2019-03-28 11:58:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 103.49/69.60 [2019-03-28 11:58:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. 103.49/69.60 [2019-03-28 11:58:19,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 3 letters. 103.49/69.60 [2019-03-28 11:58:19,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:19,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 3 letters. 103.49/69.60 [2019-03-28 11:58:19,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:19,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 6 letters. 103.49/69.60 [2019-03-28 11:58:19,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:19,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 85 transitions. 103.49/69.60 [2019-03-28 11:58:19,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 103.49/69.60 [2019-03-28 11:58:19,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 76 transitions. 103.49/69.60 [2019-03-28 11:58:19,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 103.49/69.60 [2019-03-28 11:58:19,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 103.49/69.60 [2019-03-28 11:58:19,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 76 transitions. 103.49/69.60 [2019-03-28 11:58:19,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.49/69.60 [2019-03-28 11:58:19,300 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 76 transitions. 103.49/69.60 [2019-03-28 11:58:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 76 transitions. 103.49/69.60 [2019-03-28 11:58:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. 103.49/69.60 [2019-03-28 11:58:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 103.49/69.60 [2019-03-28 11:58:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 74 transitions. 103.49/69.60 [2019-03-28 11:58:19,304 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 74 transitions. 103.49/69.60 [2019-03-28 11:58:19,304 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 74 transitions. 103.49/69.60 [2019-03-28 11:58:19,304 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 103.49/69.60 [2019-03-28 11:58:19,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 74 transitions. 103.49/69.60 [2019-03-28 11:58:19,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 103.49/69.60 [2019-03-28 11:58:19,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.49/69.60 [2019-03-28 11:58:19,306 INFO L119 BuchiIsEmpty]: Starting construction of run 103.49/69.60 [2019-03-28 11:58:19,306 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 103.49/69.60 [2019-03-28 11:58:19,306 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 103.49/69.60 [2019-03-28 11:58:19,306 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 177#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 178#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 183#L18-2 103.49/69.60 [2019-03-28 11:58:19,307 INFO L796 eck$LassoCheckResult]: Loop: 183#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 168#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 169#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 183#L18-2 103.49/69.60 [2019-03-28 11:58:19,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash 74714, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:19,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:19,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:19,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:19,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:19,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:19,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:19,318 INFO L82 PathProgramCache]: Analyzing trace with hash 96569, now seen corresponding path program 2 times 103.49/69.60 [2019-03-28 11:58:19,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:19,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:19,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:19,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:19,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:19,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2069095744, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:19,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:19,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:19,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:19,355 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:19,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:19,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:19,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:19,356 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.49/69.60 [2019-03-28 11:58:19,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:19,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:19,356 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:19,356 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 103.49/69.60 [2019-03-28 11:58:19,356 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:19,356 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:19,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,414 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:19,414 INFO L412 LassoAnalysis]: Checking for nontermination... 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:19,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:19,421 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:19,448 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:19,449 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:19,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:19,455 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:19,459 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:19,459 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:19,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:19,488 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:19,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:19,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:19,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:19,520 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:19,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:19,551 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:19,891 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.49/69.60 [2019-03-28 11:58:19,893 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:19,893 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:19,894 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:19,894 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:19,894 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.49/69.60 [2019-03-28 11:58:19,894 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:19,894 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:19,894 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:19,894 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 103.49/69.60 [2019-03-28 11:58:19,894 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:19,895 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:19,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:19,947 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:19,948 INFO L497 LassoAnalysis]: Using template 'affine'. 103.49/69.60 [2019-03-28 11:58:19,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:19,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:19,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:19,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:19,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:19,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:19,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:19,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:19,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:19,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:19,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:19,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:19,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:19,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:19,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:19,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:19,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:19,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:19,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:19,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:19,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:19,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:19,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:19,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:19,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:19,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:19,961 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.49/69.60 [2019-03-28 11:58:19,966 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 103.49/69.60 [2019-03-28 11:58:19,966 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 103.49/69.60 [2019-03-28 11:58:19,967 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.49/69.60 [2019-03-28 11:58:19,967 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.49/69.60 [2019-03-28 11:58:19,967 INFO L518 LassoAnalysis]: Proved termination. 103.49/69.60 [2019-03-28 11:58:19,967 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.49/69.60 Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~y~0) = -1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~y~0 103.49/69.60 Supporting invariants [] 103.49/69.60 [2019-03-28 11:58:19,968 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.49/69.60 [2019-03-28 11:58:19,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:19,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:19,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:19,993 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:19,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 103.49/69.60 [2019-03-28 11:58:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:20,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:20,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:20,055 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 103.49/69.60 [2019-03-28 11:58:20,055 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 3 loop predicates 103.49/69.60 [2019-03-28 11:58:20,055 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 31 states and 74 transitions. cyclomatic complexity: 47 Second operand 4 states. 103.49/69.60 [2019-03-28 11:58:20,120 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 31 states and 74 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 79 states and 195 transitions. Complement of second has 6 states. 103.49/69.60 [2019-03-28 11:58:20,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 103.49/69.60 [2019-03-28 11:58:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 103.49/69.60 [2019-03-28 11:58:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. 103.49/69.60 [2019-03-28 11:58:20,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 3 letters. 103.49/69.60 [2019-03-28 11:58:20,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:20,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 3 letters. 103.49/69.60 [2019-03-28 11:58:20,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:20,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 6 letters. 103.49/69.60 [2019-03-28 11:58:20,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:20,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 195 transitions. 103.49/69.60 [2019-03-28 11:58:20,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 103.49/69.60 [2019-03-28 11:58:20,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 62 states and 152 transitions. 103.49/69.60 [2019-03-28 11:58:20,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 103.49/69.60 [2019-03-28 11:58:20,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 103.49/69.60 [2019-03-28 11:58:20,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 152 transitions. 103.49/69.60 [2019-03-28 11:58:20,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.49/69.60 [2019-03-28 11:58:20,131 INFO L706 BuchiCegarLoop]: Abstraction has 62 states and 152 transitions. 103.49/69.60 [2019-03-28 11:58:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 152 transitions. 103.49/69.60 [2019-03-28 11:58:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 23. 103.49/69.60 [2019-03-28 11:58:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 103.49/69.60 [2019-03-28 11:58:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 55 transitions. 103.49/69.60 [2019-03-28 11:58:20,135 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 55 transitions. 103.49/69.60 [2019-03-28 11:58:20,135 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 55 transitions. 103.49/69.60 [2019-03-28 11:58:20,135 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 103.49/69.60 [2019-03-28 11:58:20,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 55 transitions. 103.49/69.60 [2019-03-28 11:58:20,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 103.49/69.60 [2019-03-28 11:58:20,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.49/69.60 [2019-03-28 11:58:20,136 INFO L119 BuchiIsEmpty]: Starting construction of run 103.49/69.60 [2019-03-28 11:58:20,137 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 103.49/69.60 [2019-03-28 11:58:20,137 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 103.49/69.60 [2019-03-28 11:58:20,137 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 336#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 337#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 331#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 333#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 327#L18-3 103.49/69.60 [2019-03-28 11:58:20,138 INFO L796 eck$LassoCheckResult]: Loop: 327#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 328#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 339#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 340#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 344#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 343#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 327#L18-3 103.49/69.60 [2019-03-28 11:58:20,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:20,138 INFO L82 PathProgramCache]: Analyzing trace with hash 71803385, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:20,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:20,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:20,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:20,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2087044618, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:20,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:20,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 15630830, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:20,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:20,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,220 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:20,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:20,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:20,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:20,220 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.49/69.60 [2019-03-28 11:58:20,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:20,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:20,221 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:20,221 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 103.49/69.60 [2019-03-28 11:58:20,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:20,221 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:20,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,287 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:20,288 INFO L412 LassoAnalysis]: Checking for nontermination... 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:20,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:20,292 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:20,295 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:20,296 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:20,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:20,323 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:20,327 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:20,327 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:20,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:20,355 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:20,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:20,387 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:20,675 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.49/69.60 [2019-03-28 11:58:20,678 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:20,678 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:20,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:20,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:20,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.49/69.60 [2019-03-28 11:58:20,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:20,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:20,678 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:20,679 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 103.49/69.60 [2019-03-28 11:58:20,679 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:20,679 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:20,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:20,742 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:20,743 INFO L497 LassoAnalysis]: Using template 'affine'. 103.49/69.60 [2019-03-28 11:58:20,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:20,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:20,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:20,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:20,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:20,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:20,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:20,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:20,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:20,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:20,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:20,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:20,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:20,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:20,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:20,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:20,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:20,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:20,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:20,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:20,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:20,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:20,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:20,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:20,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:20,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:20,756 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.49/69.60 [2019-03-28 11:58:20,760 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 103.49/69.60 [2019-03-28 11:58:20,760 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 103.49/69.60 [2019-03-28 11:58:20,760 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.49/69.60 [2019-03-28 11:58:20,761 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.49/69.60 [2019-03-28 11:58:20,761 INFO L518 LassoAnalysis]: Proved termination. 103.49/69.60 [2019-03-28 11:58:20,761 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.49/69.60 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 103.49/69.60 Supporting invariants [] 103.49/69.60 [2019-03-28 11:58:20,761 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.49/69.60 [2019-03-28 11:58:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:20,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:20,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:20,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:20,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 103.49/69.60 [2019-03-28 11:58:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:20,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:20,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:20,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:20,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:20,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:20,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:20,869 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 103.49/69.60 [2019-03-28 11:58:20,869 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 5 loop predicates 103.49/69.60 [2019-03-28 11:58:20,869 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 55 transitions. cyclomatic complexity: 35 Second operand 5 states. 103.49/69.60 [2019-03-28 11:58:20,928 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 55 transitions. cyclomatic complexity: 35. Second operand 5 states. Result 90 states and 190 transitions. Complement of second has 8 states. 103.49/69.60 [2019-03-28 11:58:20,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 103.49/69.60 [2019-03-28 11:58:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 103.49/69.60 [2019-03-28 11:58:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. 103.49/69.60 [2019-03-28 11:58:20,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 6 letters. 103.49/69.60 [2019-03-28 11:58:20,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:20,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. 103.49/69.60 [2019-03-28 11:58:20,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:20,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 12 letters. 103.49/69.60 [2019-03-28 11:58:20,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:20,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 190 transitions. 103.49/69.60 [2019-03-28 11:58:20,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 103.49/69.60 [2019-03-28 11:58:20,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 65 states and 139 transitions. 103.49/69.60 [2019-03-28 11:58:20,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 103.49/69.60 [2019-03-28 11:58:20,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 103.49/69.60 [2019-03-28 11:58:20,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 139 transitions. 103.49/69.60 [2019-03-28 11:58:20,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.49/69.60 [2019-03-28 11:58:20,938 INFO L706 BuchiCegarLoop]: Abstraction has 65 states and 139 transitions. 103.49/69.60 [2019-03-28 11:58:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 139 transitions. 103.49/69.60 [2019-03-28 11:58:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 36. 103.49/69.60 [2019-03-28 11:58:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 103.49/69.60 [2019-03-28 11:58:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 83 transitions. 103.49/69.60 [2019-03-28 11:58:20,942 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 83 transitions. 103.49/69.60 [2019-03-28 11:58:20,942 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 83 transitions. 103.49/69.60 [2019-03-28 11:58:20,942 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 103.49/69.60 [2019-03-28 11:58:20,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 83 transitions. 103.49/69.60 [2019-03-28 11:58:20,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 103.49/69.60 [2019-03-28 11:58:20,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.49/69.60 [2019-03-28 11:58:20,944 INFO L119 BuchiIsEmpty]: Starting construction of run 103.49/69.60 [2019-03-28 11:58:20,944 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 103.49/69.60 [2019-03-28 11:58:20,944 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 103.49/69.60 [2019-03-28 11:58:20,945 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 558#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 559#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 552#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 553#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 568#L18-3 103.49/69.60 [2019-03-28 11:58:20,945 INFO L796 eck$LassoCheckResult]: Loop: 568#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 565#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 562#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 563#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 567#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 569#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 568#L18-3 103.49/69.60 [2019-03-28 11:58:20,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:20,945 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:20,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2087044618, now seen corresponding path program 2 times 103.49/69.60 [2019-03-28 11:58:20,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:20,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:20,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:20,965 INFO L82 PathProgramCache]: Analyzing trace with hash -871872851, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:20,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:20,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:20,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:21,019 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:21,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:21,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:21,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:21,020 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.49/69.60 [2019-03-28 11:58:21,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:21,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:21,020 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:21,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 103.49/69.60 [2019-03-28 11:58:21,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:21,020 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:21,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,092 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:21,092 INFO L412 LassoAnalysis]: Checking for nontermination... 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:21,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:21,096 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:21,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:21,128 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:21,361 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.49/69.60 [2019-03-28 11:58:21,364 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:21,364 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:21,364 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:21,364 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:21,364 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.49/69.60 [2019-03-28 11:58:21,364 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:21,364 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:21,364 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:21,365 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 103.49/69.60 [2019-03-28 11:58:21,365 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:21,365 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:21,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:21,423 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:21,424 INFO L497 LassoAnalysis]: Using template 'affine'. 103.49/69.60 [2019-03-28 11:58:21,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:21,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:21,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:21,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:21,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:21,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:21,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:21,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:21,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:21,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:21,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:21,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:21,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:21,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:21,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:21,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:21,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:21,433 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.49/69.60 [2019-03-28 11:58:21,436 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 103.49/69.60 [2019-03-28 11:58:21,436 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 103.49/69.60 [2019-03-28 11:58:21,437 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.49/69.60 [2019-03-28 11:58:21,437 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.49/69.60 [2019-03-28 11:58:21,437 INFO L518 LassoAnalysis]: Proved termination. 103.49/69.60 [2019-03-28 11:58:21,437 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.49/69.60 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 103.49/69.60 Supporting invariants [] 103.49/69.60 [2019-03-28 11:58:21,437 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.49/69.60 [2019-03-28 11:58:21,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:21,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:21,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:21,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:21,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 103.49/69.60 [2019-03-28 11:58:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:21,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:21,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:21,632 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:21,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:21,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:21,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:21,730 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 14 predicates after loop cannibalization 103.49/69.60 [2019-03-28 11:58:21,730 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 14 loop predicates 103.49/69.60 [2019-03-28 11:58:21,731 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states and 83 transitions. cyclomatic complexity: 49 Second operand 6 states. 103.49/69.60 [2019-03-28 11:58:22,173 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states and 83 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 727 states and 1451 transitions. Complement of second has 67 states. 103.49/69.60 [2019-03-28 11:58:22,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states 103.49/69.60 [2019-03-28 11:58:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 103.49/69.60 [2019-03-28 11:58:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. 103.49/69.60 [2019-03-28 11:58:22,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 66 transitions. Stem has 5 letters. Loop has 6 letters. 103.49/69.60 [2019-03-28 11:58:22,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:22,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. 103.49/69.60 [2019-03-28 11:58:22,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:22,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 66 transitions. Stem has 5 letters. Loop has 12 letters. 103.49/69.60 [2019-03-28 11:58:22,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:22,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 727 states and 1451 transitions. 103.49/69.60 [2019-03-28 11:58:22,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 279 103.49/69.60 [2019-03-28 11:58:22,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 727 states to 367 states and 709 transitions. 103.49/69.60 [2019-03-28 11:58:22,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 103.49/69.60 [2019-03-28 11:58:22,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 103.49/69.60 [2019-03-28 11:58:22,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 709 transitions. 103.49/69.60 [2019-03-28 11:58:22,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.49/69.60 [2019-03-28 11:58:22,199 INFO L706 BuchiCegarLoop]: Abstraction has 367 states and 709 transitions. 103.49/69.60 [2019-03-28 11:58:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 709 transitions. 103.49/69.60 [2019-03-28 11:58:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 118. 103.49/69.60 [2019-03-28 11:58:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. 103.49/69.60 [2019-03-28 11:58:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 274 transitions. 103.49/69.60 [2019-03-28 11:58:22,213 INFO L729 BuchiCegarLoop]: Abstraction has 118 states and 274 transitions. 103.49/69.60 [2019-03-28 11:58:22,213 INFO L609 BuchiCegarLoop]: Abstraction has 118 states and 274 transitions. 103.49/69.60 [2019-03-28 11:58:22,213 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 103.49/69.60 [2019-03-28 11:58:22,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 274 transitions. 103.49/69.60 [2019-03-28 11:58:22,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 91 103.49/69.60 [2019-03-28 11:58:22,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.49/69.60 [2019-03-28 11:58:22,215 INFO L119 BuchiIsEmpty]: Starting construction of run 103.49/69.60 [2019-03-28 11:58:22,215 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 103.49/69.60 [2019-03-28 11:58:22,216 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1] 103.49/69.60 [2019-03-28 11:58:22,216 INFO L794 eck$LassoCheckResult]: Stem: 1514#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 1515#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 1527#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 1551#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 1547#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1548#L18-3 103.49/69.60 [2019-03-28 11:58:22,217 INFO L796 eck$LassoCheckResult]: Loop: 1548#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 1605#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 1602#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1603#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 1601#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 1597#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 1511#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1545#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 1593#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 1586#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1587#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 1607#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 1560#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1558#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 1559#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 1553#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 1547#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1548#L18-3 103.49/69.60 [2019-03-28 11:58:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 2 times 103.49/69.60 [2019-03-28 11:58:22,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:22,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:22,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:22,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:22,229 INFO L82 PathProgramCache]: Analyzing trace with hash -99895487, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:22,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:22,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:22,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.49/69.60 [2019-03-28 11:58:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:22,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1801756118, now seen corresponding path program 1 times 103.49/69.60 [2019-03-28 11:58:22,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.49/69.60 [2019-03-28 11:58:22,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.49/69.60 [2019-03-28 11:58:22,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 103.49/69.60 [2019-03-28 11:58:22,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 103.49/69.60 [2019-03-28 11:58:22,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 103.49/69.60 [2019-03-28 11:58:22,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.49/69.60 [2019-03-28 11:58:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:22,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:22,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 103.49/69.60 [2019-03-28 11:58:22,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 103.49/69.60 [2019-03-28 11:58:22,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 10 103.49/69.60 [2019-03-28 11:58:22,675 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 103.49/69.60 [2019-03-28 11:58:22,690 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:22,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:22,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:22,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:22,691 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.49/69.60 [2019-03-28 11:58:22,691 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:22,691 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:22,691 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:22,691 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 103.49/69.60 [2019-03-28 11:58:22,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:22,692 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:22,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:22,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:22,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:22,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:22,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:22,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:22,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:22,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:22,760 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:22,760 INFO L412 LassoAnalysis]: Checking for nontermination... 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:22,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:22,764 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:22,768 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:22,768 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:22,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:22,795 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:22,799 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:22,799 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:22,826 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:22,826 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:22,829 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.49/69.60 [2019-03-28 11:58:22,829 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:22,857 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:22,857 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.49/69.60 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.49/69.60 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:22,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.49/69.60 [2019-03-28 11:58:22,888 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.49/69.60 [2019-03-28 11:58:23,315 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.49/69.60 [2019-03-28 11:58:23,318 INFO L216 LassoAnalysis]: Preferences: 103.49/69.60 [2019-03-28 11:58:23,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.49/69.60 [2019-03-28 11:58:23,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.49/69.60 [2019-03-28 11:58:23,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.49/69.60 [2019-03-28 11:58:23,319 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.49/69.60 [2019-03-28 11:58:23,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.49/69.60 [2019-03-28 11:58:23,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.49/69.60 [2019-03-28 11:58:23,319 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.49/69.60 [2019-03-28 11:58:23,319 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 103.49/69.60 [2019-03-28 11:58:23,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.49/69.60 [2019-03-28 11:58:23,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.49/69.60 [2019-03-28 11:58:23,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:23,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:23,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:23,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:23,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:23,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:23,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:23,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.49/69.60 [2019-03-28 11:58:23,391 INFO L300 LassoAnalysis]: Preprocessing complete. 103.49/69.60 [2019-03-28 11:58:23,391 INFO L497 LassoAnalysis]: Using template 'affine'. 103.49/69.60 [2019-03-28 11:58:23,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:23,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:23,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:23,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:23,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:23,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:23,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:23,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:23,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.49/69.60 [2019-03-28 11:58:23,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.49/69.60 Termination analysis: LINEAR_WITH_GUESSES 103.49/69.60 Number of strict supporting invariants: 0 103.49/69.60 Number of non-strict supporting invariants: 1 103.49/69.60 Consider only non-deceasing supporting invariants: true 103.49/69.60 Simplify termination arguments: true 103.49/69.60 Simplify supporting invariants: trueOverapproximate stem: false 103.49/69.60 [2019-03-28 11:58:23,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.49/69.60 [2019-03-28 11:58:23,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.49/69.60 [2019-03-28 11:58:23,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.49/69.60 [2019-03-28 11:58:23,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.49/69.60 [2019-03-28 11:58:23,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.49/69.60 [2019-03-28 11:58:23,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.49/69.60 [2019-03-28 11:58:23,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.49/69.60 [2019-03-28 11:58:23,400 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.49/69.60 [2019-03-28 11:58:23,402 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 103.49/69.60 [2019-03-28 11:58:23,403 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 103.49/69.60 [2019-03-28 11:58:23,403 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.49/69.60 [2019-03-28 11:58:23,403 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.49/69.60 [2019-03-28 11:58:23,403 INFO L518 LassoAnalysis]: Proved termination. 103.49/69.60 [2019-03-28 11:58:23,404 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.49/69.60 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 103.49/69.60 Supporting invariants [] 103.49/69.60 [2019-03-28 11:58:23,404 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.49/69.60 [2019-03-28 11:58:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.49/69.60 [2019-03-28 11:58:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 103.49/69.60 [2019-03-28 11:58:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.49/69.60 [2019-03-28 11:58:23,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 103.49/69.60 [2019-03-28 11:58:23,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.49/69.60 [2019-03-28 11:58:24,018 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 14 predicates after loop cannibalization 103.49/69.60 [2019-03-28 11:58:24,018 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 14 loop predicates 103.49/69.60 [2019-03-28 11:58:24,018 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 118 states and 274 transitions. cyclomatic complexity: 159 Second operand 9 states. 103.49/69.60 [2019-03-28 11:58:24,611 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 118 states and 274 transitions. cyclomatic complexity: 159. Second operand 9 states. Result 4591 states and 9290 transitions. Complement of second has 238 states. 103.49/69.60 [2019-03-28 11:58:24,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 13 non-accepting loop states 2 accepting loop states 103.49/69.60 [2019-03-28 11:58:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 103.49/69.60 [2019-03-28 11:58:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 108 transitions. 103.49/69.60 [2019-03-28 11:58:24,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 108 transitions. Stem has 5 letters. Loop has 17 letters. 103.49/69.60 [2019-03-28 11:58:24,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:24,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 108 transitions. Stem has 22 letters. Loop has 17 letters. 103.49/69.60 [2019-03-28 11:58:24,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:24,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 108 transitions. Stem has 5 letters. Loop has 34 letters. 103.49/69.60 [2019-03-28 11:58:24,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.49/69.60 [2019-03-28 11:58:24,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4591 states and 9290 transitions. 103.49/69.60 [2019-03-28 11:58:24,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 447 103.59/69.60 [2019-03-28 11:58:24,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4591 states to 849 states and 1669 transitions. 103.59/69.60 [2019-03-28 11:58:24,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 103.59/69.60 [2019-03-28 11:58:24,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 103.59/69.60 [2019-03-28 11:58:24,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 849 states and 1669 transitions. 103.59/69.60 [2019-03-28 11:58:24,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.59/69.60 [2019-03-28 11:58:24,690 INFO L706 BuchiCegarLoop]: Abstraction has 849 states and 1669 transitions. 103.59/69.60 [2019-03-28 11:58:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states and 1669 transitions. 103.59/69.60 [2019-03-28 11:58:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 285. 103.59/69.60 [2019-03-28 11:58:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. 103.59/69.60 [2019-03-28 11:58:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 664 transitions. 103.59/69.60 [2019-03-28 11:58:24,712 INFO L729 BuchiCegarLoop]: Abstraction has 285 states and 664 transitions. 103.59/69.60 [2019-03-28 11:58:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 103.59/69.60 [2019-03-28 11:58:24,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 103.59/69.60 [2019-03-28 11:58:24,716 INFO L87 Difference]: Start difference. First operand 285 states and 664 transitions. Second operand 10 states. 103.59/69.60 [2019-03-28 11:58:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 103.59/69.60 [2019-03-28 11:58:24,844 INFO L93 Difference]: Finished difference Result 332 states and 732 transitions. 103.59/69.60 [2019-03-28 11:58:24,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 103.59/69.60 [2019-03-28 11:58:24,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 732 transitions. 103.59/69.60 [2019-03-28 11:58:24,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 264 103.59/69.60 [2019-03-28 11:58:24,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 328 states and 723 transitions. 103.59/69.60 [2019-03-28 11:58:24,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 103.59/69.60 [2019-03-28 11:58:24,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 103.59/69.60 [2019-03-28 11:58:24,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 723 transitions. 103.59/69.60 [2019-03-28 11:58:24,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.59/69.60 [2019-03-28 11:58:24,855 INFO L706 BuchiCegarLoop]: Abstraction has 328 states and 723 transitions. 103.59/69.60 [2019-03-28 11:58:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 723 transitions. 103.59/69.60 [2019-03-28 11:58:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 276. 103.59/69.60 [2019-03-28 11:58:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. 103.59/69.60 [2019-03-28 11:58:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 640 transitions. 103.59/69.60 [2019-03-28 11:58:24,864 INFO L729 BuchiCegarLoop]: Abstraction has 276 states and 640 transitions. 103.59/69.60 [2019-03-28 11:58:24,864 INFO L609 BuchiCegarLoop]: Abstraction has 276 states and 640 transitions. 103.59/69.60 [2019-03-28 11:58:24,864 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 103.59/69.60 [2019-03-28 11:58:24,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 640 transitions. 103.59/69.60 [2019-03-28 11:58:24,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 217 103.59/69.60 [2019-03-28 11:58:24,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.59/69.60 [2019-03-28 11:58:24,867 INFO L119 BuchiIsEmpty]: Starting construction of run 103.59/69.60 [2019-03-28 11:58:24,868 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 103.59/69.60 [2019-03-28 11:58:24,868 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 1] 103.59/69.60 [2019-03-28 11:58:24,868 INFO L794 eck$LassoCheckResult]: Stem: 7750#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 7751#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 7752#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 7838#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 7936#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 7932#L18-3 103.59/69.60 [2019-03-28 11:58:24,869 INFO L796 eck$LassoCheckResult]: Loop: 7932#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 7927#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 7859#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 7756#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 7922#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 7921#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 7879#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 7938#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 7939#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 7965#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 7959#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 7867#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 7952#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 7953#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 7877#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 7940#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 7941#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 7944#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 7744#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 7936#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 7932#L18-3 103.59/69.61 [2019-03-28 11:58:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 3 times 103.59/69.61 [2019-03-28 11:58:24,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:58:24,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:58:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:24,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash -789507211, now seen corresponding path program 2 times 103.59/69.61 [2019-03-28 11:58:24,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:58:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:58:24,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:24,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:58:24,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 103.59/69.61 [2019-03-28 11:58:24,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 103.59/69.61 [2019-03-28 11:58:24,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 103.59/69.61 [2019-03-28 11:58:24,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 103.59/69.61 [2019-03-28 11:58:24,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:24,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:24,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:58:25,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 103.59/69.61 [2019-03-28 11:58:25,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 103.59/69.61 [2019-03-28 11:58:25,018 INFO L811 eck$LassoCheckResult]: loop already infeasible 103.59/69.61 [2019-03-28 11:58:25,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 103.59/69.61 [2019-03-28 11:58:25,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 103.59/69.61 [2019-03-28 11:58:25,019 INFO L87 Difference]: Start difference. First operand 276 states and 640 transitions. cyclomatic complexity: 367 Second operand 9 states. 103.59/69.61 [2019-03-28 11:58:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 103.59/69.61 [2019-03-28 11:58:25,117 INFO L93 Difference]: Finished difference Result 551 states and 1089 transitions. 103.59/69.61 [2019-03-28 11:58:25,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 103.59/69.61 [2019-03-28 11:58:25,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 551 states and 1089 transitions. 103.59/69.61 [2019-03-28 11:58:25,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 103.59/69.61 [2019-03-28 11:58:25,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 551 states to 485 states and 962 transitions. 103.59/69.61 [2019-03-28 11:58:25,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 103.59/69.61 [2019-03-28 11:58:25,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 103.59/69.61 [2019-03-28 11:58:25,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 962 transitions. 103.59/69.61 [2019-03-28 11:58:25,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.59/69.61 [2019-03-28 11:58:25,129 INFO L706 BuchiCegarLoop]: Abstraction has 485 states and 962 transitions. 103.59/69.61 [2019-03-28 11:58:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 962 transitions. 103.59/69.61 [2019-03-28 11:58:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 371. 103.59/69.61 [2019-03-28 11:58:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. 103.59/69.61 [2019-03-28 11:58:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 784 transitions. 103.59/69.61 [2019-03-28 11:58:25,137 INFO L729 BuchiCegarLoop]: Abstraction has 371 states and 784 transitions. 103.59/69.61 [2019-03-28 11:58:25,137 INFO L609 BuchiCegarLoop]: Abstraction has 371 states and 784 transitions. 103.59/69.61 [2019-03-28 11:58:25,137 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 103.59/69.61 [2019-03-28 11:58:25,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 784 transitions. 103.59/69.61 [2019-03-28 11:58:25,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 291 103.59/69.61 [2019-03-28 11:58:25,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.59/69.61 [2019-03-28 11:58:25,140 INFO L119 BuchiIsEmpty]: Starting construction of run 103.59/69.61 [2019-03-28 11:58:25,141 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 103.59/69.61 [2019-03-28 11:58:25,141 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1] 103.59/69.61 [2019-03-28 11:58:25,141 INFO L794 eck$LassoCheckResult]: Stem: 8641#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 8642#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8643#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 8861#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 8854#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 8706#L18-3 103.59/69.61 [2019-03-28 11:58:25,142 INFO L796 eck$LassoCheckResult]: Loop: 8706#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 8995#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 8637#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 8638#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 8959#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 8958#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 8948#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8947#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 8792#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 8936#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8937#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 8801#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 8886#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 8887#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 8868#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 8863#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 8854#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 8706#L18-3 103.59/69.61 [2019-03-28 11:58:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:25,142 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 4 times 103.59/69.61 [2019-03-28 11:58:25,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:58:25,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:58:25,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:25,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:25,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1075932061, now seen corresponding path program 3 times 103.59/69.61 [2019-03-28 11:58:25,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:58:25,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:58:25,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:25,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:25,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:25,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:25,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1517174604, now seen corresponding path program 2 times 103.59/69.61 [2019-03-28 11:58:25,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:58:25,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:58:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:25,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:58:25,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 103.59/69.61 [2019-03-28 11:58:25,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 103.59/69.61 [2019-03-28 11:58:25,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 103.59/69.61 [2019-03-28 11:58:25,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 103.59/69.61 [2019-03-28 11:58:25,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:25,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 15 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:25,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:58:25,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 103.59/69.61 [2019-03-28 11:58:25,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 103.59/69.61 [2019-03-28 11:58:25,516 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 103.59/69.61 [2019-03-28 11:58:25,531 INFO L216 LassoAnalysis]: Preferences: 103.59/69.61 [2019-03-28 11:58:25,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.59/69.61 [2019-03-28 11:58:25,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.59/69.61 [2019-03-28 11:58:25,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.59/69.61 [2019-03-28 11:58:25,531 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.59/69.61 [2019-03-28 11:58:25,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:25,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.59/69.61 [2019-03-28 11:58:25,532 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.59/69.61 [2019-03-28 11:58:25,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 103.59/69.61 [2019-03-28 11:58:25,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.59/69.61 [2019-03-28 11:58:25,532 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.59/69.61 [2019-03-28 11:58:25,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,593 INFO L300 LassoAnalysis]: Preprocessing complete. 103.59/69.61 [2019-03-28 11:58:25,593 INFO L412 LassoAnalysis]: Checking for nontermination... 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:25,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:25,598 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:25,602 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:58:25,602 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:25,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:25,629 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:25,656 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:58:25,656 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:25,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:25,661 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:25,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:25,692 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:25,724 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.59/69.61 [2019-03-28 11:58:25,725 INFO L216 LassoAnalysis]: Preferences: 103.59/69.61 [2019-03-28 11:58:25,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.59/69.61 [2019-03-28 11:58:25,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.59/69.61 [2019-03-28 11:58:25,725 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.59/69.61 [2019-03-28 11:58:25,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.59/69.61 [2019-03-28 11:58:25,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:25,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.59/69.61 [2019-03-28 11:58:25,726 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.59/69.61 [2019-03-28 11:58:25,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 103.59/69.61 [2019-03-28 11:58:25,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.59/69.61 [2019-03-28 11:58:25,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.59/69.61 [2019-03-28 11:58:25,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:25,801 INFO L300 LassoAnalysis]: Preprocessing complete. 103.59/69.61 [2019-03-28 11:58:25,801 INFO L497 LassoAnalysis]: Using template 'affine'. 103.59/69.61 [2019-03-28 11:58:25,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:25,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:25,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:25,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:25,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:25,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:25,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:25,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:25,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:25,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:25,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:25,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:25,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:25,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:25,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:25,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:25,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:25,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:25,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:25,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:25,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:25,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:25,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:25,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:25,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:25,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:25,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:25,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:25,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:25,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:25,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:25,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:25,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:25,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:25,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:25,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:25,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:25,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:25,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:25,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:25,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:25,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:25,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:25,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:25,815 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.59/69.61 [2019-03-28 11:58:25,818 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 103.59/69.61 [2019-03-28 11:58:25,818 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 103.59/69.61 [2019-03-28 11:58:25,819 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.59/69.61 [2019-03-28 11:58:25,819 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.59/69.61 [2019-03-28 11:58:25,819 INFO L518 LassoAnalysis]: Proved termination. 103.59/69.61 [2019-03-28 11:58:25,819 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.59/69.61 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 103.59/69.61 Supporting invariants [] 103.59/69.61 [2019-03-28 11:58:25,820 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.59/69.61 [2019-03-28 11:58:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:25,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:25,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:25,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:25,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:58:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:25,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:25,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:25,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:25,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:26,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:26,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:26,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:26,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:26,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:26,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:26,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:26,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:26,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:26,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:26,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:26,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:26,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:26,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:26,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:26,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:26,558 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 22 predicates after loop cannibalization 103.59/69.61 [2019-03-28 11:58:26,559 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 22 loop predicates 103.59/69.61 [2019-03-28 11:58:26,559 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 371 states and 784 transitions. cyclomatic complexity: 416 Second operand 11 states. 103.59/69.61 [2019-03-28 11:58:28,411 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 371 states and 784 transitions. cyclomatic complexity: 416. Second operand 11 states. Result 32305 states and 55372 transitions. Complement of second has 2321 states. 103.59/69.61 [2019-03-28 11:58:28,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 39 states 1 stem states 33 non-accepting loop states 4 accepting loop states 103.59/69.61 [2019-03-28 11:58:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 103.59/69.61 [2019-03-28 11:58:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 185 transitions. 103.59/69.61 [2019-03-28 11:58:28,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 185 transitions. Stem has 5 letters. Loop has 17 letters. 103.59/69.61 [2019-03-28 11:58:28,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:58:28,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 185 transitions. Stem has 22 letters. Loop has 17 letters. 103.59/69.61 [2019-03-28 11:58:28,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:58:28,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 185 transitions. Stem has 5 letters. Loop has 34 letters. 103.59/69.61 [2019-03-28 11:58:28,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:58:28,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32305 states and 55372 transitions. 103.59/69.61 [2019-03-28 11:58:28,627 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1652 103.59/69.61 [2019-03-28 11:58:28,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32305 states to 3343 states and 5799 transitions. 103.59/69.61 [2019-03-28 11:58:28,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 103.59/69.61 [2019-03-28 11:58:28,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 103.59/69.61 [2019-03-28 11:58:28,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3343 states and 5799 transitions. 103.59/69.61 [2019-03-28 11:58:28,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.59/69.61 [2019-03-28 11:58:28,655 INFO L706 BuchiCegarLoop]: Abstraction has 3343 states and 5799 transitions. 103.59/69.61 [2019-03-28 11:58:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states and 5799 transitions. 103.59/69.61 [2019-03-28 11:58:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 549. 103.59/69.61 [2019-03-28 11:58:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. 103.59/69.61 [2019-03-28 11:58:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1158 transitions. 103.59/69.61 [2019-03-28 11:58:28,683 INFO L729 BuchiCegarLoop]: Abstraction has 549 states and 1158 transitions. 103.59/69.61 [2019-03-28 11:58:28,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 103.59/69.61 [2019-03-28 11:58:28,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 103.59/69.61 [2019-03-28 11:58:28,684 INFO L87 Difference]: Start difference. First operand 549 states and 1158 transitions. Second operand 10 states. 103.59/69.61 [2019-03-28 11:58:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 103.59/69.61 [2019-03-28 11:58:28,860 INFO L93 Difference]: Finished difference Result 727 states and 1422 transitions. 103.59/69.61 [2019-03-28 11:58:28,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 103.59/69.61 [2019-03-28 11:58:28,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 727 states and 1422 transitions. 103.59/69.61 [2019-03-28 11:58:28,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 478 103.59/69.61 [2019-03-28 11:58:28,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 727 states to 659 states and 1332 transitions. 103.59/69.61 [2019-03-28 11:58:28,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 103.59/69.61 [2019-03-28 11:58:28,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 103.59/69.61 [2019-03-28 11:58:28,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 659 states and 1332 transitions. 103.59/69.61 [2019-03-28 11:58:28,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.59/69.61 [2019-03-28 11:58:28,872 INFO L706 BuchiCegarLoop]: Abstraction has 659 states and 1332 transitions. 103.59/69.61 [2019-03-28 11:58:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states and 1332 transitions. 103.59/69.61 [2019-03-28 11:58:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 510. 103.59/69.61 [2019-03-28 11:58:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. 103.59/69.61 [2019-03-28 11:58:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1082 transitions. 103.59/69.61 [2019-03-28 11:58:28,884 INFO L729 BuchiCegarLoop]: Abstraction has 510 states and 1082 transitions. 103.59/69.61 [2019-03-28 11:58:28,884 INFO L609 BuchiCegarLoop]: Abstraction has 510 states and 1082 transitions. 103.59/69.61 [2019-03-28 11:58:28,884 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 103.59/69.61 [2019-03-28 11:58:28,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 510 states and 1082 transitions. 103.59/69.61 [2019-03-28 11:58:28,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 425 103.59/69.61 [2019-03-28 11:58:28,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.59/69.61 [2019-03-28 11:58:28,885 INFO L119 BuchiIsEmpty]: Starting construction of run 103.59/69.61 [2019-03-28 11:58:28,886 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 103.59/69.61 [2019-03-28 11:58:28,886 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 2, 2, 1, 1] 103.59/69.61 [2019-03-28 11:58:28,887 INFO L794 eck$LassoCheckResult]: Stem: 45644#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 45645#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 45646#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 45639#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 45641#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 45712#L18-3 103.59/69.61 [2019-03-28 11:58:28,888 INFO L796 eck$LassoCheckResult]: Loop: 45712#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 45938#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 45932#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 45933#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 46125#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 46124#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 46123#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 46122#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 45799#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 46121#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 46120#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 45898#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 45899#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 45893#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 45805#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 46024#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 46025#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 46030#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 46063#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 46065#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 45641#L18-2 [68] L18-2-->L18-3: Formula: (> (+ v_ULTIMATE.start_main_~x~0_11 3) v_ULTIMATE.start_main_~y~0_13) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 45712#L18-3 103.59/69.61 [2019-03-28 11:58:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:28,888 INFO L82 PathProgramCache]: Analyzing trace with hash 71803384, now seen corresponding path program 5 times 103.59/69.61 [2019-03-28 11:58:28,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:58:28,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:58:28,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:28,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:28,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:28,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:28,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1512626466, now seen corresponding path program 4 times 103.59/69.61 [2019-03-28 11:58:28,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:58:28,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:58:28,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:28,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:28,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:58:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2108090251, now seen corresponding path program 3 times 103.59/69.61 [2019-03-28 11:58:28,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:58:28,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:58:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:28,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:58:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 32 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:58:29,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 103.59/69.61 [2019-03-28 11:58:29,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 103.59/69.61 [2019-03-28 11:58:29,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 103.59/69.61 [2019-03-28 11:58:29,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) 103.59/69.61 [2019-03-28 11:58:29,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:29,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 22 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:29,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 32 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:58:29,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 103.59/69.61 [2019-03-28 11:58:29,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 103.59/69.61 [2019-03-28 11:58:29,370 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 103.59/69.61 [2019-03-28 11:58:29,387 INFO L216 LassoAnalysis]: Preferences: 103.59/69.61 [2019-03-28 11:58:29,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.59/69.61 [2019-03-28 11:58:29,387 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.59/69.61 [2019-03-28 11:58:29,387 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.59/69.61 [2019-03-28 11:58:29,387 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.59/69.61 [2019-03-28 11:58:29,387 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.59/69.61 [2019-03-28 11:58:29,388 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.59/69.61 [2019-03-28 11:58:29,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop 103.59/69.61 [2019-03-28 11:58:29,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.59/69.61 [2019-03-28 11:58:29,388 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.59/69.61 [2019-03-28 11:58:29,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:29,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:29,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:29,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:29,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:29,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:29,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:29,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:29,453 INFO L300 LassoAnalysis]: Preprocessing complete. 103.59/69.61 [2019-03-28 11:58:29,453 INFO L412 LassoAnalysis]: Checking for nontermination... 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:29,457 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:29,461 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:58:29,461 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:29,488 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:29,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:58:29,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:29,518 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:29,522 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:58:29,522 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:29,549 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:29,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:58:29,553 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:29,582 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:29,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:58:29,586 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:29,613 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:29,639 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:58:29,640 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=1} Honda state: {ULTIMATE.start_main_#t~nondet3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:29,644 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:29,648 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:58:29,648 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,675 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:29,675 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:29,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.59/69.61 [2019-03-28 11:58:29,705 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:58:30,103 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.59/69.61 [2019-03-28 11:58:30,106 INFO L216 LassoAnalysis]: Preferences: 103.59/69.61 [2019-03-28 11:58:30,117 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.59/69.61 [2019-03-28 11:58:30,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.59/69.61 [2019-03-28 11:58:30,117 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.59/69.61 [2019-03-28 11:58:30,117 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.59/69.61 [2019-03-28 11:58:30,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:58:30,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.59/69.61 [2019-03-28 11:58:30,117 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.59/69.61 [2019-03-28 11:58:30,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop 103.59/69.61 [2019-03-28 11:58:30,118 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.59/69.61 [2019-03-28 11:58:30,118 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.59/69.61 [2019-03-28 11:58:30,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:30,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:30,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:30,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:30,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:30,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:30,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:30,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:58:30,180 INFO L300 LassoAnalysis]: Preprocessing complete. 103.59/69.61 [2019-03-28 11:58:30,180 INFO L497 LassoAnalysis]: Using template 'affine'. 103.59/69.61 [2019-03-28 11:58:30,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:30,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:30,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:30,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:30,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:30,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:30,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:30,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:30,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:30,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:30,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:30,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:30,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:30,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:30,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:30,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:30,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:30,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:30,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:30,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:30,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:30,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:30,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:30,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:30,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:30,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:30,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:30,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:30,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:30,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:30,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:30,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:30,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:30,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:30,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:30,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:30,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:30,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:30,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:30,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:30,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:30,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:30,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:30,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:30,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:30,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:30,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:30,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:30,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:30,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:30,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:30,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:30,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:30,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:30,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:30,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:30,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:30,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:30,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:30,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:30,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:30,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:30,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:58:30,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:58:30,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:58:30,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:58:30,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:58:30,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:58:30,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:58:30,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:58:30,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:58:30,200 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.59/69.61 [2019-03-28 11:58:30,203 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 103.59/69.61 [2019-03-28 11:58:30,203 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 103.59/69.61 [2019-03-28 11:58:30,203 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.59/69.61 [2019-03-28 11:58:30,204 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.59/69.61 [2019-03-28 11:58:30,204 INFO L518 LassoAnalysis]: Proved termination. 103.59/69.61 [2019-03-28 11:58:30,204 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.59/69.61 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 103.59/69.61 Supporting invariants [] 103.59/69.61 [2019-03-28 11:58:30,204 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.59/69.61 [2019-03-28 11:58:30,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:58:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:30,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:30,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:30,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:30,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:58:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:30,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 26 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:30,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:30,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 26 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:30,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:31,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:31,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:31,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 26 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:31,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:31,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:31,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:32,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:32,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:32,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:32,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:32,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 26 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:32,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:33,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:33,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:33,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 27 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:33,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:34,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 27 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:34,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:34,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:34,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:34,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:34,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:58:34,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:58:34,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:58:35,208 INFO L98 LoopCannibalizer]: 21 predicates before loop cannibalization 78 predicates after loop cannibalization 103.59/69.61 [2019-03-28 11:58:35,209 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 78 loop predicates 103.59/69.61 [2019-03-28 11:58:35,209 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 510 states and 1082 transitions. cyclomatic complexity: 575 Second operand 17 states. 103.59/69.61 [2019-03-28 11:59:08,888 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 510 states and 1082 transitions. cyclomatic complexity: 575. Second operand 17 states. Result 90888 states and 150226 transitions. Complement of second has 6584 states. 103.59/69.61 [2019-03-28 11:59:08,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 229 states 1 stem states 223 non-accepting loop states 4 accepting loop states 103.59/69.61 [2019-03-28 11:59:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 103.59/69.61 [2019-03-28 11:59:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 711 transitions. 103.59/69.61 [2019-03-28 11:59:08,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 229 states and 711 transitions. Stem has 5 letters. Loop has 21 letters. 103.59/69.61 [2019-03-28 11:59:08,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:59:08,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 229 states and 711 transitions. Stem has 26 letters. Loop has 21 letters. 103.59/69.61 [2019-03-28 11:59:08,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:59:08,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 229 states and 711 transitions. Stem has 5 letters. Loop has 42 letters. 103.59/69.61 [2019-03-28 11:59:08,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:59:08,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90888 states and 150226 transitions. 103.59/69.61 [2019-03-28 11:59:09,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 103.59/69.61 [2019-03-28 11:59:09,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90888 states to 56 states and 99 transitions. 103.59/69.61 [2019-03-28 11:59:09,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 103.59/69.61 [2019-03-28 11:59:09,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 103.59/69.61 [2019-03-28 11:59:09,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 99 transitions. 103.59/69.61 [2019-03-28 11:59:09,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.59/69.61 [2019-03-28 11:59:09,278 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 99 transitions. 103.59/69.61 [2019-03-28 11:59:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 99 transitions. 103.59/69.61 [2019-03-28 11:59:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. 103.59/69.61 [2019-03-28 11:59:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 103.59/69.61 [2019-03-28 11:59:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 99 transitions. 103.59/69.61 [2019-03-28 11:59:09,280 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 99 transitions. 103.59/69.61 [2019-03-28 11:59:09,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 103.59/69.61 [2019-03-28 11:59:09,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 103.59/69.61 [2019-03-28 11:59:09,281 INFO L87 Difference]: Start difference. First operand 56 states and 99 transitions. Second operand 12 states. 103.59/69.61 [2019-03-28 11:59:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 103.59/69.61 [2019-03-28 11:59:09,388 INFO L93 Difference]: Finished difference Result 142 states and 236 transitions. 103.59/69.61 [2019-03-28 11:59:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 103.59/69.61 [2019-03-28 11:59:09,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 236 transitions. 103.59/69.61 [2019-03-28 11:59:09,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 103.59/69.61 [2019-03-28 11:59:09,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 122 states and 205 transitions. 103.59/69.61 [2019-03-28 11:59:09,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 103.59/69.61 [2019-03-28 11:59:09,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 103.59/69.61 [2019-03-28 11:59:09,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 205 transitions. 103.59/69.61 [2019-03-28 11:59:09,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.59/69.61 [2019-03-28 11:59:09,397 INFO L706 BuchiCegarLoop]: Abstraction has 122 states and 205 transitions. 103.59/69.61 [2019-03-28 11:59:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 205 transitions. 103.59/69.61 [2019-03-28 11:59:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 72. 103.59/69.61 [2019-03-28 11:59:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. 103.59/69.61 [2019-03-28 11:59:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. 103.59/69.61 [2019-03-28 11:59:09,399 INFO L729 BuchiCegarLoop]: Abstraction has 72 states and 127 transitions. 103.59/69.61 [2019-03-28 11:59:09,399 INFO L609 BuchiCegarLoop]: Abstraction has 72 states and 127 transitions. 103.59/69.61 [2019-03-28 11:59:09,399 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 103.59/69.61 [2019-03-28 11:59:09,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 127 transitions. 103.59/69.61 [2019-03-28 11:59:09,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 103.59/69.61 [2019-03-28 11:59:09,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.59/69.61 [2019-03-28 11:59:09,400 INFO L119 BuchiIsEmpty]: Starting construction of run 103.59/69.61 [2019-03-28 11:59:09,400 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 103.59/69.61 [2019-03-28 11:59:09,400 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 103.59/69.61 [2019-03-28 11:59:09,401 INFO L794 eck$LassoCheckResult]: Stem: 145399#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 145400#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 145406#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 145401#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 145403#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 145395#L18-3 103.59/69.61 [2019-03-28 11:59:09,401 INFO L796 eck$LassoCheckResult]: Loop: 145395#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 145396#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 145423#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 145421#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 145422#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 145418#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 145403#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 145395#L18-3 103.59/69.61 [2019-03-28 11:59:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:59:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash 71803385, now seen corresponding path program 2 times 103.59/69.61 [2019-03-28 11:59:09,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:59:09,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:59:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:09,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:59:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -273873587, now seen corresponding path program 1 times 103.59/69.61 [2019-03-28 11:59:09,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:59:09,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:59:09,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:09,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:09,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:59:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash 484555861, now seen corresponding path program 1 times 103.59/69.61 [2019-03-28 11:59:09,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:59:09,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:59:09,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:09,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:09,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:09,494 INFO L216 LassoAnalysis]: Preferences: 103.59/69.61 [2019-03-28 11:59:09,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.59/69.61 [2019-03-28 11:59:09,495 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.59/69.61 [2019-03-28 11:59:09,495 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.59/69.61 [2019-03-28 11:59:09,495 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.59/69.61 [2019-03-28 11:59:09,495 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:09,495 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.59/69.61 [2019-03-28 11:59:09,495 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.59/69.61 [2019-03-28 11:59:09,495 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop 103.59/69.61 [2019-03-28 11:59:09,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.59/69.61 [2019-03-28 11:59:09,496 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.59/69.61 [2019-03-28 11:59:09,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,549 INFO L300 LassoAnalysis]: Preprocessing complete. 103.59/69.61 [2019-03-28 11:59:09,549 INFO L412 LassoAnalysis]: Checking for nontermination... 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:09,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:09,553 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:09,556 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:09,556 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:09,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:09,583 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:09,587 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:09,587 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:09,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:09,614 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:09,617 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:09,617 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:09,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:09,644 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:09,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:09,671 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=-1} Honda state: {ULTIMATE.start_main_#t~nondet5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:09,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:09,676 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:09,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:09,762 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:09,873 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.59/69.61 [2019-03-28 11:59:09,875 INFO L216 LassoAnalysis]: Preferences: 103.59/69.61 [2019-03-28 11:59:09,875 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.59/69.61 [2019-03-28 11:59:09,875 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.59/69.61 [2019-03-28 11:59:09,875 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.59/69.61 [2019-03-28 11:59:09,876 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.59/69.61 [2019-03-28 11:59:09,876 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:09,876 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.59/69.61 [2019-03-28 11:59:09,876 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.59/69.61 [2019-03-28 11:59:09,876 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop 103.59/69.61 [2019-03-28 11:59:09,876 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.59/69.61 [2019-03-28 11:59:09,876 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.59/69.61 [2019-03-28 11:59:09,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:09,931 INFO L300 LassoAnalysis]: Preprocessing complete. 103.59/69.61 [2019-03-28 11:59:09,931 INFO L497 LassoAnalysis]: Using template 'affine'. 103.59/69.61 [2019-03-28 11:59:09,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:09,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:09,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:09,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:09,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:09,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:09,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:09,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:09,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:09,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:09,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:09,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:09,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:09,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:09,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:09,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:09,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:09,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:09,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:09,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:09,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:09,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:09,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:09,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:09,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:09,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:09,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:09,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:09,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:09,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:09,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:09,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:09,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:09,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:09,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:09,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:09,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:09,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:09,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:09,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:09,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:09,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:09,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:09,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:09,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:09,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:09,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:09,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:09,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:09,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:09,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:09,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:09,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:09,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:09,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:09,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:09,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:09,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:09,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:09,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:09,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:09,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:09,948 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.59/69.61 [2019-03-28 11:59:09,949 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 103.59/69.61 [2019-03-28 11:59:09,949 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 103.59/69.61 [2019-03-28 11:59:09,949 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.59/69.61 [2019-03-28 11:59:09,950 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.59/69.61 [2019-03-28 11:59:09,950 INFO L518 LassoAnalysis]: Proved termination. 103.59/69.61 [2019-03-28 11:59:09,950 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.59/69.61 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 103.59/69.61 Supporting invariants [] 103.59/69.61 [2019-03-28 11:59:09,950 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.59/69.61 [2019-03-28 11:59:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:59:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:09,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:09,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:09,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:09,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:59:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:10,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:10,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:10,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 12 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:10,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:10,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:10,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:10,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:10,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:10,330 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 18 predicates after loop cannibalization 103.59/69.61 [2019-03-28 11:59:10,331 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 18 loop predicates 103.59/69.61 [2019-03-28 11:59:10,331 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 72 states and 127 transitions. cyclomatic complexity: 57 Second operand 7 states. 103.59/69.61 [2019-03-28 11:59:10,911 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 72 states and 127 transitions. cyclomatic complexity: 57. Second operand 7 states. Result 1443 states and 2445 transitions. Complement of second has 154 states. 103.59/69.61 [2019-03-28 11:59:10,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states 103.59/69.61 [2019-03-28 11:59:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 103.59/69.61 [2019-03-28 11:59:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 86 transitions. 103.59/69.61 [2019-03-28 11:59:10,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 86 transitions. Stem has 5 letters. Loop has 7 letters. 103.59/69.61 [2019-03-28 11:59:10,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:59:10,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 86 transitions. Stem has 12 letters. Loop has 7 letters. 103.59/69.61 [2019-03-28 11:59:10,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:59:10,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 86 transitions. Stem has 5 letters. Loop has 14 letters. 103.59/69.61 [2019-03-28 11:59:10,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:59:10,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1443 states and 2445 transitions. 103.59/69.61 [2019-03-28 11:59:10,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 326 103.59/69.61 [2019-03-28 11:59:10,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1443 states to 476 states and 842 transitions. 103.59/69.61 [2019-03-28 11:59:10,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 103.59/69.61 [2019-03-28 11:59:10,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 103.59/69.61 [2019-03-28 11:59:10,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 476 states and 842 transitions. 103.59/69.61 [2019-03-28 11:59:10,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 103.59/69.61 [2019-03-28 11:59:10,923 INFO L706 BuchiCegarLoop]: Abstraction has 476 states and 842 transitions. 103.59/69.61 [2019-03-28 11:59:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states and 842 transitions. 103.59/69.61 [2019-03-28 11:59:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 160. 103.59/69.61 [2019-03-28 11:59:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. 103.59/69.61 [2019-03-28 11:59:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 308 transitions. 103.59/69.61 [2019-03-28 11:59:10,929 INFO L729 BuchiCegarLoop]: Abstraction has 160 states and 308 transitions. 103.59/69.61 [2019-03-28 11:59:10,929 INFO L609 BuchiCegarLoop]: Abstraction has 160 states and 308 transitions. 103.59/69.61 [2019-03-28 11:59:10,929 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 103.59/69.61 [2019-03-28 11:59:10,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 308 transitions. 103.59/69.61 [2019-03-28 11:59:10,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 103.59/69.61 [2019-03-28 11:59:10,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 103.59/69.61 [2019-03-28 11:59:10,930 INFO L119 BuchiIsEmpty]: Starting construction of run 103.59/69.61 [2019-03-28 11:59:10,930 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 103.59/69.61 [2019-03-28 11:59:10,930 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2] 103.59/69.61 [2019-03-28 11:59:10,930 INFO L794 eck$LassoCheckResult]: Stem: 147242#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~y~0_3 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4] 147243#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 147244#L16-2 [67] L16-2-->L18-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 147265#L18-2 [71] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet5_5|) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 147266#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 147233#L18-3 103.59/69.61 [2019-03-28 11:59:10,931 INFO L796 eck$LassoCheckResult]: Loop: 147233#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 147234#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 147360#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 147362#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 147359#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 147358#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 147239#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 147348#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 147327#L18-3 [44] L18-3-->L16-2: Formula: (= v_ULTIMATE.start_main_~y~0_2 (+ v_ULTIMATE.start_main_~y~0_1 1)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post7] 147320#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 147321#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 147312#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 147313#L16-2 [64] L16-2-->L16-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3] 147308#L16-3 [53] L16-3-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_6 (+ (* (- 1) v_ULTIMATE.start_main_~x~0_4) v_ULTIMATE.start_main_~y~0_7)) (= (+ v_ULTIMATE.start_main_~x~0_4 1) v_ULTIMATE.start_main_~x~0_5)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post8, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 147306#L14-2 [52] L14-2-->L16-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (<= 2 v_ULTIMATE.start_main_~x~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~0] 147307#L16-2 [66] L16-2-->L18-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet3_5|) (<= (+ v_ULTIMATE.start_main_~x~0_10 1) v_ULTIMATE.start_main_~y~0_12) (= v_ULTIMATE.start_main_~y~0_12 (+ v_ULTIMATE.start_main_~y~0_11 1))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post4] 147332#L18-2 [70] L18-2-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (= v_ULTIMATE.start_main_~y~0_14 (+ v_ULTIMATE.start_main_~y~0_15 (- 2))) (<= (+ v_ULTIMATE.start_main_~x~0_13 3) v_ULTIMATE.start_main_~y~0_15) (> 0 |v_ULTIMATE.start_main_#t~nondet5_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post6] 147329#L18-2 [69] L18-2-->L18-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 147233#L18-3 103.59/69.61 [2019-03-28 11:59:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:59:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash 71803385, now seen corresponding path program 3 times 103.59/69.61 [2019-03-28 11:59:10,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:59:10,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:59:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:10,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:10,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:59:10,938 INFO L82 PathProgramCache]: Analyzing trace with hash 579443244, now seen corresponding path program 2 times 103.59/69.61 [2019-03-28 11:59:10,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:59:10,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:59:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:10,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:10,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:59:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1483100636, now seen corresponding path program 2 times 103.59/69.61 [2019-03-28 11:59:10,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 103.59/69.61 [2019-03-28 11:59:10,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 103.59/69.61 [2019-03-28 11:59:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:10,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 103.59/69.61 [2019-03-28 11:59:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 103.59/69.61 [2019-03-28 11:59:11,174 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 103.59/69.61 [2019-03-28 11:59:11,186 INFO L216 LassoAnalysis]: Preferences: 103.59/69.61 [2019-03-28 11:59:11,186 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.59/69.61 [2019-03-28 11:59:11,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.59/69.61 [2019-03-28 11:59:11,186 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.59/69.61 [2019-03-28 11:59:11,186 INFO L127 ssoRankerPreferences]: Use exernal solver: true 103.59/69.61 [2019-03-28 11:59:11,187 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,187 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.59/69.61 [2019-03-28 11:59:11,187 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.59/69.61 [2019-03-28 11:59:11,187 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop 103.59/69.61 [2019-03-28 11:59:11,187 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.59/69.61 [2019-03-28 11:59:11,187 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.59/69.61 [2019-03-28 11:59:11,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,239 INFO L300 LassoAnalysis]: Preprocessing complete. 103.59/69.61 [2019-03-28 11:59:11,239 INFO L412 LassoAnalysis]: Checking for nontermination... 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:11,243 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:11,246 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:11,246 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:11,273 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:11,277 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:11,277 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:11,304 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:11,307 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:11,307 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:11,334 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:11,338 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:11,338 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:11,365 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:11,368 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:11,369 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:11,397 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:11,423 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:11,424 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=-1} Honda state: {ULTIMATE.start_main_#t~nondet5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:11,429 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:11,432 INFO L445 LassoAnalysis]: Proved nontermination for one component. 103.59/69.61 [2019-03-28 11:59:11,432 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:11,459 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 103.59/69.61 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 103.59/69.61 Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,490 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 103.59/69.61 [2019-03-28 11:59:11,490 INFO L163 nArgumentSynthesizer]: Using integer mode. 103.59/69.61 [2019-03-28 11:59:11,771 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 103.59/69.61 [2019-03-28 11:59:11,773 INFO L216 LassoAnalysis]: Preferences: 103.59/69.61 [2019-03-28 11:59:11,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 103.59/69.61 [2019-03-28 11:59:11,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 103.59/69.61 [2019-03-28 11:59:11,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 103.59/69.61 [2019-03-28 11:59:11,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false 103.59/69.61 [2019-03-28 11:59:11,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 103.59/69.61 [2019-03-28 11:59:11,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 103.59/69.61 [2019-03-28 11:59:11,774 INFO L130 ssoRankerPreferences]: Path of dumped script: 103.59/69.61 [2019-03-28 11:59:11,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop 103.59/69.61 [2019-03-28 11:59:11,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 103.59/69.61 [2019-03-28 11:59:11,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 103.59/69.61 [2019-03-28 11:59:11,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 103.59/69.61 [2019-03-28 11:59:11,836 INFO L300 LassoAnalysis]: Preprocessing complete. 103.59/69.61 [2019-03-28 11:59:11,836 INFO L497 LassoAnalysis]: Using template 'affine'. 103.59/69.61 [2019-03-28 11:59:11,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:11,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:11,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:11,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:11,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:11,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:11,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:11,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:11,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:11,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:11,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:11,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:11,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:11,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:11,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:11,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:11,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:11,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:11,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:11,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:11,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:11,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:11,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:11,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:11,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:11,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:11,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:11,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:11,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:11,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:11,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:11,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:11,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:11,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:11,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:11,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:11,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:11,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:11,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:11,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:11,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:11,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:11,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:11,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:11,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:11,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:11,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:11,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:11,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:11,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:11,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:11,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:11,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:11,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:11,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:11,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:11,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:11,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:11,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:11,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:11,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:11,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:11,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 103.59/69.61 [2019-03-28 11:59:11,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 103.59/69.61 Termination analysis: LINEAR_WITH_GUESSES 103.59/69.61 Number of strict supporting invariants: 0 103.59/69.61 Number of non-strict supporting invariants: 1 103.59/69.61 Consider only non-deceasing supporting invariants: true 103.59/69.61 Simplify termination arguments: true 103.59/69.61 Simplify supporting invariants: trueOverapproximate stem: false 103.59/69.61 [2019-03-28 11:59:11,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 103.59/69.61 [2019-03-28 11:59:11,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 103.59/69.61 [2019-03-28 11:59:11,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 103.59/69.61 [2019-03-28 11:59:11,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 103.59/69.61 [2019-03-28 11:59:11,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 103.59/69.61 [2019-03-28 11:59:11,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 103.59/69.61 [2019-03-28 11:59:11,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 103.59/69.61 [2019-03-28 11:59:11,853 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 103.59/69.61 [2019-03-28 11:59:11,855 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 103.59/69.61 [2019-03-28 11:59:11,855 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 103.59/69.61 [2019-03-28 11:59:11,855 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 103.59/69.61 [2019-03-28 11:59:11,855 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 103.59/69.61 [2019-03-28 11:59:11,855 INFO L518 LassoAnalysis]: Proved termination. 103.59/69.61 [2019-03-28 11:59:11,855 INFO L520 LassoAnalysis]: Termination argument consisting of: 103.59/69.61 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 103.59/69.61 Supporting invariants [] 103.59/69.61 [2019-03-28 11:59:11,856 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 103.59/69.61 [2019-03-28 11:59:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 103.59/69.61 [2019-03-28 11:59:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:11,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:11,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:11,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:11,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 103.59/69.61 [2019-03-28 11:59:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:12,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:12,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:12,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:12,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:12,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:12,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:12,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:12,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:12,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:12,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:12,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:12,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:13,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:13,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:13,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:13,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:13,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:13,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:13,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:13,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:13,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:13,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 103.59/69.61 [2019-03-28 11:59:13,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core 103.59/69.61 [2019-03-28 11:59:13,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... 103.59/69.61 [2019-03-28 11:59:13,946 INFO L98 LoopCannibalizer]: 17 predicates before loop cannibalization 51 predicates after loop cannibalization 103.59/69.61 [2019-03-28 11:59:13,946 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 51 loop predicates 103.59/69.61 [2019-03-28 11:59:13,946 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 160 states and 308 transitions. cyclomatic complexity: 152 Second operand 15 states. 103.59/69.61 [2019-03-28 11:59:21,252 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 160 states and 308 transitions. cyclomatic complexity: 152. Second operand 15 states. Result 148783 states and 228328 transitions. Complement of second has 19154 states. 103.59/69.61 [2019-03-28 11:59:21,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 60 states 1 stem states 58 non-accepting loop states 1 accepting loop states 103.59/69.61 [2019-03-28 11:59:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 103.59/69.61 [2019-03-28 11:59:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 235 transitions. 103.59/69.61 [2019-03-28 11:59:21,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 235 transitions. Stem has 5 letters. Loop has 18 letters. 103.59/69.61 [2019-03-28 11:59:21,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:59:21,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 235 transitions. Stem has 23 letters. Loop has 18 letters. 103.59/69.61 [2019-03-28 11:59:21,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:59:21,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 235 transitions. Stem has 5 letters. Loop has 36 letters. 103.59/69.61 [2019-03-28 11:59:21,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. 103.59/69.61 [2019-03-28 11:59:21,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148783 states and 228328 transitions. 103.59/69.61 [2019-03-28 11:59:21,847 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 103.59/69.61 [2019-03-28 11:59:21,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148783 states to 0 states and 0 transitions. 103.59/69.61 [2019-03-28 11:59:21,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 103.59/69.61 [2019-03-28 11:59:21,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 103.59/69.61 [2019-03-28 11:59:21,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 103.59/69.61 [2019-03-28 11:59:21,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 103.59/69.61 [2019-03-28 11:59:21,848 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 103.59/69.61 [2019-03-28 11:59:21,848 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 103.59/69.61 [2019-03-28 11:59:21,848 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 103.59/69.61 [2019-03-28 11:59:21,848 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 103.59/69.61 [2019-03-28 11:59:21,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 103.59/69.61 [2019-03-28 11:59:21,848 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 103.59/69.61 [2019-03-28 11:59:21,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 103.59/69.61 [2019-03-28 11:59:21,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:59:21 BasicIcfg 103.59/69.61 [2019-03-28 11:59:21,855 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 103.59/69.61 [2019-03-28 11:59:21,855 INFO L168 Benchmark]: Toolchain (without parser) took 65220.71 ms. Allocated memory was 649.6 MB in the beginning and 2.2 GB in the end (delta: 1.5 GB). Free memory was 565.0 MB in the beginning and 1.2 GB in the end (delta: -640.4 MB). Peak memory consumption was 884.7 MB. Max. memory is 50.3 GB. 103.59/69.61 [2019-03-28 11:59:21,856 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 103.59/69.61 [2019-03-28 11:59:21,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.94 ms. Allocated memory is still 649.6 MB. Free memory was 565.0 MB in the beginning and 554.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 50.3 GB. 103.59/69.61 [2019-03-28 11:59:21,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.72 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 554.5 MB in the beginning and 648.1 MB in the end (delta: -93.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 50.3 GB. 103.59/69.61 [2019-03-28 11:59:21,857 INFO L168 Benchmark]: Boogie Preprocessor took 20.35 ms. Allocated memory is still 683.7 MB. Free memory was 648.1 MB in the beginning and 646.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 103.59/69.61 [2019-03-28 11:59:21,858 INFO L168 Benchmark]: RCFGBuilder took 215.12 ms. Allocated memory is still 683.7 MB. Free memory was 646.8 MB in the beginning and 632.3 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 50.3 GB. 103.59/69.61 [2019-03-28 11:59:21,858 INFO L168 Benchmark]: BlockEncodingV2 took 82.83 ms. Allocated memory is still 683.7 MB. Free memory was 632.3 MB in the beginning and 625.8 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 103.59/69.61 [2019-03-28 11:59:21,859 INFO L168 Benchmark]: TraceAbstraction took 166.31 ms. Allocated memory is still 683.7 MB. Free memory was 625.8 MB in the beginning and 616.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 103.59/69.61 [2019-03-28 11:59:21,859 INFO L168 Benchmark]: BuchiAutomizer took 64412.20 ms. Allocated memory was 683.7 MB in the beginning and 2.2 GB in the end (delta: 1.5 GB). Free memory was 616.4 MB in the beginning and 1.2 GB in the end (delta: -589.0 MB). Peak memory consumption was 902.1 MB. Max. memory is 50.3 GB. 103.59/69.61 [2019-03-28 11:59:21,864 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 103.59/69.61 --- Results --- 103.59/69.61 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 103.59/69.61 - StatisticsResult: Initial Icfg 103.59/69.61 10 locations, 15 edges 103.59/69.61 - StatisticsResult: Encoded RCFG 103.59/69.61 6 locations, 12 edges 103.59/69.61 * Results from de.uni_freiburg.informatik.ultimate.core: 103.59/69.61 - StatisticsResult: Toolchain Benchmarks 103.59/69.61 Benchmark results are: 103.59/69.61 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 103.59/69.61 * CACSL2BoogieTranslator took 229.94 ms. Allocated memory is still 649.6 MB. Free memory was 565.0 MB in the beginning and 554.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 50.3 GB. 103.59/69.61 * Boogie Procedure Inliner took 88.72 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 554.5 MB in the beginning and 648.1 MB in the end (delta: -93.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 50.3 GB. 103.59/69.61 * Boogie Preprocessor took 20.35 ms. Allocated memory is still 683.7 MB. Free memory was 648.1 MB in the beginning and 646.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 103.59/69.61 * RCFGBuilder took 215.12 ms. Allocated memory is still 683.7 MB. Free memory was 646.8 MB in the beginning and 632.3 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 50.3 GB. 103.59/69.61 * BlockEncodingV2 took 82.83 ms. Allocated memory is still 683.7 MB. Free memory was 632.3 MB in the beginning and 625.8 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 103.59/69.61 * TraceAbstraction took 166.31 ms. Allocated memory is still 683.7 MB. Free memory was 625.8 MB in the beginning and 616.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 103.59/69.61 * BuchiAutomizer took 64412.20 ms. Allocated memory was 683.7 MB in the beginning and 2.2 GB in the end (delta: 1.5 GB). Free memory was 616.4 MB in the beginning and 1.2 GB in the end (delta: -589.0 MB). Peak memory consumption was 902.1 MB. Max. memory is 50.3 GB. 103.59/69.61 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 103.59/69.61 - AllSpecificationsHoldResult: All specifications hold 103.59/69.61 We were not able to verify any specifiation because the program does not contain any specification. 103.59/69.61 - InvariantResult [Line: 18]: Loop Invariant 103.59/69.61 Derived loop invariant: 1 103.59/69.61 - InvariantResult [Line: 14]: Loop Invariant 103.59/69.61 Derived loop invariant: 1 103.59/69.61 - InvariantResult [Line: 16]: Loop Invariant 103.59/69.61 Derived loop invariant: 1 103.59/69.61 - StatisticsResult: Ultimate Automizer benchmark data 103.59/69.61 CFG has 1 procedures, 6 locations, 0 error locations. SAFE Result, 0.0s 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=6occurred 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, 3 LocationsWithAnnotation, 3 PreInvPairs, 3 NumberOfFragments, 3 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 103.59/69.61 - StatisticsResult: Constructed decomposition of program 103.59/69.61 Your program was decomposed into 14 terminating modules (4 trivial, 0 deterministic, 10 nondeterministic). One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y + -1 * x and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x + y and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 13 locations. One nondeterministic module has affine ranking function x and consists of 17 locations. One nondeterministic module has affine ranking function x and consists of 39 locations. One nondeterministic module has affine ranking function y and consists of 229 locations. One nondeterministic module has affine ranking function y and consists of 18 locations. One nondeterministic module has affine ranking function y and consists of 60 locations. 4 modules have a trivial ranking function, the largest among these consists of 12 locations. 103.59/69.61 - StatisticsResult: Timing statistics 103.59/69.61 BüchiAutomizer plugin needed 64.3s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 7.9s. Construction of modules took 4.3s. Büchi inclusion checks took 50.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 4359 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 1.3s Buchi closure took 0.0s. Biggest automaton had 510 states and ocurred in iteration 8. Nontrivial modules had stage [10, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 104/115 HoareTripleCheckerStatistics: 56 SDtfs, 880 SDslu, 1571 SDs, 0 SdLazy, 7790 SolverSat, 1156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT7 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp94 dnf100 smp100 tf108 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 33 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.3s 103.59/69.61 - TerminationAnalysisResult: Termination proven 103.59/69.61 Buchi Automizer proved that your program is terminating 103.59/69.61 RESULT: Ultimate proved your program to be correct! 103.59/69.61 !SESSION 2019-03-28 11:58:13.354 ----------------------------------------------- 103.59/69.61 eclipse.buildId=unknown 103.59/69.61 java.version=1.8.0_181 103.59/69.61 java.vendor=Oracle Corporation 103.59/69.61 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 103.59/69.61 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 103.59/69.61 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 103.59/69.61 103.59/69.61 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:59:22.094 103.59/69.61 !MESSAGE The workspace will exit with unsaved changes in this session. 103.59/69.61 Received shutdown request... 103.59/69.61 Ultimate: 103.59/69.61 GTK+ Version Check 103.59/69.61 EOF