31.57/17.38 YES 31.57/17.38 31.57/17.38 Ultimate: Cannot open display: 31.57/17.38 This is Ultimate 0.1.24-8dc7c08-m 31.57/17.38 [2019-03-28 22:34:30,702 INFO L170 SettingsManager]: Resetting all preferences to default values... 31.57/17.38 [2019-03-28 22:34:30,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 31.57/17.38 [2019-03-28 22:34:30,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 31.57/17.38 [2019-03-28 22:34:30,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 31.57/17.38 [2019-03-28 22:34:30,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 31.57/17.38 [2019-03-28 22:34:30,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 31.57/17.38 [2019-03-28 22:34:30,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 31.57/17.38 [2019-03-28 22:34:30,721 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 31.57/17.38 [2019-03-28 22:34:30,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 31.57/17.38 [2019-03-28 22:34:30,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 31.57/17.38 [2019-03-28 22:34:30,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 31.57/17.38 [2019-03-28 22:34:30,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 31.57/17.38 [2019-03-28 22:34:30,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 31.57/17.38 [2019-03-28 22:34:30,726 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 31.57/17.38 [2019-03-28 22:34:30,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 31.57/17.38 [2019-03-28 22:34:30,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 31.57/17.38 [2019-03-28 22:34:30,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 31.57/17.38 [2019-03-28 22:34:30,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 31.57/17.38 [2019-03-28 22:34:30,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 31.57/17.38 [2019-03-28 22:34:30,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 31.57/17.38 [2019-03-28 22:34:30,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 31.57/17.38 [2019-03-28 22:34:30,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 31.57/17.38 [2019-03-28 22:34:30,736 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 31.57/17.38 [2019-03-28 22:34:30,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 31.57/17.38 [2019-03-28 22:34:30,737 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 31.57/17.38 [2019-03-28 22:34:30,738 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 31.57/17.38 [2019-03-28 22:34:30,739 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 31.57/17.38 [2019-03-28 22:34:30,739 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 31.57/17.38 [2019-03-28 22:34:30,740 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 31.57/17.38 [2019-03-28 22:34:30,740 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 31.57/17.38 [2019-03-28 22:34:30,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 31.57/17.38 [2019-03-28 22:34:30,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 31.57/17.38 [2019-03-28 22:34:30,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 31.57/17.38 [2019-03-28 22:34:30,743 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 31.57/17.38 [2019-03-28 22:34:30,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 31.57/17.38 [2019-03-28 22:34:30,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 31.57/17.38 [2019-03-28 22:34:30,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 31.57/17.38 [2019-03-28 22:34:30,745 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 31.57/17.38 [2019-03-28 22:34:30,745 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 31.57/17.38 [2019-03-28 22:34:30,760 INFO L110 SettingsManager]: Loading preferences was successful 31.57/17.38 [2019-03-28 22:34:30,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 31.57/17.38 [2019-03-28 22:34:30,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 31.57/17.38 [2019-03-28 22:34:30,761 INFO L133 SettingsManager]: * Rewrite not-equals=true 31.57/17.38 [2019-03-28 22:34:30,762 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 31.57/17.38 [2019-03-28 22:34:30,762 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 31.57/17.38 [2019-03-28 22:34:30,762 INFO L133 SettingsManager]: * Use SBE=true 31.57/17.38 [2019-03-28 22:34:30,762 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 31.57/17.38 [2019-03-28 22:34:30,762 INFO L133 SettingsManager]: * Use old map elimination=false 31.57/17.38 [2019-03-28 22:34:30,763 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 31.57/17.38 [2019-03-28 22:34:30,763 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 31.57/17.38 [2019-03-28 22:34:30,763 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 31.57/17.38 [2019-03-28 22:34:30,763 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 31.57/17.38 [2019-03-28 22:34:30,764 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 31.57/17.38 [2019-03-28 22:34:30,764 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.38 [2019-03-28 22:34:30,764 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 31.57/17.38 [2019-03-28 22:34:30,764 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 31.57/17.38 [2019-03-28 22:34:30,764 INFO L133 SettingsManager]: * Check division by zero=IGNORE 31.57/17.38 [2019-03-28 22:34:30,765 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 31.57/17.38 [2019-03-28 22:34:30,765 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 31.57/17.38 [2019-03-28 22:34:30,765 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 31.57/17.38 [2019-03-28 22:34:30,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 31.57/17.38 [2019-03-28 22:34:30,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 31.57/17.38 [2019-03-28 22:34:30,766 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 31.57/17.38 [2019-03-28 22:34:30,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 31.57/17.38 [2019-03-28 22:34:30,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 31.57/17.38 [2019-03-28 22:34:30,766 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 31.57/17.38 [2019-03-28 22:34:30,766 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 31.57/17.38 [2019-03-28 22:34:30,767 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 31.57/17.38 [2019-03-28 22:34:30,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 31.57/17.38 [2019-03-28 22:34:30,805 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 31.57/17.38 [2019-03-28 22:34:30,809 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 31.57/17.38 [2019-03-28 22:34:30,810 INFO L271 PluginConnector]: Initializing CDTParser... 31.57/17.38 [2019-03-28 22:34:30,811 INFO L276 PluginConnector]: CDTParser initialized 31.57/17.38 [2019-03-28 22:34:30,811 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 31.57/17.38 [2019-03-28 22:34:30,877 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/5b84906a9e564cd4af38e1ebfa5764cf/FLAG61e47cd27 31.57/17.38 [2019-03-28 22:34:31,222 INFO L307 CDTParser]: Found 1 translation units. 31.57/17.38 [2019-03-28 22:34:31,223 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 31.57/17.38 [2019-03-28 22:34:31,229 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/5b84906a9e564cd4af38e1ebfa5764cf/FLAG61e47cd27 31.57/17.38 [2019-03-28 22:34:31,649 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/5b84906a9e564cd4af38e1ebfa5764cf 31.57/17.38 [2019-03-28 22:34:31,661 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 31.57/17.38 [2019-03-28 22:34:31,662 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 31.57/17.38 [2019-03-28 22:34:31,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 31.57/17.38 [2019-03-28 22:34:31,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 31.57/17.38 [2019-03-28 22:34:31,667 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 31.57/17.38 [2019-03-28 22:34:31,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:31,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ab67a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31, skipping insertion in model container 31.57/17.38 [2019-03-28 22:34:31,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:31,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 31.57/17.38 [2019-03-28 22:34:31,697 INFO L176 MainTranslator]: Built tables and reachable declarations 31.57/17.38 [2019-03-28 22:34:31,854 INFO L206 PostProcessor]: Analyzing one entry point: main 31.57/17.38 [2019-03-28 22:34:31,859 INFO L191 MainTranslator]: Completed pre-run 31.57/17.38 [2019-03-28 22:34:31,877 INFO L206 PostProcessor]: Analyzing one entry point: main 31.57/17.38 [2019-03-28 22:34:31,955 INFO L195 MainTranslator]: Completed translation 31.57/17.38 [2019-03-28 22:34:31,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31 WrapperNode 31.57/17.38 [2019-03-28 22:34:31,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 31.57/17.38 [2019-03-28 22:34:31,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 31.57/17.38 [2019-03-28 22:34:31,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 31.57/17.38 [2019-03-28 22:34:31,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 31.57/17.38 [2019-03-28 22:34:31,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:31,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:31,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 31.57/17.38 [2019-03-28 22:34:31,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 31.57/17.38 [2019-03-28 22:34:31,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 31.57/17.38 [2019-03-28 22:34:31,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized 31.57/17.38 [2019-03-28 22:34:32,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:32,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:32,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:32,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:32,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:32,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:32,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 [2019-03-28 22:34:32,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 31.57/17.38 [2019-03-28 22:34:32,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 31.57/17.38 [2019-03-28 22:34:32,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... 31.57/17.38 [2019-03-28 22:34:32,016 INFO L276 PluginConnector]: RCFGBuilder initialized 31.57/17.38 [2019-03-28 22:34:32,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (1/1) ... 31.57/17.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.38 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 31.57/17.38 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 31.57/17.38 [2019-03-28 22:34:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 31.57/17.38 [2019-03-28 22:34:32,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 31.57/17.38 [2019-03-28 22:34:32,227 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 31.57/17.38 [2019-03-28 22:34:32,228 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 31.57/17.38 [2019-03-28 22:34:32,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:34:32 BoogieIcfgContainer 31.57/17.38 [2019-03-28 22:34:32,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 31.57/17.38 [2019-03-28 22:34:32,230 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 31.57/17.38 [2019-03-28 22:34:32,230 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 31.57/17.38 [2019-03-28 22:34:32,232 INFO L276 PluginConnector]: BlockEncodingV2 initialized 31.57/17.38 [2019-03-28 22:34:32,233 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:34:32" (1/1) ... 31.57/17.38 [2019-03-28 22:34:32,249 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 31.57/17.38 [2019-03-28 22:34:32,251 INFO L258 BlockEncoder]: Using Remove infeasible edges 31.57/17.38 [2019-03-28 22:34:32,252 INFO L263 BlockEncoder]: Using Maximize final states 31.57/17.38 [2019-03-28 22:34:32,252 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 31.57/17.38 [2019-03-28 22:34:32,253 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 31.57/17.38 [2019-03-28 22:34:32,256 INFO L296 BlockEncoder]: Using Remove sink states 31.57/17.38 [2019-03-28 22:34:32,257 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 31.57/17.38 [2019-03-28 22:34:32,257 INFO L179 BlockEncoder]: Using Rewrite not-equals 31.57/17.38 [2019-03-28 22:34:32,279 INFO L185 BlockEncoder]: Using Use SBE 31.57/17.38 [2019-03-28 22:34:32,300 INFO L200 BlockEncoder]: SBE split 2 edges 31.57/17.38 [2019-03-28 22:34:32,305 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 31.57/17.38 [2019-03-28 22:34:32,306 INFO L71 MaximizeFinalStates]: 0 new accepting states 31.57/17.38 [2019-03-28 22:34:32,317 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 31.57/17.38 [2019-03-28 22:34:32,319 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 31.57/17.38 [2019-03-28 22:34:32,320 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 31.57/17.38 [2019-03-28 22:34:32,321 INFO L71 MaximizeFinalStates]: 0 new accepting states 31.57/17.39 [2019-03-28 22:34:32,321 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 31.57/17.39 [2019-03-28 22:34:32,321 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 31.57/17.39 [2019-03-28 22:34:32,321 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges 31.57/17.39 [2019-03-28 22:34:32,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:34:32 BasicIcfg 31.57/17.39 [2019-03-28 22:34:32,322 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 31.57/17.39 [2019-03-28 22:34:32,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 31.57/17.39 [2019-03-28 22:34:32,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... 31.57/17.39 [2019-03-28 22:34:32,326 INFO L276 PluginConnector]: TraceAbstraction initialized 31.57/17.39 [2019-03-28 22:34:32,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:34:31" (1/4) ... 31.57/17.39 [2019-03-28 22:34:32,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2352ee8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:34:32, skipping insertion in model container 31.57/17.39 [2019-03-28 22:34:32,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (2/4) ... 31.57/17.39 [2019-03-28 22:34:32,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2352ee8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:34:32, skipping insertion in model container 31.57/17.39 [2019-03-28 22:34:32,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:34:32" (3/4) ... 31.57/17.39 [2019-03-28 22:34:32,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2352ee8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:34:32, skipping insertion in model container 31.57/17.39 [2019-03-28 22:34:32,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:34:32" (4/4) ... 31.57/17.39 [2019-03-28 22:34:32,331 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 31.57/17.39 [2019-03-28 22:34:32,341 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 31.57/17.39 [2019-03-28 22:34:32,348 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 31.57/17.39 [2019-03-28 22:34:32,365 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 31.57/17.39 [2019-03-28 22:34:32,394 INFO L133 ementStrategyFactory]: Using default assertion order modulation 31.57/17.39 [2019-03-28 22:34:32,395 INFO L382 AbstractCegarLoop]: Interprodecural is true 31.57/17.39 [2019-03-28 22:34:32,395 INFO L383 AbstractCegarLoop]: Hoare is true 31.57/17.39 [2019-03-28 22:34:32,395 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 31.57/17.39 [2019-03-28 22:34:32,395 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 31.57/17.39 [2019-03-28 22:34:32,395 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 31.57/17.39 [2019-03-28 22:34:32,396 INFO L387 AbstractCegarLoop]: Difference is false 31.57/17.39 [2019-03-28 22:34:32,396 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 31.57/17.39 [2019-03-28 22:34:32,396 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 31.57/17.39 [2019-03-28 22:34:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 31.57/17.39 [2019-03-28 22:34:32,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 31.57/17.39 [2019-03-28 22:34:32,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 31.57/17.39 [2019-03-28 22:34:32,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 31.57/17.39 [2019-03-28 22:34:32,468 INFO L451 ceAbstractionStarter]: At program point L27-1(lines 21 36) the Hoare annotation is: true 31.57/17.39 [2019-03-28 22:34:32,469 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 26) no Hoare annotation was computed. 31.57/17.39 [2019-03-28 22:34:32,469 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 21 36) no Hoare annotation was computed. 31.57/17.39 [2019-03-28 22:34:32,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:34:32 BasicIcfg 31.57/17.39 [2019-03-28 22:34:32,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 31.57/17.39 [2019-03-28 22:34:32,478 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 31.57/17.39 [2019-03-28 22:34:32,478 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 31.57/17.39 [2019-03-28 22:34:32,481 INFO L276 PluginConnector]: BuchiAutomizer initialized 31.57/17.39 [2019-03-28 22:34:32,482 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.57/17.39 [2019-03-28 22:34:32,483 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:34:31" (1/5) ... 31.57/17.39 [2019-03-28 22:34:32,483 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47684874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:34:32, skipping insertion in model container 31.57/17.39 [2019-03-28 22:34:32,483 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.57/17.39 [2019-03-28 22:34:32,484 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:34:31" (2/5) ... 31.57/17.39 [2019-03-28 22:34:32,484 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47684874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:34:32, skipping insertion in model container 31.57/17.39 [2019-03-28 22:34:32,484 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.57/17.39 [2019-03-28 22:34:32,484 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:34:32" (3/5) ... 31.57/17.39 [2019-03-28 22:34:32,485 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47684874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:34:32, skipping insertion in model container 31.57/17.39 [2019-03-28 22:34:32,485 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.57/17.39 [2019-03-28 22:34:32,485 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:34:32" (4/5) ... 31.57/17.39 [2019-03-28 22:34:32,485 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47684874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:34:32, skipping insertion in model container 31.57/17.39 [2019-03-28 22:34:32,485 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.57/17.39 [2019-03-28 22:34:32,486 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:34:32" (5/5) ... 31.57/17.39 [2019-03-28 22:34:32,487 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 31.57/17.39 [2019-03-28 22:34:32,516 INFO L133 ementStrategyFactory]: Using default assertion order modulation 31.57/17.39 [2019-03-28 22:34:32,516 INFO L374 BuchiCegarLoop]: Interprodecural is true 31.57/17.39 [2019-03-28 22:34:32,516 INFO L375 BuchiCegarLoop]: Hoare is true 31.57/17.39 [2019-03-28 22:34:32,516 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 31.57/17.39 [2019-03-28 22:34:32,517 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 31.57/17.39 [2019-03-28 22:34:32,517 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 31.57/17.39 [2019-03-28 22:34:32,517 INFO L379 BuchiCegarLoop]: Difference is false 31.57/17.39 [2019-03-28 22:34:32,517 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 31.57/17.39 [2019-03-28 22:34:32,517 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 31.57/17.39 [2019-03-28 22:34:32,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 31.57/17.39 [2019-03-28 22:34:32,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 31.57/17.39 [2019-03-28 22:34:32,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.57/17.39 [2019-03-28 22:34:32,538 INFO L119 BuchiIsEmpty]: Starting construction of run 31.57/17.39 [2019-03-28 22:34:32,545 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 31.57/17.39 [2019-03-28 22:34:32,545 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 31.57/17.39 [2019-03-28 22:34:32,545 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 31.57/17.39 [2019-03-28 22:34:32,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 31.57/17.39 [2019-03-28 22:34:32,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 31.57/17.39 [2019-03-28 22:34:32,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.57/17.39 [2019-03-28 22:34:32,547 INFO L119 BuchiIsEmpty]: Starting construction of run 31.57/17.39 [2019-03-28 22:34:32,547 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 31.57/17.39 [2019-03-28 22:34:32,547 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 31.57/17.39 [2019-03-28 22:34:32,552 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [34] ULTIMATE.startENTRY-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 3#L27-1true 31.57/17.39 [2019-03-28 22:34:32,553 INFO L796 eck$LassoCheckResult]: Loop: 3#L27-1true [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 5#L22true [35] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 6#L22-2true [40] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 3#L27-1true 31.57/17.39 [2019-03-28 22:34:32,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:32,559 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:32,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:32,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:32,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:32,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:32,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 61668, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:32,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:32,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1968292, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:32,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:32,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:32,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:32,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:32,772 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:32,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:32,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:32,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:32,774 INFO L127 ssoRankerPreferences]: Use exernal solver: true 31.57/17.39 [2019-03-28 22:34:32,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:32,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:32,774 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:32,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 31.57/17.39 [2019-03-28 22:34:32,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:32,775 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:32,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:32,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:32,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:32,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:32,949 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:32,950 INFO L412 LassoAnalysis]: Checking for nontermination... 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:32,957 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:32,957 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:32,991 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:32,991 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:33,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:33,001 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:33,030 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:33,030 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:33,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:33,036 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:33,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:33,069 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:33,107 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 31.57/17.39 [2019-03-28 22:34:33,109 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:33,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:33,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:33,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:33,110 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.57/17.39 [2019-03-28 22:34:33,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:33,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:33,110 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:33,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 31.57/17.39 [2019-03-28 22:34:33,111 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:33,111 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:33,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:33,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:33,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:33,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:33,206 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:33,212 INFO L497 LassoAnalysis]: Using template 'affine'. 31.57/17.39 [2019-03-28 22:34:33,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:33,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:33,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:33,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:33,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:33,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:33,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:33,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:33,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:33,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:33,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:33,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:33,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:33,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:33,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:33,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:33,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:33,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:33,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:33,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:33,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:33,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:33,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:33,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:33,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:33,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:33,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:33,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:33,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:33,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:33,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:33,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:33,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:33,274 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.57/17.39 [2019-03-28 22:34:33,281 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.57/17.39 [2019-03-28 22:34:33,281 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 31.57/17.39 [2019-03-28 22:34:33,284 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.57/17.39 [2019-03-28 22:34:33,284 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.57/17.39 [2019-03-28 22:34:33,285 INFO L518 LassoAnalysis]: Proved termination. 31.57/17.39 [2019-03-28 22:34:33,285 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.57/17.39 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 31.57/17.39 Supporting invariants [] 31.57/17.39 [2019-03-28 22:34:33,286 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 31.57/17.39 [2019-03-28 22:34:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:33,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:33,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:33,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:33,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:33,417 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.57/17.39 [2019-03-28 22:34:33,418 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 31.57/17.39 [2019-03-28 22:34:33,423 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 4 loop predicates 31.57/17.39 [2019-03-28 22:34:33,425 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 4 states. 31.57/17.39 [2019-03-28 22:34:33,575 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 4 states. Result 13 states and 26 transitions. Complement of second has 10 states. 31.57/17.39 [2019-03-28 22:34:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 31.57/17.39 [2019-03-28 22:34:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 31.57/17.39 [2019-03-28 22:34:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. 31.57/17.39 [2019-03-28 22:34:33,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:33,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:33,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:33,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:33,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 6 letters. 31.57/17.39 [2019-03-28 22:34:33,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:33,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 26 transitions. 31.57/17.39 [2019-03-28 22:34:33,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 31.57/17.39 [2019-03-28 22:34:33,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:33,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 31.57/17.39 [2019-03-28 22:34:33,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 31.57/17.39 [2019-03-28 22:34:33,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:33,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.57/17.39 [2019-03-28 22:34:33,600 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 31.57/17.39 [2019-03-28 22:34:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 31.57/17.39 [2019-03-28 22:34:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:33,632 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:33,632 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:33,632 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 31.57/17.39 [2019-03-28 22:34:33,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:33,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 31.57/17.39 [2019-03-28 22:34:33,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.57/17.39 [2019-03-28 22:34:33,633 INFO L119 BuchiIsEmpty]: Starting construction of run 31.57/17.39 [2019-03-28 22:34:33,634 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 31.57/17.39 [2019-03-28 22:34:33,634 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 31.57/17.39 [2019-03-28 22:34:33,635 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 73#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 71#L22 [42] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~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_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 74#L22-2 [47] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 67#L27-1 31.57/17.39 [2019-03-28 22:34:33,635 INFO L796 eck$LassoCheckResult]: Loop: 67#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 68#L22 [35] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 76#L22-2 [40] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 67#L27-1 31.57/17.39 [2019-03-28 22:34:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1968516, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:33,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:33,654 INFO L82 PathProgramCache]: Analyzing trace with hash 61668, now seen corresponding path program 2 times 31.57/17.39 [2019-03-28 22:34:33,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:33,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:33,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1485450111, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:33,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:33,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:33,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 31.57/17.39 [2019-03-28 22:34:33,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 31.57/17.39 [2019-03-28 22:34:33,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:33,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:33,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:33,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 31.57/17.39 [2019-03-28 22:34:33,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 31.57/17.39 [2019-03-28 22:34:33,923 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:33,923 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:33,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:33,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:33,923 INFO L127 ssoRankerPreferences]: Use exernal solver: true 31.57/17.39 [2019-03-28 22:34:33,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:33,924 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:33,924 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:33,924 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 31.57/17.39 [2019-03-28 22:34:33,924 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:33,924 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:33,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:33,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:33,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:33,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:34,037 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:34,037 INFO L412 LassoAnalysis]: Checking for nontermination... 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:34,045 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:34,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:34,073 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:34,078 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:34,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:34,105 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:34,110 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:34,141 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:34,178 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 31.57/17.39 [2019-03-28 22:34:34,180 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:34,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:34,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:34,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:34,180 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.57/17.39 [2019-03-28 22:34:34,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:34,181 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:34,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 31.57/17.39 [2019-03-28 22:34:34,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:34,181 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:34,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:34,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:34,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:34,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:34,264 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:34,265 INFO L497 LassoAnalysis]: Using template 'affine'. 31.57/17.39 [2019-03-28 22:34:34,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:34,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:34,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:34,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:34,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:34,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:34,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:34,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:34,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:34,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:34,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:34,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:34,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:34,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:34,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:34,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:34,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:34,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:34,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:34,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:34,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:34,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:34,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:34,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:34,291 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.57/17.39 [2019-03-28 22:34:34,296 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.57/17.39 [2019-03-28 22:34:34,296 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 31.57/17.39 [2019-03-28 22:34:34,296 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.57/17.39 [2019-03-28 22:34:34,297 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.57/17.39 [2019-03-28 22:34:34,297 INFO L518 LassoAnalysis]: Proved termination. 31.57/17.39 [2019-03-28 22:34:34,297 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.57/17.39 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 31.57/17.39 Supporting invariants [] 31.57/17.39 [2019-03-28 22:34:34,297 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 31.57/17.39 [2019-03-28 22:34:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:34,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:34,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:34,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:34,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:34,381 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.57/17.39 [2019-03-28 22:34:34,381 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 31.57/17.39 [2019-03-28 22:34:34,382 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 4 loop predicates 31.57/17.39 [2019-03-28 22:34:34,382 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 10 Second operand 4 states. 31.57/17.39 [2019-03-28 22:34:34,464 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 33 states and 63 transitions. Complement of second has 20 states. 31.57/17.39 [2019-03-28 22:34:34,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 31.57/17.39 [2019-03-28 22:34:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 31.57/17.39 [2019-03-28 22:34:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. 31.57/17.39 [2019-03-28 22:34:34,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:34,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:34,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 7 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:34,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:34,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 6 letters. 31.57/17.39 [2019-03-28 22:34:34,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:34,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 63 transitions. 31.57/17.39 [2019-03-28 22:34:34,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 31.57/17.39 [2019-03-28 22:34:34,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 25 states and 46 transitions. 31.57/17.39 [2019-03-28 22:34:34,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 31.57/17.39 [2019-03-28 22:34:34,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 31.57/17.39 [2019-03-28 22:34:34,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 46 transitions. 31.57/17.39 [2019-03-28 22:34:34,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.57/17.39 [2019-03-28 22:34:34,474 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 46 transitions. 31.57/17.39 [2019-03-28 22:34:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 46 transitions. 31.57/17.39 [2019-03-28 22:34:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 10. 31.57/17.39 [2019-03-28 22:34:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 31.57/17.39 [2019-03-28 22:34:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:34,476 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 31.57/17.39 [2019-03-28 22:34:34,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 31.57/17.39 [2019-03-28 22:34:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 31.57/17.39 [2019-03-28 22:34:34,479 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 8 states. 31.57/17.39 [2019-03-28 22:34:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.57/17.39 [2019-03-28 22:34:34,634 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. 31.57/17.39 [2019-03-28 22:34:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 31.57/17.39 [2019-03-28 22:34:34,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 39 transitions. 31.57/17.39 [2019-03-28 22:34:34,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 31.57/17.39 [2019-03-28 22:34:34,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 39 transitions. 31.57/17.39 [2019-03-28 22:34:34,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 31.57/17.39 [2019-03-28 22:34:34,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 31.57/17.39 [2019-03-28 22:34:34,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 39 transitions. 31.57/17.39 [2019-03-28 22:34:34,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.57/17.39 [2019-03-28 22:34:34,638 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 39 transitions. 31.57/17.39 [2019-03-28 22:34:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 39 transitions. 31.57/17.39 [2019-03-28 22:34:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. 31.57/17.39 [2019-03-28 22:34:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 31.57/17.39 [2019-03-28 22:34:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. 31.57/17.39 [2019-03-28 22:34:34,641 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 31.57/17.39 [2019-03-28 22:34:34,641 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 31.57/17.39 [2019-03-28 22:34:34,641 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 31.57/17.39 [2019-03-28 22:34:34,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 29 transitions. 31.57/17.39 [2019-03-28 22:34:34,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 31.57/17.39 [2019-03-28 22:34:34,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.57/17.39 [2019-03-28 22:34:34,642 INFO L119 BuchiIsEmpty]: Starting construction of run 31.57/17.39 [2019-03-28 22:34:34,642 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 31.57/17.39 [2019-03-28 22:34:34,643 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 31.57/17.39 [2019-03-28 22:34:34,643 INFO L794 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 247#L27-1 31.57/17.39 [2019-03-28 22:34:34,643 INFO L796 eck$LassoCheckResult]: Loop: 247#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 245#L22 [35] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 253#L22-2 [47] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 247#L27-1 31.57/17.39 [2019-03-28 22:34:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:34,643 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 2 times 31.57/17.39 [2019-03-28 22:34:34,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:34,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:34,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:34,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash 61675, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:34,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:34,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:34,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:34,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:34,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:34,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1968299, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:34,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:34,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:34,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:34,710 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:34,710 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:34,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:34,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:34,711 INFO L127 ssoRankerPreferences]: Use exernal solver: true 31.57/17.39 [2019-03-28 22:34:34,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:34,711 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:34,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 31.57/17.39 [2019-03-28 22:34:34,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:34,712 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:34,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:34,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:34,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:34,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:34,779 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:34,779 INFO L412 LassoAnalysis]: Checking for nontermination... 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:34,783 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:34,809 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:34,809 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:34,814 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:34,842 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:34,842 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:34,847 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:34,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:34,880 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:35,073 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 31.57/17.39 [2019-03-28 22:34:35,076 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:35,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:35,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:35,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:35,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.57/17.39 [2019-03-28 22:34:35,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:35,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:35,077 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:35,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 31.57/17.39 [2019-03-28 22:34:35,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:35,077 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:35,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,151 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:35,151 INFO L497 LassoAnalysis]: Using template 'affine'. 31.57/17.39 [2019-03-28 22:34:35,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:35,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:35,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:35,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:35,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:35,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:35,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:35,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:35,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:35,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:35,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:35,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:35,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:35,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:35,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:35,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:35,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:35,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:35,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:35,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:35,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:35,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:35,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:35,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:35,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:35,171 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.57/17.39 [2019-03-28 22:34:35,175 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.57/17.39 [2019-03-28 22:34:35,175 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 31.57/17.39 [2019-03-28 22:34:35,175 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.57/17.39 [2019-03-28 22:34:35,175 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.57/17.39 [2019-03-28 22:34:35,176 INFO L518 LassoAnalysis]: Proved termination. 31.57/17.39 [2019-03-28 22:34:35,176 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.57/17.39 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 31.57/17.39 Supporting invariants [] 31.57/17.39 [2019-03-28 22:34:35,176 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 31.57/17.39 [2019-03-28 22:34:35,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:35,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:35,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:35,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:35,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:35,263 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.57/17.39 [2019-03-28 22:34:35,263 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 31.57/17.39 [2019-03-28 22:34:35,263 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 4 loop predicates 31.57/17.39 [2019-03-28 22:34:35,263 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 13 Second operand 4 states. 31.57/17.39 [2019-03-28 22:34:35,364 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 70 states and 121 transitions. Complement of second has 10 states. 31.57/17.39 [2019-03-28 22:34:35,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 31.57/17.39 [2019-03-28 22:34:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 31.57/17.39 [2019-03-28 22:34:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. 31.57/17.39 [2019-03-28 22:34:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:35,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 6 letters. 31.57/17.39 [2019-03-28 22:34:35,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:35,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 121 transitions. 31.57/17.39 [2019-03-28 22:34:35,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 31.57/17.39 [2019-03-28 22:34:35,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 48 states and 84 transitions. 31.57/17.39 [2019-03-28 22:34:35,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 31.57/17.39 [2019-03-28 22:34:35,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 31.57/17.39 [2019-03-28 22:34:35,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 84 transitions. 31.57/17.39 [2019-03-28 22:34:35,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.57/17.39 [2019-03-28 22:34:35,373 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 84 transitions. 31.57/17.39 [2019-03-28 22:34:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 84 transitions. 31.57/17.39 [2019-03-28 22:34:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 24. 31.57/17.39 [2019-03-28 22:34:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 31.57/17.39 [2019-03-28 22:34:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. 31.57/17.39 [2019-03-28 22:34:35,377 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 43 transitions. 31.57/17.39 [2019-03-28 22:34:35,377 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 43 transitions. 31.57/17.39 [2019-03-28 22:34:35,377 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 31.57/17.39 [2019-03-28 22:34:35,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 43 transitions. 31.57/17.39 [2019-03-28 22:34:35,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 31.57/17.39 [2019-03-28 22:34:35,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.57/17.39 [2019-03-28 22:34:35,378 INFO L119 BuchiIsEmpty]: Starting construction of run 31.57/17.39 [2019-03-28 22:34:35,379 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 31.57/17.39 [2019-03-28 22:34:35,379 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 31.57/17.39 [2019-03-28 22:34:35,379 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 381#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 382#L22 31.57/17.39 [2019-03-28 22:34:35,379 INFO L796 eck$LassoCheckResult]: Loop: 382#L22 [42] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~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_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 383#L22-2 [47] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 393#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 382#L22 31.57/17.39 [2019-03-28 22:34:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2047, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:35,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:35,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:35,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:35,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:35,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash 71642, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:35,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:35,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:35,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:35,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:35,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:35,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:35,395 INFO L82 PathProgramCache]: Analyzing trace with hash 61024028, now seen corresponding path program 2 times 31.57/17.39 [2019-03-28 22:34:35,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:35,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:35,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:35,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:35,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:35,448 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:35,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:35,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:35,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:35,449 INFO L127 ssoRankerPreferences]: Use exernal solver: true 31.57/17.39 [2019-03-28 22:34:35,449 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:35,449 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:35,450 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:35,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 31.57/17.39 [2019-03-28 22:34:35,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:35,450 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:35,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,519 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:35,519 INFO L412 LassoAnalysis]: Checking for nontermination... 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:35,522 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:35,522 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:35,549 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:35,549 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:35,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:35,553 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:35,580 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:35,580 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:35,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:35,584 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:35,611 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:35,611 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:35,615 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:35,616 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:35,645 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:35,645 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:35,919 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 31.57/17.39 [2019-03-28 22:34:35,921 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:35,921 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:35,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:35,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:35,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.57/17.39 [2019-03-28 22:34:35,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:35,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:35,922 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:35,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 31.57/17.39 [2019-03-28 22:34:35,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:35,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:35,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:35,986 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:35,987 INFO L497 LassoAnalysis]: Using template 'affine'. 31.57/17.39 [2019-03-28 22:34:35,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:35,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:35,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:35,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:35,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:35,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:35,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:35,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:35,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:35,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:35,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:35,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:35,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:35,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:35,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:35,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:35,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:35,998 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.57/17.39 [2019-03-28 22:34:36,001 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.57/17.39 [2019-03-28 22:34:36,001 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 31.57/17.39 [2019-03-28 22:34:36,001 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.57/17.39 [2019-03-28 22:34:36,002 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.57/17.39 [2019-03-28 22:34:36,002 INFO L518 LassoAnalysis]: Proved termination. 31.57/17.39 [2019-03-28 22:34:36,002 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.57/17.39 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 31.57/17.39 Supporting invariants [] 31.57/17.39 [2019-03-28 22:34:36,002 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 31.57/17.39 [2019-03-28 22:34:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:36,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:36,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:36,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:36,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:36,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:36,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:36,087 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 31.57/17.39 [2019-03-28 22:34:36,088 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 31.57/17.39 [2019-03-28 22:34:36,088 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 43 transitions. cyclomatic complexity: 21 Second operand 4 states. 31.57/17.39 [2019-03-28 22:34:36,192 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 43 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 107 states and 184 transitions. Complement of second has 21 states. 31.57/17.39 [2019-03-28 22:34:36,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 2 accepting loop states 31.57/17.39 [2019-03-28 22:34:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 31.57/17.39 [2019-03-28 22:34:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. 31.57/17.39 [2019-03-28 22:34:36,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:36,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:36,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:36,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:36,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. 31.57/17.39 [2019-03-28 22:34:36,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:36,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 184 transitions. 31.57/17.39 [2019-03-28 22:34:36,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 31.57/17.39 [2019-03-28 22:34:36,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 50 states and 82 transitions. 31.57/17.39 [2019-03-28 22:34:36,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 31.57/17.39 [2019-03-28 22:34:36,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 31.57/17.39 [2019-03-28 22:34:36,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 82 transitions. 31.57/17.39 [2019-03-28 22:34:36,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.57/17.39 [2019-03-28 22:34:36,201 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 82 transitions. 31.57/17.39 [2019-03-28 22:34:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 82 transitions. 31.57/17.39 [2019-03-28 22:34:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 25. 31.57/17.39 [2019-03-28 22:34:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 31.57/17.39 [2019-03-28 22:34:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. 31.57/17.39 [2019-03-28 22:34:36,205 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 46 transitions. 31.57/17.39 [2019-03-28 22:34:36,205 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 46 transitions. 31.57/17.39 [2019-03-28 22:34:36,205 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 31.57/17.39 [2019-03-28 22:34:36,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 46 transitions. 31.57/17.39 [2019-03-28 22:34:36,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 31.57/17.39 [2019-03-28 22:34:36,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.57/17.39 [2019-03-28 22:34:36,206 INFO L119 BuchiIsEmpty]: Starting construction of run 31.57/17.39 [2019-03-28 22:34:36,206 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] 31.57/17.39 [2019-03-28 22:34:36,206 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] 31.57/17.39 [2019-03-28 22:34:36,207 INFO L794 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 578#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 579#L22 [35] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 597#L22-2 [46] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 598#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 591#L22 31.57/17.39 [2019-03-28 22:34:36,207 INFO L796 eck$LassoCheckResult]: Loop: 591#L22 [35] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 587#L22-2 [40] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 588#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 595#L22 [35] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 600#L22-2 [46] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 596#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 591#L22 31.57/17.39 [2019-03-28 22:34:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash 61017270, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:36,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:36,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:36,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1927453211, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:36,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:36,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:36,228 INFO L82 PathProgramCache]: Analyzing trace with hash 567577360, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:36,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:36,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:36,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:36,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 31.57/17.39 [2019-03-28 22:34:36,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 31.57/17.39 [2019-03-28 22:34:36,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:36,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:36,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:36,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 31.57/17.39 [2019-03-28 22:34:36,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 31.57/17.39 [2019-03-28 22:34:36,436 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:36,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:36,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:36,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:36,437 INFO L127 ssoRankerPreferences]: Use exernal solver: true 31.57/17.39 [2019-03-28 22:34:36,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:36,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:36,437 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:36,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 31.57/17.39 [2019-03-28 22:34:36,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:36,438 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:36,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:36,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:36,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:36,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:36,505 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:36,505 INFO L412 LassoAnalysis]: Checking for nontermination... 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:36,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:36,508 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:36,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:36,540 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:37,010 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 31.57/17.39 [2019-03-28 22:34:37,013 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:37,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:37,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:37,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:37,014 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.57/17.39 [2019-03-28 22:34:37,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:37,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:37,014 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:37,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 31.57/17.39 [2019-03-28 22:34:37,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:37,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:37,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:37,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:37,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:37,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:37,097 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:37,097 INFO L497 LassoAnalysis]: Using template 'affine'. 31.57/17.39 [2019-03-28 22:34:37,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:37,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:37,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:37,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:37,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:37,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:37,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:37,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:37,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:37,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:37,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:37,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:37,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:37,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:37,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:37,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:37,109 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.57/17.39 [2019-03-28 22:34:37,114 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 31.57/17.39 [2019-03-28 22:34:37,114 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. 31.57/17.39 [2019-03-28 22:34:37,114 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.57/17.39 [2019-03-28 22:34:37,114 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.57/17.39 [2019-03-28 22:34:37,115 INFO L518 LassoAnalysis]: Proved termination. 31.57/17.39 [2019-03-28 22:34:37,115 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.57/17.39 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 31.57/17.39 Supporting invariants [] 31.57/17.39 [2019-03-28 22:34:37,115 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 31.57/17.39 [2019-03-28 22:34:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:37,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:37,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:37,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:37,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:37,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:37,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:37,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:37,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:37,360 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.57/17.39 [2019-03-28 22:34:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:37,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:37,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:37,432 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 13 predicates after loop cannibalization 31.57/17.39 [2019-03-28 22:34:37,432 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 13 loop predicates 31.57/17.39 [2019-03-28 22:34:37,433 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 46 transitions. cyclomatic complexity: 23 Second operand 6 states. 31.57/17.39 [2019-03-28 22:34:38,213 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 46 transitions. cyclomatic complexity: 23. Second operand 6 states. Result 504 states and 785 transitions. Complement of second has 156 states. 31.57/17.39 [2019-03-28 22:34:38,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 17 non-accepting loop states 2 accepting loop states 31.57/17.39 [2019-03-28 22:34:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 31.57/17.39 [2019-03-28 22:34:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 52 transitions. 31.57/17.39 [2019-03-28 22:34:38,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 52 transitions. Stem has 5 letters. Loop has 6 letters. 31.57/17.39 [2019-03-28 22:34:38,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:38,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 52 transitions. Stem has 11 letters. Loop has 6 letters. 31.57/17.39 [2019-03-28 22:34:38,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:38,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 52 transitions. Stem has 5 letters. Loop has 12 letters. 31.57/17.39 [2019-03-28 22:34:38,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:38,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 504 states and 785 transitions. 31.57/17.39 [2019-03-28 22:34:38,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 31.57/17.39 [2019-03-28 22:34:38,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 504 states to 67 states and 94 transitions. 31.57/17.39 [2019-03-28 22:34:38,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 31.57/17.39 [2019-03-28 22:34:38,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 31.57/17.39 [2019-03-28 22:34:38,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 94 transitions. 31.57/17.39 [2019-03-28 22:34:38,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.57/17.39 [2019-03-28 22:34:38,244 INFO L706 BuchiCegarLoop]: Abstraction has 67 states and 94 transitions. 31.57/17.39 [2019-03-28 22:34:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 94 transitions. 31.57/17.39 [2019-03-28 22:34:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 27. 31.57/17.39 [2019-03-28 22:34:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 31.57/17.39 [2019-03-28 22:34:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. 31.57/17.39 [2019-03-28 22:34:38,248 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. 31.57/17.39 [2019-03-28 22:34:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 31.57/17.39 [2019-03-28 22:34:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 31.57/17.39 [2019-03-28 22:34:38,249 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 8 states. 31.57/17.39 [2019-03-28 22:34:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.57/17.39 [2019-03-28 22:34:38,331 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. 31.57/17.39 [2019-03-28 22:34:38,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 31.57/17.39 [2019-03-28 22:34:38,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 59 transitions. 31.57/17.39 [2019-03-28 22:34:38,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 31.57/17.39 [2019-03-28 22:34:38,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 59 transitions. 31.57/17.39 [2019-03-28 22:34:38,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 31.57/17.39 [2019-03-28 22:34:38,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 31.57/17.39 [2019-03-28 22:34:38,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 59 transitions. 31.57/17.39 [2019-03-28 22:34:38,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.57/17.39 [2019-03-28 22:34:38,335 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. 31.57/17.39 [2019-03-28 22:34:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 59 transitions. 31.57/17.39 [2019-03-28 22:34:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. 31.57/17.39 [2019-03-28 22:34:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 31.57/17.39 [2019-03-28 22:34:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. 31.57/17.39 [2019-03-28 22:34:38,338 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. 31.57/17.39 [2019-03-28 22:34:38,338 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. 31.57/17.39 [2019-03-28 22:34:38,338 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 31.57/17.39 [2019-03-28 22:34:38,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. 31.57/17.39 [2019-03-28 22:34:38,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 31.57/17.39 [2019-03-28 22:34:38,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.57/17.39 [2019-03-28 22:34:38,339 INFO L119 BuchiIsEmpty]: Starting construction of run 31.57/17.39 [2019-03-28 22:34:38,339 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] 31.57/17.39 [2019-03-28 22:34:38,339 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] 31.57/17.39 [2019-03-28 22:34:38,340 INFO L794 eck$LassoCheckResult]: Stem: 1525#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1518#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1520#L22 [42] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~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_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1538#L22-2 [40] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1539#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1543#L22 31.57/17.39 [2019-03-28 22:34:38,340 INFO L796 eck$LassoCheckResult]: Loop: 1543#L22 [35] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1526#L22-2 [47] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1522#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1524#L22 [42] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~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_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1538#L22-2 [40] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1539#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1543#L22 31.57/17.39 [2019-03-28 22:34:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash 61023811, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:38,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:38,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:38,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:38,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:38,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1933924399, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:38,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:38,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:38,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:38,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:38,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:38,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1060158223, now seen corresponding path program 2 times 31.57/17.39 [2019-03-28 22:34:38,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:38,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:38,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:38,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:38,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:38,449 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:38,450 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:38,450 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:38,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:38,450 INFO L127 ssoRankerPreferences]: Use exernal solver: true 31.57/17.39 [2019-03-28 22:34:38,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:38,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:38,450 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:38,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 31.57/17.39 [2019-03-28 22:34:38,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:38,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:38,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:38,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:38,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:38,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:38,515 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:38,515 INFO L412 LassoAnalysis]: Checking for nontermination... 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:38,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:38,518 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:38,545 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:38,545 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:38,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:38,549 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:38,577 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:38,577 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:38,581 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:38,581 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:38,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:38,612 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:38,930 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 31.57/17.39 [2019-03-28 22:34:38,933 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:38,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:38,934 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:38,934 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:38,934 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.57/17.39 [2019-03-28 22:34:38,934 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:38,934 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:38,934 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:38,934 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 31.57/17.39 [2019-03-28 22:34:38,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:38,935 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:38,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:38,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:38,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:38,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:38,998 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:38,998 INFO L497 LassoAnalysis]: Using template 'affine'. 31.57/17.39 [2019-03-28 22:34:38,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:38,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:38,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:39,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:39,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:39,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:39,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:39,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:39,004 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.57/17.39 [2019-03-28 22:34:39,006 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.57/17.39 [2019-03-28 22:34:39,006 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 31.57/17.39 [2019-03-28 22:34:39,007 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.57/17.39 [2019-03-28 22:34:39,007 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.57/17.39 [2019-03-28 22:34:39,007 INFO L518 LassoAnalysis]: Proved termination. 31.57/17.39 [2019-03-28 22:34:39,007 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.57/17.39 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 31.57/17.39 Supporting invariants [] 31.57/17.39 [2019-03-28 22:34:39,008 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 31.57/17.39 [2019-03-28 22:34:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:39,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:39,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:39,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:39,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:39,070 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.57/17.39 [2019-03-28 22:34:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:39,077 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.57/17.39 [2019-03-28 22:34:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:39,083 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.57/17.39 [2019-03-28 22:34:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:39,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:39,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:39,133 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization 31.57/17.39 [2019-03-28 22:34:39,134 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 7 loop predicates 31.57/17.39 [2019-03-28 22:34:39,134 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 40 transitions. cyclomatic complexity: 15 Second operand 6 states. 31.57/17.39 [2019-03-28 22:34:39,285 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 40 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 91 states and 134 transitions. Complement of second has 23 states. 31.57/17.39 [2019-03-28 22:34:39,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 7 non-accepting loop states 2 accepting loop states 31.57/17.39 [2019-03-28 22:34:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 31.57/17.39 [2019-03-28 22:34:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. 31.57/17.39 [2019-03-28 22:34:39,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 22 transitions. Stem has 5 letters. Loop has 6 letters. 31.57/17.39 [2019-03-28 22:34:39,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:39,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 22 transitions. Stem has 11 letters. Loop has 6 letters. 31.57/17.39 [2019-03-28 22:34:39,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:39,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 22 transitions. Stem has 5 letters. Loop has 12 letters. 31.57/17.39 [2019-03-28 22:34:39,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:39,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 134 transitions. 31.57/17.39 [2019-03-28 22:34:39,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 31.57/17.39 [2019-03-28 22:34:39,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 45 states and 64 transitions. 31.57/17.39 [2019-03-28 22:34:39,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 31.57/17.39 [2019-03-28 22:34:39,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 31.57/17.39 [2019-03-28 22:34:39,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 64 transitions. 31.57/17.39 [2019-03-28 22:34:39,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.57/17.39 [2019-03-28 22:34:39,291 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. 31.57/17.39 [2019-03-28 22:34:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 64 transitions. 31.57/17.39 [2019-03-28 22:34:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. 31.57/17.39 [2019-03-28 22:34:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 31.57/17.39 [2019-03-28 22:34:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. 31.57/17.39 [2019-03-28 22:34:39,294 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. 31.57/17.39 [2019-03-28 22:34:39,294 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. 31.57/17.39 [2019-03-28 22:34:39,294 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 31.57/17.39 [2019-03-28 22:34:39,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. 31.57/17.39 [2019-03-28 22:34:39,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 31.57/17.39 [2019-03-28 22:34:39,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.57/17.39 [2019-03-28 22:34:39,295 INFO L119 BuchiIsEmpty]: Starting construction of run 31.57/17.39 [2019-03-28 22:34:39,295 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 31.57/17.39 [2019-03-28 22:34:39,295 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 31.57/17.39 [2019-03-28 22:34:39,296 INFO L794 eck$LassoCheckResult]: Stem: 1748#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_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~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1749#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1762#L22 [35] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1760#L22-2 [46] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1759#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1756#L22 [42] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~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_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1754#L22-2 31.57/17.39 [2019-03-28 22:34:39,296 INFO L796 eck$LassoCheckResult]: Loop: 1754#L22-2 [40] L22-2-->L27-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1744#L27-1 [32] L27-1-->L22: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1745#L22 [35] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1754#L22-2 31.57/17.39 [2019-03-28 22:34:39,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:39,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1891535412, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:39,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:39,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:39,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:39,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:39,305 INFO L82 PathProgramCache]: Analyzing trace with hash 69258, now seen corresponding path program 3 times 31.57/17.39 [2019-03-28 22:34:39,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:39,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:39,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:39,311 INFO L82 PathProgramCache]: Analyzing trace with hash 760574839, now seen corresponding path program 1 times 31.57/17.39 [2019-03-28 22:34:39,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.57/17.39 [2019-03-28 22:34:39,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.57/17.39 [2019-03-28 22:34:39,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:39,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:39,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.57/17.39 [2019-03-28 22:34:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.57/17.39 [2019-03-28 22:34:39,365 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:39,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:39,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:39,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:39,365 INFO L127 ssoRankerPreferences]: Use exernal solver: true 31.57/17.39 [2019-03-28 22:34:39,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:39,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:39,366 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:39,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 31.57/17.39 [2019-03-28 22:34:39,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:39,366 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:39,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:39,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:39,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:39,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:39,440 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:39,440 INFO L412 LassoAnalysis]: Checking for nontermination... 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:39,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:39,446 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:39,473 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:39,473 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:39,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:39,479 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:39,506 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:39,506 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:39,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:39,513 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:39,516 INFO L445 LassoAnalysis]: Proved nontermination for one component. 31.57/17.39 [2019-03-28 22:34:39,517 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:39,543 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:39,544 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.57/17.39 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 31.57/17.39 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:39,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 31.57/17.39 [2019-03-28 22:34:39,576 INFO L163 nArgumentSynthesizer]: Using integer mode. 31.57/17.39 [2019-03-28 22:34:44,442 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 31.57/17.39 [2019-03-28 22:34:44,445 INFO L216 LassoAnalysis]: Preferences: 31.57/17.39 [2019-03-28 22:34:44,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.57/17.39 [2019-03-28 22:34:44,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.57/17.39 [2019-03-28 22:34:44,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.57/17.39 [2019-03-28 22:34:44,445 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.57/17.39 [2019-03-28 22:34:44,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.57/17.39 [2019-03-28 22:34:44,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.57/17.39 [2019-03-28 22:34:44,445 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.57/17.39 [2019-03-28 22:34:44,446 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 31.57/17.39 [2019-03-28 22:34:44,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.57/17.39 [2019-03-28 22:34:44,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.57/17.39 [2019-03-28 22:34:44,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:44,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:44,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:44,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.57/17.39 [2019-03-28 22:34:44,510 INFO L300 LassoAnalysis]: Preprocessing complete. 31.57/17.39 [2019-03-28 22:34:44,510 INFO L497 LassoAnalysis]: Using template 'affine'. 31.57/17.39 [2019-03-28 22:34:44,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:44,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:44,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:44,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:44,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:44,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:44,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:44,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:44,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:44,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:44,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:44,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:44,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:44,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:44,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:44,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:44,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:44,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:44,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:44,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:44,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:44,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:44,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:44,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:44,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.57/17.39 [2019-03-28 22:34:44,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.57/17.39 Termination analysis: LINEAR_WITH_GUESSES 31.57/17.39 Number of strict supporting invariants: 0 31.57/17.39 Number of non-strict supporting invariants: 1 31.57/17.39 Consider only non-deceasing supporting invariants: true 31.57/17.39 Simplify termination arguments: true 31.57/17.39 Simplify supporting invariants: trueOverapproximate stem: false 31.57/17.39 [2019-03-28 22:34:44,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.57/17.39 [2019-03-28 22:34:44,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.57/17.39 [2019-03-28 22:34:44,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.57/17.39 [2019-03-28 22:34:44,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.57/17.39 [2019-03-28 22:34:44,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.57/17.39 [2019-03-28 22:34:44,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.57/17.39 [2019-03-28 22:34:44,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.57/17.39 [2019-03-28 22:34:44,540 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.57/17.39 [2019-03-28 22:34:44,542 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.57/17.39 [2019-03-28 22:34:44,543 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 31.57/17.39 [2019-03-28 22:34:44,543 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.57/17.39 [2019-03-28 22:34:44,543 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.57/17.39 [2019-03-28 22:34:44,543 INFO L518 LassoAnalysis]: Proved termination. 31.57/17.39 [2019-03-28 22:34:44,543 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.57/17.39 Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 31.57/17.39 Supporting invariants [] 31.57/17.39 [2019-03-28 22:34:44,544 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 31.57/17.39 [2019-03-28 22:34:44,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.57/17.39 [2019-03-28 22:34:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:44,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:44,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.57/17.39 [2019-03-28 22:34:44,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core 31.57/17.39 [2019-03-28 22:34:44,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.57/17.39 [2019-03-28 22:34:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.57/17.39 [2019-03-28 22:34:44,598 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 31.57/17.39 [2019-03-28 22:34:44,598 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 31.57/17.39 [2019-03-28 22:34:44,598 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 42 transitions. cyclomatic complexity: 16 Second operand 4 states. 31.57/17.39 [2019-03-28 22:34:44,649 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 42 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 52 states and 75 transitions. Complement of second has 7 states. 31.57/17.39 [2019-03-28 22:34:44,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 31.57/17.39 [2019-03-28 22:34:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 31.57/17.39 [2019-03-28 22:34:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. 31.57/17.39 [2019-03-28 22:34:44,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:44,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:44,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. 31.57/17.39 [2019-03-28 22:34:44,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:44,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. 31.57/17.39 [2019-03-28 22:34:44,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.57/17.39 [2019-03-28 22:34:44,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 75 transitions. 31.57/17.39 [2019-03-28 22:34:44,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 31.57/17.39 [2019-03-28 22:34:44,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. 31.57/17.39 [2019-03-28 22:34:44,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 31.57/17.39 [2019-03-28 22:34:44,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 31.57/17.39 [2019-03-28 22:34:44,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 31.57/17.39 [2019-03-28 22:34:44,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 31.57/17.39 [2019-03-28 22:34:44,654 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.57/17.39 [2019-03-28 22:34:44,654 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.57/17.39 [2019-03-28 22:34:44,654 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.57/17.39 [2019-03-28 22:34:44,654 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 31.57/17.39 [2019-03-28 22:34:44,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 31.57/17.39 [2019-03-28 22:34:44,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 31.57/17.39 [2019-03-28 22:34:44,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 31.57/17.39 [2019-03-28 22:34:44,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:34:44 BasicIcfg 31.57/17.39 [2019-03-28 22:34:44,661 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 31.57/17.39 [2019-03-28 22:34:44,662 INFO L168 Benchmark]: Toolchain (without parser) took 13000.52 ms. Allocated memory was 649.6 MB in the beginning and 849.3 MB in the end (delta: 199.8 MB). Free memory was 563.9 MB in the beginning and 790.9 MB in the end (delta: -227.0 MB). There was no memory consumed. Max. memory is 50.3 GB. 31.57/17.39 [2019-03-28 22:34:44,663 INFO L168 Benchmark]: CDTParser took 0.16 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. 31.57/17.39 [2019-03-28 22:34:44,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.90 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 563.9 MB in the beginning and 646.0 MB in the end (delta: -82.1 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 31.57/17.39 [2019-03-28 22:34:44,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.27 ms. Allocated memory is still 678.4 MB. Free memory was 646.0 MB in the beginning and 642.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 31.57/17.39 [2019-03-28 22:34:44,665 INFO L168 Benchmark]: Boogie Preprocessor took 20.89 ms. Allocated memory is still 678.4 MB. Free memory was 642.9 MB in the beginning and 641.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 31.57/17.39 [2019-03-28 22:34:44,665 INFO L168 Benchmark]: RCFGBuilder took 214.08 ms. Allocated memory is still 678.4 MB. Free memory was 641.5 MB in the beginning and 627.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. 31.57/17.39 [2019-03-28 22:34:44,666 INFO L168 Benchmark]: BlockEncodingV2 took 92.53 ms. Allocated memory is still 678.4 MB. Free memory was 627.5 MB in the beginning and 622.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 31.57/17.39 [2019-03-28 22:34:44,666 INFO L168 Benchmark]: TraceAbstraction took 154.47 ms. Allocated memory is still 678.4 MB. Free memory was 622.1 MB in the beginning and 612.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 31.57/17.39 [2019-03-28 22:34:44,667 INFO L168 Benchmark]: BuchiAutomizer took 12183.15 ms. Allocated memory was 678.4 MB in the beginning and 849.3 MB in the end (delta: 170.9 MB). Free memory was 612.7 MB in the beginning and 790.9 MB in the end (delta: -178.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 31.57/17.39 [2019-03-28 22:34:44,671 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 31.57/17.39 --- Results --- 31.57/17.39 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 31.57/17.39 - StatisticsResult: Initial Icfg 31.57/17.39 8 locations, 11 edges 31.57/17.39 - StatisticsResult: Encoded RCFG 31.57/17.39 4 locations, 7 edges 31.57/17.39 * Results from de.uni_freiburg.informatik.ultimate.core: 31.57/17.39 - StatisticsResult: Toolchain Benchmarks 31.57/17.39 Benchmark results are: 31.57/17.39 * CDTParser took 0.16 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. 31.57/17.39 * CACSL2BoogieTranslator took 292.90 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 563.9 MB in the beginning and 646.0 MB in the end (delta: -82.1 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 31.57/17.39 * Boogie Procedure Inliner took 37.27 ms. Allocated memory is still 678.4 MB. Free memory was 646.0 MB in the beginning and 642.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 31.57/17.39 * Boogie Preprocessor took 20.89 ms. Allocated memory is still 678.4 MB. Free memory was 642.9 MB in the beginning and 641.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 31.57/17.39 * RCFGBuilder took 214.08 ms. Allocated memory is still 678.4 MB. Free memory was 641.5 MB in the beginning and 627.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. 31.57/17.39 * BlockEncodingV2 took 92.53 ms. Allocated memory is still 678.4 MB. Free memory was 627.5 MB in the beginning and 622.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 31.57/17.39 * TraceAbstraction took 154.47 ms. Allocated memory is still 678.4 MB. Free memory was 622.1 MB in the beginning and 612.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 31.57/17.39 * BuchiAutomizer took 12183.15 ms. Allocated memory was 678.4 MB in the beginning and 849.3 MB in the end (delta: 170.9 MB). Free memory was 612.7 MB in the beginning and 790.9 MB in the end (delta: -178.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 31.57/17.39 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 31.57/17.39 - AllSpecificationsHoldResult: All specifications hold 31.57/17.39 We were not able to verify any specifiation because the program does not contain any specification. 31.57/17.39 - InvariantResult [Line: 21]: Loop Invariant 31.57/17.39 Derived loop invariant: 1 31.57/17.39 - StatisticsResult: Ultimate Automizer benchmark data 31.57/17.39 CFG has 1 procedures, 4 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=4occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 31.57/17.39 - StatisticsResult: Constructed decomposition of program 31.57/17.39 Your program was decomposed into 9 terminating modules (2 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 21 locations. One nondeterministic module has affine ranking function y and consists of 10 locations. One nondeterministic module has affine ranking function z and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. 31.57/17.39 - StatisticsResult: Timing statistics 31.57/17.39 BüchiAutomizer plugin needed 12.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 9.4s. Construction of modules took 0.4s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 139 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 6. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/6 HoareTripleCheckerStatistics: 36 SDtfs, 146 SDslu, 4 SDs, 0 SdLazy, 553 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax144 hnf100 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq178 hnf92 smp100 dnf100 smp100 tf105 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 6.8s 31.57/17.39 - TerminationAnalysisResult: Termination proven 31.57/17.39 Buchi Automizer proved that your program is terminating 31.57/17.39 RESULT: Ultimate proved your program to be correct! 31.57/17.39 !SESSION 2019-03-28 22:34:28.382 ----------------------------------------------- 31.57/17.39 eclipse.buildId=unknown 31.57/17.39 java.version=1.8.0_181 31.57/17.39 java.vendor=Oracle Corporation 31.57/17.39 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 31.57/17.39 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 31.57/17.39 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 31.57/17.39 31.57/17.39 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:34:44.903 31.57/17.39 !MESSAGE The workspace will exit with unsaved changes in this session. 31.57/17.39 Received shutdown request... 31.57/17.39 Ultimate: 31.57/17.39 GTK+ Version Check 31.57/17.39 EOF