19.24/8.98 YES 19.24/8.98 19.24/8.98 Ultimate: Cannot open display: 19.24/8.98 This is Ultimate 0.1.24-8dc7c08-m 19.24/8.98 [2019-03-28 22:39:44,642 INFO L170 SettingsManager]: Resetting all preferences to default values... 19.24/8.98 [2019-03-28 22:39:44,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 19.24/8.98 [2019-03-28 22:39:44,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 19.24/8.98 [2019-03-28 22:39:44,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 19.24/8.98 [2019-03-28 22:39:44,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 19.24/8.98 [2019-03-28 22:39:44,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 19.24/8.98 [2019-03-28 22:39:44,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 19.24/8.98 [2019-03-28 22:39:44,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 19.24/8.98 [2019-03-28 22:39:44,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 19.24/8.98 [2019-03-28 22:39:44,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 19.24/8.98 [2019-03-28 22:39:44,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 19.24/8.98 [2019-03-28 22:39:44,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 19.24/8.98 [2019-03-28 22:39:44,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 19.24/8.98 [2019-03-28 22:39:44,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 19.24/8.98 [2019-03-28 22:39:44,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 19.24/8.98 [2019-03-28 22:39:44,667 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 19.24/8.98 [2019-03-28 22:39:44,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 19.24/8.98 [2019-03-28 22:39:44,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 19.24/8.98 [2019-03-28 22:39:44,672 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 19.24/8.98 [2019-03-28 22:39:44,673 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 19.24/8.98 [2019-03-28 22:39:44,675 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 19.24/8.98 [2019-03-28 22:39:44,678 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 19.24/8.98 [2019-03-28 22:39:44,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 19.24/8.98 [2019-03-28 22:39:44,678 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 19.24/8.98 [2019-03-28 22:39:44,679 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 19.24/8.98 [2019-03-28 22:39:44,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 19.24/8.98 [2019-03-28 22:39:44,680 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 19.24/8.98 [2019-03-28 22:39:44,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 19.24/8.98 [2019-03-28 22:39:44,681 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 19.24/8.98 [2019-03-28 22:39:44,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 19.24/8.98 [2019-03-28 22:39:44,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 19.24/8.98 [2019-03-28 22:39:44,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 19.24/8.98 [2019-03-28 22:39:44,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 19.24/8.98 [2019-03-28 22:39:44,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 19.24/8.98 [2019-03-28 22:39:44,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 19.24/8.98 [2019-03-28 22:39:44,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 19.24/8.98 [2019-03-28 22:39:44,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 19.24/8.98 [2019-03-28 22:39:44,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 19.24/8.98 [2019-03-28 22:39:44,687 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 19.24/8.98 [2019-03-28 22:39:44,702 INFO L110 SettingsManager]: Loading preferences was successful 19.24/8.98 [2019-03-28 22:39:44,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 19.24/8.98 [2019-03-28 22:39:44,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 19.24/8.98 [2019-03-28 22:39:44,703 INFO L133 SettingsManager]: * Rewrite not-equals=true 19.24/8.98 [2019-03-28 22:39:44,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 19.24/8.98 [2019-03-28 22:39:44,703 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 19.24/8.98 [2019-03-28 22:39:44,703 INFO L133 SettingsManager]: * Use SBE=true 19.24/8.98 [2019-03-28 22:39:44,704 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 19.24/8.98 [2019-03-28 22:39:44,704 INFO L133 SettingsManager]: * Use old map elimination=false 19.24/8.98 [2019-03-28 22:39:44,704 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 19.24/8.98 [2019-03-28 22:39:44,704 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 19.24/8.98 [2019-03-28 22:39:44,704 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 19.24/8.98 [2019-03-28 22:39:44,705 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 19.24/8.98 [2019-03-28 22:39:44,705 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 19.24/8.98 [2019-03-28 22:39:44,705 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.24/8.98 [2019-03-28 22:39:44,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 19.24/8.98 [2019-03-28 22:39:44,705 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 19.24/8.98 [2019-03-28 22:39:44,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE 19.24/8.98 [2019-03-28 22:39:44,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 19.24/8.98 [2019-03-28 22:39:44,706 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 19.24/8.98 [2019-03-28 22:39:44,706 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 19.24/8.98 [2019-03-28 22:39:44,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 19.24/8.98 [2019-03-28 22:39:44,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 19.24/8.98 [2019-03-28 22:39:44,706 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 19.24/8.98 [2019-03-28 22:39:44,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.24/8.98 [2019-03-28 22:39:44,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 19.24/8.98 [2019-03-28 22:39:44,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 19.24/8.98 [2019-03-28 22:39:44,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 19.24/8.98 [2019-03-28 22:39:44,707 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 19.24/8.98 [2019-03-28 22:39:44,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 19.24/8.98 [2019-03-28 22:39:44,747 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 19.24/8.98 [2019-03-28 22:39:44,750 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 19.24/8.98 [2019-03-28 22:39:44,752 INFO L271 PluginConnector]: Initializing CDTParser... 19.24/8.98 [2019-03-28 22:39:44,752 INFO L276 PluginConnector]: CDTParser initialized 19.24/8.98 [2019-03-28 22:39:44,753 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 19.24/8.98 [2019-03-28 22:39:44,822 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/39afe3a9e59746a982beff685139a5ff/FLAG951e58b75 19.24/8.98 [2019-03-28 22:39:45,164 INFO L307 CDTParser]: Found 1 translation units. 19.24/8.98 [2019-03-28 22:39:45,165 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 19.24/8.98 [2019-03-28 22:39:45,172 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/39afe3a9e59746a982beff685139a5ff/FLAG951e58b75 19.24/8.98 [2019-03-28 22:39:45,565 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/39afe3a9e59746a982beff685139a5ff 19.24/8.98 [2019-03-28 22:39:45,577 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 19.24/8.98 [2019-03-28 22:39:45,579 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 19.24/8.98 [2019-03-28 22:39:45,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 19.24/8.98 [2019-03-28 22:39:45,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 19.24/8.98 [2019-03-28 22:39:45,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 19.24/8.98 [2019-03-28 22:39:45,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481d3704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45, skipping insertion in model container 19.24/8.98 [2019-03-28 22:39:45,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 19.24/8.98 [2019-03-28 22:39:45,613 INFO L176 MainTranslator]: Built tables and reachable declarations 19.24/8.98 [2019-03-28 22:39:45,772 INFO L206 PostProcessor]: Analyzing one entry point: main 19.24/8.98 [2019-03-28 22:39:45,777 INFO L191 MainTranslator]: Completed pre-run 19.24/8.98 [2019-03-28 22:39:45,795 INFO L206 PostProcessor]: Analyzing one entry point: main 19.24/8.98 [2019-03-28 22:39:45,810 INFO L195 MainTranslator]: Completed translation 19.24/8.98 [2019-03-28 22:39:45,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45 WrapperNode 19.24/8.98 [2019-03-28 22:39:45,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 19.24/8.98 [2019-03-28 22:39:45,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 19.24/8.98 [2019-03-28 22:39:45,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 19.24/8.98 [2019-03-28 22:39:45,812 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 19.24/8.98 [2019-03-28 22:39:45,882 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:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,889 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:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 19.24/8.98 [2019-03-28 22:39:45,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 19.24/8.98 [2019-03-28 22:39:45,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 19.24/8.98 [2019-03-28 22:39:45,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized 19.24/8.98 [2019-03-28 22:39:45,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (1/1) ... 19.24/8.98 [2019-03-28 22:39:45,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 19.24/8.98 [2019-03-28 22:39:45,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 19.24/8.98 [2019-03-28 22:39:45,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... 19.24/8.98 [2019-03-28 22:39:45,934 INFO L276 PluginConnector]: RCFGBuilder initialized 19.24/8.98 [2019-03-28 22:39:45,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (1/1) ... 19.24/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.24/8.98 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 19.24/8.98 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.24/8.98 [2019-03-28 22:39:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 19.24/8.98 [2019-03-28 22:39:46,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 19.24/8.98 [2019-03-28 22:39:46,149 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 19.24/8.98 [2019-03-28 22:39:46,149 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 19.24/8.98 [2019-03-28 22:39:46,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:39:46 BoogieIcfgContainer 19.24/8.98 [2019-03-28 22:39:46,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 19.24/8.98 [2019-03-28 22:39:46,151 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 19.24/8.98 [2019-03-28 22:39:46,151 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 19.24/8.98 [2019-03-28 22:39:46,154 INFO L276 PluginConnector]: BlockEncodingV2 initialized 19.24/8.98 [2019-03-28 22:39:46,155 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:39:46" (1/1) ... 19.24/8.98 [2019-03-28 22:39:46,171 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges 19.24/8.98 [2019-03-28 22:39:46,173 INFO L258 BlockEncoder]: Using Remove infeasible edges 19.24/8.98 [2019-03-28 22:39:46,173 INFO L263 BlockEncoder]: Using Maximize final states 19.24/8.98 [2019-03-28 22:39:46,174 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 19.24/8.98 [2019-03-28 22:39:46,174 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 19.24/8.98 [2019-03-28 22:39:46,176 INFO L296 BlockEncoder]: Using Remove sink states 19.24/8.98 [2019-03-28 22:39:46,177 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 19.24/8.98 [2019-03-28 22:39:46,177 INFO L179 BlockEncoder]: Using Rewrite not-equals 19.24/8.98 [2019-03-28 22:39:46,196 INFO L185 BlockEncoder]: Using Use SBE 19.24/8.98 [2019-03-28 22:39:46,214 INFO L200 BlockEncoder]: SBE split 4 edges 19.24/8.98 [2019-03-28 22:39:46,219 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 19.24/8.98 [2019-03-28 22:39:46,221 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.24/8.98 [2019-03-28 22:39:46,233 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 19.24/8.98 [2019-03-28 22:39:46,235 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 19.24/8.98 [2019-03-28 22:39:46,237 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.24/8.98 [2019-03-28 22:39:46,237 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.24/8.98 [2019-03-28 22:39:46,237 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 19.24/8.98 [2019-03-28 22:39:46,238 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.24/8.98 [2019-03-28 22:39:46,238 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges 19.24/8.98 [2019-03-28 22:39:46,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:39:46 BasicIcfg 19.24/8.98 [2019-03-28 22:39:46,239 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 19.24/8.98 [2019-03-28 22:39:46,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 19.24/8.98 [2019-03-28 22:39:46,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... 19.24/8.98 [2019-03-28 22:39:46,243 INFO L276 PluginConnector]: TraceAbstraction initialized 19.24/8.98 [2019-03-28 22:39:46,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:39:45" (1/4) ... 19.24/8.98 [2019-03-28 22:39:46,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a872f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:39:46, skipping insertion in model container 19.24/8.98 [2019-03-28 22:39:46,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (2/4) ... 19.24/8.98 [2019-03-28 22:39:46,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a872f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:39:46, skipping insertion in model container 19.24/8.98 [2019-03-28 22:39:46,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:39:46" (3/4) ... 19.24/8.98 [2019-03-28 22:39:46,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a872f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:39:46, skipping insertion in model container 19.24/8.98 [2019-03-28 22:39:46,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:39:46" (4/4) ... 19.24/8.98 [2019-03-28 22:39:46,247 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.24/8.98 [2019-03-28 22:39:46,258 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 19.24/8.98 [2019-03-28 22:39:46,267 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 19.24/8.98 [2019-03-28 22:39:46,285 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 19.24/8.98 [2019-03-28 22:39:46,315 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.24/8.98 [2019-03-28 22:39:46,316 INFO L382 AbstractCegarLoop]: Interprodecural is true 19.24/8.98 [2019-03-28 22:39:46,316 INFO L383 AbstractCegarLoop]: Hoare is true 19.24/8.98 [2019-03-28 22:39:46,317 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 19.24/8.98 [2019-03-28 22:39:46,317 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 19.24/8.98 [2019-03-28 22:39:46,317 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.24/8.98 [2019-03-28 22:39:46,317 INFO L387 AbstractCegarLoop]: Difference is false 19.24/8.98 [2019-03-28 22:39:46,317 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 19.24/8.98 [2019-03-28 22:39:46,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 19.24/8.98 [2019-03-28 22:39:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. 19.24/8.98 [2019-03-28 22:39:46,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 19.24/8.98 [2019-03-28 22:39:46,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. 19.24/8.98 [2019-03-28 22:39:46,395 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 19.24/8.98 [2019-03-28 22:39:46,395 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 32) no Hoare annotation was computed. 19.24/8.98 [2019-03-28 22:39:46,396 INFO L451 ceAbstractionStarter]: At program point L27-2(lines 18 34) the Hoare annotation is: true 19.24/8.98 [2019-03-28 22:39:46,396 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 25) no Hoare annotation was computed. 19.24/8.98 [2019-03-28 22:39:46,396 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 33) no Hoare annotation was computed. 19.24/8.98 [2019-03-28 22:39:46,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:39:46 BasicIcfg 19.24/8.98 [2019-03-28 22:39:46,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 19.24/8.98 [2019-03-28 22:39:46,405 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 19.24/8.98 [2019-03-28 22:39:46,406 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 19.24/8.98 [2019-03-28 22:39:46,409 INFO L276 PluginConnector]: BuchiAutomizer initialized 19.24/8.98 [2019-03-28 22:39:46,410 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.24/8.98 [2019-03-28 22:39:46,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:39:45" (1/5) ... 19.24/8.98 [2019-03-28 22:39:46,411 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46539d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:39:46, skipping insertion in model container 19.24/8.98 [2019-03-28 22:39:46,411 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.24/8.98 [2019-03-28 22:39:46,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:39:45" (2/5) ... 19.24/8.98 [2019-03-28 22:39:46,412 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46539d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:39:46, skipping insertion in model container 19.24/8.98 [2019-03-28 22:39:46,412 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.24/8.98 [2019-03-28 22:39:46,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:39:46" (3/5) ... 19.24/8.98 [2019-03-28 22:39:46,412 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46539d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:39:46, skipping insertion in model container 19.24/8.98 [2019-03-28 22:39:46,412 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.24/8.98 [2019-03-28 22:39:46,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:39:46" (4/5) ... 19.24/8.98 [2019-03-28 22:39:46,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46539d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:39:46, skipping insertion in model container 19.24/8.98 [2019-03-28 22:39:46,413 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.24/8.98 [2019-03-28 22:39:46,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:39:46" (5/5) ... 19.24/8.98 [2019-03-28 22:39:46,415 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.24/8.98 [2019-03-28 22:39:46,442 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.24/8.98 [2019-03-28 22:39:46,443 INFO L374 BuchiCegarLoop]: Interprodecural is true 19.24/8.98 [2019-03-28 22:39:46,443 INFO L375 BuchiCegarLoop]: Hoare is true 19.24/8.98 [2019-03-28 22:39:46,443 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 19.24/8.98 [2019-03-28 22:39:46,443 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 19.24/8.98 [2019-03-28 22:39:46,443 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.24/8.98 [2019-03-28 22:39:46,443 INFO L379 BuchiCegarLoop]: Difference is false 19.24/8.98 [2019-03-28 22:39:46,443 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 19.24/8.98 [2019-03-28 22:39:46,444 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 19.24/8.98 [2019-03-28 22:39:46,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 19.24/8.98 [2019-03-28 22:39:46,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 19.24/8.98 [2019-03-28 22:39:46,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.24/8.98 [2019-03-28 22:39:46,466 INFO L119 BuchiIsEmpty]: Starting construction of run 19.24/8.98 [2019-03-28 22:39:46,473 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 19.24/8.98 [2019-03-28 22:39:46,473 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.24/8.98 [2019-03-28 22:39:46,473 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 19.24/8.98 [2019-03-28 22:39:46,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 19.24/8.98 [2019-03-28 22:39:46,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 19.24/8.98 [2019-03-28 22:39:46,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.24/8.98 [2019-03-28 22:39:46,474 INFO L119 BuchiIsEmpty]: Starting construction of run 19.24/8.98 [2019-03-28 22:39:46,474 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 19.24/8.98 [2019-03-28 22:39:46,475 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.24/8.98 [2019-03-28 22:39:46,480 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [35] ULTIMATE.startENTRY-->L27-2: 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 6#L27-2true 19.24/8.98 [2019-03-28 22:39:46,480 INFO L796 eck$LassoCheckResult]: Loop: 6#L27-2true [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 5#L19true [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 4#L27true [38] L27-->L27-2: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~x~0_14 |v_ULTIMATE.start_main_#t~nondet5_3|) (= v_ULTIMATE.start_main_~y~0_11 (+ v_ULTIMATE.start_main_~y~0_12 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 6#L27-2true 19.24/8.98 [2019-03-28 22:39:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.24/8.98 [2019-03-28 22:39:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash 66, now seen corresponding path program 1 times 19.24/8.98 [2019-03-28 22:39:46,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.24/8.98 [2019-03-28 22:39:46,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.24/8.98 [2019-03-28 22:39:46,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.24/8.98 [2019-03-28 22:39:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash 84234, now seen corresponding path program 1 times 19.24/8.98 [2019-03-28 22:39:46,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.24/8.98 [2019-03-28 22:39:46,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.24/8.98 [2019-03-28 22:39:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.24/8.98 [2019-03-28 22:39:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.24/8.98 [2019-03-28 22:39:46,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.24/8.98 [2019-03-28 22:39:46,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.24/8.98 [2019-03-28 22:39:46,608 INFO L811 eck$LassoCheckResult]: loop already infeasible 19.24/8.98 [2019-03-28 22:39:46,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.24/8.98 [2019-03-28 22:39:46,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.24/8.98 [2019-03-28 22:39:46,625 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. 19.24/8.98 [2019-03-28 22:39:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.24/8.98 [2019-03-28 22:39:46,674 INFO L93 Difference]: Finished difference Result 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.24/8.98 [2019-03-28 22:39:46,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 19.24/8.98 [2019-03-28 22:39:46,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 19.24/8.98 [2019-03-28 22:39:46,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 19.24/8.98 [2019-03-28 22:39:46,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.24/8.98 [2019-03-28 22:39:46,686 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. 19.24/8.98 [2019-03-28 22:39:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 19.24/8.98 [2019-03-28 22:39:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,715 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,716 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,716 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 19.24/8.98 [2019-03-28 22:39:46,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 13 transitions. 19.24/8.98 [2019-03-28 22:39:46,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 19.24/8.98 [2019-03-28 22:39:46,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.24/8.98 [2019-03-28 22:39:46,717 INFO L119 BuchiIsEmpty]: Starting construction of run 19.24/8.98 [2019-03-28 22:39:46,717 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 19.24/8.98 [2019-03-28 22:39:46,717 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.24/8.98 [2019-03-28 22:39:46,718 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 22#L27-2 19.24/8.98 [2019-03-28 22:39:46,718 INFO L796 eck$LassoCheckResult]: Loop: 22#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 24#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 25#L20 [57] L20-->L27-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~y~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 22#L27-2 19.24/8.98 [2019-03-28 22:39:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.24/8.98 [2019-03-28 22:39:46,718 INFO L82 PathProgramCache]: Analyzing trace with hash 66, now seen corresponding path program 2 times 19.24/8.98 [2019-03-28 22:39:46,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.24/8.98 [2019-03-28 22:39:46,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.24/8.98 [2019-03-28 22:39:46,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.24/8.98 [2019-03-28 22:39:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash 83912, now seen corresponding path program 1 times 19.24/8.98 [2019-03-28 22:39:46,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.24/8.98 [2019-03-28 22:39:46,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.24/8.98 [2019-03-28 22:39:46,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:46,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.24/8.98 [2019-03-28 22:39:46,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2020327, now seen corresponding path program 1 times 19.24/8.98 [2019-03-28 22:39:46,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.24/8.98 [2019-03-28 22:39:46,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.24/8.98 [2019-03-28 22:39:46,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:46,794 INFO L216 LassoAnalysis]: Preferences: 19.24/8.98 [2019-03-28 22:39:46,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.24/8.98 [2019-03-28 22:39:46,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.24/8.98 [2019-03-28 22:39:46,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.24/8.98 [2019-03-28 22:39:46,795 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.24/8.98 [2019-03-28 22:39:46,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.24/8.98 [2019-03-28 22:39:46,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.24/8.98 [2019-03-28 22:39:46,796 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.24/8.98 [2019-03-28 22:39:46,796 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 19.24/8.98 [2019-03-28 22:39:46,796 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.24/8.98 [2019-03-28 22:39:46,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.24/8.98 [2019-03-28 22:39:46,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:46,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:46,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:46,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:46,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:46,955 INFO L300 LassoAnalysis]: Preprocessing complete. 19.24/8.98 [2019-03-28 22:39:46,956 INFO L412 LassoAnalysis]: Checking for nontermination... 19.24/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.24/8.98 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.24/8.98 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.24/8.98 [2019-03-28 22:39:46,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.24/8.98 [2019-03-28 22:39:46,964 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.24/8.98 [2019-03-28 22:39:46,998 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.24/8.98 [2019-03-28 22:39:46,998 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: [] 19.24/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.24/8.98 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.24/8.98 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.24/8.98 [2019-03-28 22:39:47,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.24/8.98 [2019-03-28 22:39:47,005 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.24/8.98 [2019-03-28 22:39:47,032 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.24/8.98 [2019-03-28 22:39:47,033 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: [] 19.24/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.24/8.98 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.24/8.98 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.24/8.98 [2019-03-28 22:39:47,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.24/8.98 [2019-03-28 22:39:47,037 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.24/8.98 [2019-03-28 22:39:47,044 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.24/8.98 [2019-03-28 22:39:47,044 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=4, ULTIMATE.start_main_#t~nondet3=4} Honda state: {ULTIMATE.start_main_~y~0=4, ULTIMATE.start_main_#t~nondet3=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.24/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.24/8.98 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.24/8.98 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.24/8.98 [2019-03-28 22:39:47,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.24/8.98 [2019-03-28 22:39:47,071 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.24/8.98 [2019-03-28 22:39:47,099 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.24/8.98 [2019-03-28 22:39:47,099 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: [] 19.24/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.24/8.98 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.24/8.98 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.24/8.98 [2019-03-28 22:39:47,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.24/8.98 [2019-03-28 22:39:47,104 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.24/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.24/8.98 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.24/8.98 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.24/8.98 [2019-03-28 22:39:47,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.24/8.98 [2019-03-28 22:39:47,134 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.24/8.98 [2019-03-28 22:39:47,165 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.24/8.98 [2019-03-28 22:39:47,168 INFO L216 LassoAnalysis]: Preferences: 19.24/8.98 [2019-03-28 22:39:47,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.24/8.98 [2019-03-28 22:39:47,168 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.24/8.98 [2019-03-28 22:39:47,168 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.24/8.98 [2019-03-28 22:39:47,168 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.24/8.98 [2019-03-28 22:39:47,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.24/8.98 [2019-03-28 22:39:47,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.24/8.98 [2019-03-28 22:39:47,169 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.24/8.98 [2019-03-28 22:39:47,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 19.24/8.98 [2019-03-28 22:39:47,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.24/8.98 [2019-03-28 22:39:47,169 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.24/8.98 [2019-03-28 22:39:47,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:47,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:47,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:47,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:47,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.24/8.98 [2019-03-28 22:39:47,270 INFO L300 LassoAnalysis]: Preprocessing complete. 19.24/8.98 [2019-03-28 22:39:47,276 INFO L497 LassoAnalysis]: Using template 'affine'. 19.24/8.98 [2019-03-28 22:39:47,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.24/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.24/8.98 Number of strict supporting invariants: 0 19.24/8.98 Number of non-strict supporting invariants: 1 19.24/8.98 Consider only non-deceasing supporting invariants: true 19.24/8.98 Simplify termination arguments: true 19.24/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.24/8.98 [2019-03-28 22:39:47,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.24/8.98 [2019-03-28 22:39:47,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.24/8.98 [2019-03-28 22:39:47,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.24/8.98 [2019-03-28 22:39:47,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.24/8.98 [2019-03-28 22:39:47,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.24/8.98 [2019-03-28 22:39:47,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.24/8.98 [2019-03-28 22:39:47,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.24/8.98 [2019-03-28 22:39:47,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.24/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.24/8.98 Number of strict supporting invariants: 0 19.24/8.98 Number of non-strict supporting invariants: 1 19.24/8.98 Consider only non-deceasing supporting invariants: true 19.24/8.98 Simplify termination arguments: true 19.24/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.24/8.98 [2019-03-28 22:39:47,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.24/8.98 [2019-03-28 22:39:47,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.24/8.98 [2019-03-28 22:39:47,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.24/8.98 [2019-03-28 22:39:47,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.24/8.98 [2019-03-28 22:39:47,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.24/8.98 [2019-03-28 22:39:47,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.24/8.98 [2019-03-28 22:39:47,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.24/8.98 [2019-03-28 22:39:47,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.24/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.24/8.98 Number of strict supporting invariants: 0 19.24/8.98 Number of non-strict supporting invariants: 1 19.24/8.98 Consider only non-deceasing supporting invariants: true 19.24/8.98 Simplify termination arguments: true 19.24/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.24/8.98 [2019-03-28 22:39:47,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.24/8.98 [2019-03-28 22:39:47,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.24/8.98 [2019-03-28 22:39:47,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.24/8.98 [2019-03-28 22:39:47,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.24/8.98 [2019-03-28 22:39:47,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.24/8.98 [2019-03-28 22:39:47,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.24/8.98 [2019-03-28 22:39:47,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.24/8.98 [2019-03-28 22:39:47,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.24/8.98 [2019-03-28 22:39:47,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.24/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.24/8.98 Number of strict supporting invariants: 0 19.24/8.98 Number of non-strict supporting invariants: 1 19.24/8.98 Consider only non-deceasing supporting invariants: true 19.24/8.98 Simplify termination arguments: true 19.24/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.24/8.98 [2019-03-28 22:39:47,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.24/8.98 [2019-03-28 22:39:47,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.24/8.98 [2019-03-28 22:39:47,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.24/8.98 [2019-03-28 22:39:47,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.24/8.98 [2019-03-28 22:39:47,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.24/8.98 [2019-03-28 22:39:47,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.24/8.98 [2019-03-28 22:39:47,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.24/8.98 [2019-03-28 22:39:47,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.24/8.98 [2019-03-28 22:39:47,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.24/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.24/8.98 Number of strict supporting invariants: 0 19.24/8.98 Number of non-strict supporting invariants: 1 19.24/8.98 Consider only non-deceasing supporting invariants: true 19.24/8.98 Simplify termination arguments: true 19.24/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.24/8.98 [2019-03-28 22:39:47,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.24/8.98 [2019-03-28 22:39:47,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.24/8.98 [2019-03-28 22:39:47,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.24/8.98 [2019-03-28 22:39:47,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.24/8.98 [2019-03-28 22:39:47,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.24/8.98 [2019-03-28 22:39:47,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.24/8.98 [2019-03-28 22:39:47,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.24/8.98 [2019-03-28 22:39:47,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.24/8.98 [2019-03-28 22:39:47,334 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.24/8.98 [2019-03-28 22:39:47,334 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.24/8.98 [2019-03-28 22:39:47,337 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.24/8.98 [2019-03-28 22:39:47,337 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.24/8.98 [2019-03-28 22:39:47,337 INFO L518 LassoAnalysis]: Proved termination. 19.24/8.98 [2019-03-28 22:39:47,338 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.24/8.98 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 19.24/8.98 Supporting invariants [] 19.24/8.98 [2019-03-28 22:39:47,339 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.24/8.98 [2019-03-28 22:39:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.24/8.98 [2019-03-28 22:39:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.24/8.98 [2019-03-28 22:39:47,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 19.24/8.98 [2019-03-28 22:39:47,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.24/8.98 [2019-03-28 22:39:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.24/8.98 [2019-03-28 22:39:47,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 19.24/8.98 [2019-03-28 22:39:47,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.24/8.98 [2019-03-28 22:39:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.24/8.98 [2019-03-28 22:39:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.24/8.98 [2019-03-28 22:39:47,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 19.24/8.98 [2019-03-28 22:39:47,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.24/8.98 [2019-03-28 22:39:47,480 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 19.24/8.98 [2019-03-28 22:39:47,483 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 19.24/8.98 [2019-03-28 22:39:47,484 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 13 transitions. cyclomatic complexity: 7 Second operand 3 states. 19.24/8.98 [2019-03-28 22:39:47,541 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 13 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 37 transitions. Complement of second has 6 states. 19.24/8.98 [2019-03-28 22:39:47,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 19.24/8.98 [2019-03-28 22:39:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 19.24/8.98 [2019-03-28 22:39:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. 19.24/8.98 [2019-03-28 22:39:47,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. 19.24/8.98 [2019-03-28 22:39:47,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.24/8.98 [2019-03-28 22:39:47,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. 19.24/8.98 [2019-03-28 22:39:47,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.24/8.98 [2019-03-28 22:39:47,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. 19.24/8.98 [2019-03-28 22:39:47,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.24/8.98 [2019-03-28 22:39:47,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 37 transitions. 19.24/8.98 [2019-03-28 22:39:47,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 19.24/8.98 [2019-03-28 22:39:47,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 36 transitions. 19.24/8.98 [2019-03-28 22:39:47,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 19.24/8.98 [2019-03-28 22:39:47,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 19.24/8.98 [2019-03-28 22:39:47,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 36 transitions. 19.24/8.98 [2019-03-28 22:39:47,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.24/8.98 [2019-03-28 22:39:47,557 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 36 transitions. 19.24/8.98 [2019-03-28 22:39:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 36 transitions. 19.24/8.98 [2019-03-28 22:39:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. 19.24/8.98 [2019-03-28 22:39:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 19.24/8.98 [2019-03-28 22:39:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. 19.24/8.98 [2019-03-28 22:39:47,560 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 31 transitions. 19.24/8.98 [2019-03-28 22:39:47,560 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 31 transitions. 19.24/8.98 [2019-03-28 22:39:47,561 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 19.24/8.98 [2019-03-28 22:39:47,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 31 transitions. 19.24/8.98 [2019-03-28 22:39:47,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 19.24/8.98 [2019-03-28 22:39:47,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.24/8.98 [2019-03-28 22:39:47,562 INFO L119 BuchiIsEmpty]: Starting construction of run 19.24/8.98 [2019-03-28 22:39:47,562 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 19.24/8.98 [2019-03-28 22:39:47,562 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.24/8.98 [2019-03-28 22:39:47,563 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 93#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 101#L19 19.24/8.98 [2019-03-28 22:39:47,563 INFO L796 eck$LassoCheckResult]: Loop: 101#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 103#L20 [47] L20-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 100#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 101#L19 19.24/8.98 [2019-03-28 22:39:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.24/8.98 [2019-03-28 22:39:47,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2101, now seen corresponding path program 1 times 19.24/8.98 [2019-03-28 22:39:47,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.24/8.98 [2019-03-28 22:39:47,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.24/8.98 [2019-03-28 22:39:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:47,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.24/8.98 [2019-03-28 22:39:47,574 INFO L82 PathProgramCache]: Analyzing trace with hash 68782, now seen corresponding path program 1 times 19.24/8.98 [2019-03-28 22:39:47,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.24/8.98 [2019-03-28 22:39:47,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.24/8.98 [2019-03-28 22:39:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:47,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.24/8.98 [2019-03-28 22:39:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.24/8.98 [2019-03-28 22:39:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.24/8.98 [2019-03-28 22:39:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash 62629882, now seen corresponding path program 1 times 19.24/8.98 [2019-03-28 22:39:47,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:47,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:47,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:47,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:47,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:47,618 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:47,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:47,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:47,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:47,619 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.27/8.98 [2019-03-28 22:39:47,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:47,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:47,619 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:47,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 19.27/8.98 [2019-03-28 22:39:47,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:47,620 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:47,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:47,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:47,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:47,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:47,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:47,711 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:47,711 INFO L412 LassoAnalysis]: Checking for nontermination... 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:47,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:47,720 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:47,748 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.27/8.98 [2019-03-28 22:39:47,748 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: [] 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:47,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:47,755 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:47,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.27/8.98 [2019-03-28 22:39:47,784 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: [] 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:47,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:47,792 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:47,820 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.27/8.98 [2019-03-28 22:39:47,820 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=1} Honda state: {ULTIMATE.start_main_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:47,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:47,827 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:47,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.27/8.98 [2019-03-28 22:39:47,832 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: [] 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:47,862 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:47,862 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:47,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:47,896 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:47,976 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.27/8.98 [2019-03-28 22:39:47,978 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:47,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:47,978 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:47,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:47,979 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.27/8.98 [2019-03-28 22:39:47,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:47,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:47,979 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:47,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 19.27/8.98 [2019-03-28 22:39:47,979 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:47,980 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:47,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:47,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:47,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:47,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:47,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,048 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:48,048 INFO L497 LassoAnalysis]: Using template 'affine'. 19.27/8.98 [2019-03-28 22:39:48,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:48,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:48,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:48,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:48,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:48,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:48,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:48,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.27/8.98 [2019-03-28 22:39:48,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:48,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:48,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:48,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:48,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:48,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:48,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:48,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.27/8.98 [2019-03-28 22:39:48,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:48,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:48,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.98 [2019-03-28 22:39:48,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:48,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:48,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:48,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:48,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:48,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.27/8.98 [2019-03-28 22:39:48,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:48,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:48,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.98 [2019-03-28 22:39:48,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:48,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:48,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:48,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:48,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:48,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.27/8.98 [2019-03-28 22:39:48,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:48,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:48,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.98 [2019-03-28 22:39:48,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:48,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:48,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:48,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:48,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:48,080 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.27/8.98 [2019-03-28 22:39:48,083 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.27/8.98 [2019-03-28 22:39:48,083 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.27/8.98 [2019-03-28 22:39:48,083 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.27/8.98 [2019-03-28 22:39:48,084 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.27/8.98 [2019-03-28 22:39:48,084 INFO L518 LassoAnalysis]: Proved termination. 19.27/8.98 [2019-03-28 22:39:48,084 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.27/8.98 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 19.27/8.98 Supporting invariants [] 19.27/8.98 [2019-03-28 22:39:48,084 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.27/8.98 [2019-03-28 22:39:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:48,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:48,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:48,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:48,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.27/8.98 [2019-03-28 22:39:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:48,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:48,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:48,150 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 19.27/8.98 [2019-03-28 22:39:48,150 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 19.27/8.98 [2019-03-28 22:39:48,150 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 31 transitions. cyclomatic complexity: 18 Second operand 4 states. 19.27/8.98 [2019-03-28 22:39:48,200 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 31 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 34 states and 56 transitions. Complement of second has 7 states. 19.27/8.98 [2019-03-28 22:39:48,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 19.27/8.98 [2019-03-28 22:39:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 19.27/8.98 [2019-03-28 22:39:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. 19.27/8.98 [2019-03-28 22:39:48,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 3 letters. 19.27/8.98 [2019-03-28 22:39:48,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:48,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 3 letters. 19.27/8.98 [2019-03-28 22:39:48,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:48,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. 19.27/8.98 [2019-03-28 22:39:48,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:48,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 56 transitions. 19.27/8.98 [2019-03-28 22:39:48,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 19.27/8.98 [2019-03-28 22:39:48,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 25 states and 44 transitions. 19.27/8.98 [2019-03-28 22:39:48,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 19.27/8.98 [2019-03-28 22:39:48,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 19.27/8.98 [2019-03-28 22:39:48,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 44 transitions. 19.27/8.98 [2019-03-28 22:39:48,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.27/8.98 [2019-03-28 22:39:48,209 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 44 transitions. 19.27/8.98 [2019-03-28 22:39:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 44 transitions. 19.27/8.98 [2019-03-28 22:39:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. 19.27/8.98 [2019-03-28 22:39:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 19.27/8.98 [2019-03-28 22:39:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. 19.27/8.98 [2019-03-28 22:39:48,212 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 42 transitions. 19.27/8.98 [2019-03-28 22:39:48,213 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 42 transitions. 19.27/8.98 [2019-03-28 22:39:48,213 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 19.27/8.98 [2019-03-28 22:39:48,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 42 transitions. 19.27/8.98 [2019-03-28 22:39:48,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 19.27/8.98 [2019-03-28 22:39:48,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.27/8.98 [2019-03-28 22:39:48,214 INFO L119 BuchiIsEmpty]: Starting construction of run 19.27/8.98 [2019-03-28 22:39:48,214 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.27/8.98 [2019-03-28 22:39:48,214 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.27/8.98 [2019-03-28 22:39:48,215 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 193#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 206#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 194#L27 19.27/8.98 [2019-03-28 22:39:48,215 INFO L796 eck$LassoCheckResult]: Loop: 194#L27 [38] L27-->L27-2: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~x~0_14 |v_ULTIMATE.start_main_#t~nondet5_3|) (= v_ULTIMATE.start_main_~y~0_11 (+ v_ULTIMATE.start_main_~y~0_12 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 195#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 207#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 194#L27 19.27/8.98 [2019-03-28 22:39:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash 65212, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:48,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:48,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:48,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash 68095, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:48,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:48,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1942768996, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:48,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,271 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:48,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:48,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:48,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:48,272 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.27/8.98 [2019-03-28 22:39:48,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:48,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:48,273 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:48,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 19.27/8.98 [2019-03-28 22:39:48,273 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:48,273 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:48,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,359 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:48,360 INFO L412 LassoAnalysis]: Checking for nontermination... 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:48,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:48,363 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:48,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:48,414 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:48,490 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.27/8.98 [2019-03-28 22:39:48,492 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:48,492 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:48,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:48,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:48,493 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.27/8.98 [2019-03-28 22:39:48,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:48,493 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:48,493 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:48,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 19.27/8.98 [2019-03-28 22:39:48,494 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:48,494 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:48,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,563 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:48,563 INFO L497 LassoAnalysis]: Using template 'affine'. 19.27/8.98 [2019-03-28 22:39:48,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:48,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:48,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.98 [2019-03-28 22:39:48,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:48,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:48,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:48,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:48,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:48,569 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.27/8.98 [2019-03-28 22:39:48,573 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.27/8.98 [2019-03-28 22:39:48,573 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.27/8.98 [2019-03-28 22:39:48,573 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.27/8.98 [2019-03-28 22:39:48,573 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.27/8.98 [2019-03-28 22:39:48,574 INFO L518 LassoAnalysis]: Proved termination. 19.27/8.98 [2019-03-28 22:39:48,574 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.27/8.98 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 19.27/8.98 Supporting invariants [] 19.27/8.98 [2019-03-28 22:39:48,574 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.27/8.98 [2019-03-28 22:39:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:48,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:48,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:48,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:48,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.27/8.98 [2019-03-28 22:39:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:48,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:48,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:48,644 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 19.27/8.98 [2019-03-28 22:39:48,644 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 19.27/8.98 [2019-03-28 22:39:48,645 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 42 transitions. cyclomatic complexity: 20 Second operand 4 states. 19.27/8.98 [2019-03-28 22:39:48,740 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 42 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 65 states and 121 transitions. Complement of second has 20 states. 19.27/8.98 [2019-03-28 22:39:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 19.27/8.98 [2019-03-28 22:39:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 19.27/8.98 [2019-03-28 22:39:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. 19.27/8.98 [2019-03-28 22:39:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 3 letters. Loop has 3 letters. 19.27/8.98 [2019-03-28 22:39:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 6 letters. Loop has 3 letters. 19.27/8.98 [2019-03-28 22:39:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:48,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 3 letters. Loop has 6 letters. 19.27/8.98 [2019-03-28 22:39:48,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:48,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 121 transitions. 19.27/8.98 [2019-03-28 22:39:48,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 19.27/8.98 [2019-03-28 22:39:48,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 55 states and 102 transitions. 19.27/8.98 [2019-03-28 22:39:48,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 19.27/8.98 [2019-03-28 22:39:48,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 19.27/8.98 [2019-03-28 22:39:48,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 102 transitions. 19.27/8.98 [2019-03-28 22:39:48,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.27/8.98 [2019-03-28 22:39:48,769 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 102 transitions. 19.27/8.98 [2019-03-28 22:39:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 102 transitions. 19.27/8.98 [2019-03-28 22:39:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. 19.27/8.98 [2019-03-28 22:39:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 19.27/8.98 [2019-03-28 22:39:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 69 transitions. 19.27/8.98 [2019-03-28 22:39:48,773 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 69 transitions. 19.27/8.98 [2019-03-28 22:39:48,774 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 69 transitions. 19.27/8.98 [2019-03-28 22:39:48,774 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 19.27/8.98 [2019-03-28 22:39:48,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 69 transitions. 19.27/8.98 [2019-03-28 22:39:48,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 19.27/8.98 [2019-03-28 22:39:48,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.27/8.98 [2019-03-28 22:39:48,775 INFO L119 BuchiIsEmpty]: Starting construction of run 19.27/8.98 [2019-03-28 22:39:48,775 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.27/8.98 [2019-03-28 22:39:48,776 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 19.27/8.98 [2019-03-28 22:39:48,776 INFO L794 eck$LassoCheckResult]: Stem: 349#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 350#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 370#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 369#L27 19.27/8.98 [2019-03-28 22:39:48,776 INFO L796 eck$LassoCheckResult]: Loop: 369#L27 [59] L27-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 352#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 356#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 357#L20 [57] L20-->L27-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~y~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 363#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 371#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 369#L27 19.27/8.98 [2019-03-28 22:39:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash 65212, now seen corresponding path program 2 times 19.27/8.98 [2019-03-28 22:39:48,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:48,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1666331639, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:48,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:48,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:48,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.27/8.98 [2019-03-28 22:39:48,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.27/8.98 [2019-03-28 22:39:48,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 19.27/8.98 [2019-03-28 22:39:48,804 INFO L811 eck$LassoCheckResult]: loop already infeasible 19.27/8.98 [2019-03-28 22:39:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.27/8.98 [2019-03-28 22:39:48,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.27/8.98 [2019-03-28 22:39:48,805 INFO L87 Difference]: Start difference. First operand 34 states and 69 transitions. cyclomatic complexity: 37 Second operand 4 states. 19.27/8.98 [2019-03-28 22:39:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.27/8.98 [2019-03-28 22:39:48,830 INFO L93 Difference]: Finished difference Result 31 states and 60 transitions. 19.27/8.98 [2019-03-28 22:39:48,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 19.27/8.98 [2019-03-28 22:39:48,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 60 transitions. 19.27/8.98 [2019-03-28 22:39:48,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 19.27/8.98 [2019-03-28 22:39:48,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 43 transitions. 19.27/8.98 [2019-03-28 22:39:48,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 19.27/8.98 [2019-03-28 22:39:48,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 19.27/8.98 [2019-03-28 22:39:48,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 43 transitions. 19.27/8.98 [2019-03-28 22:39:48,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.27/8.98 [2019-03-28 22:39:48,835 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 43 transitions. 19.27/8.98 [2019-03-28 22:39:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 43 transitions. 19.27/8.98 [2019-03-28 22:39:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 19.27/8.98 [2019-03-28 22:39:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 19.27/8.98 [2019-03-28 22:39:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 43 transitions. 19.27/8.98 [2019-03-28 22:39:48,837 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 43 transitions. 19.27/8.98 [2019-03-28 22:39:48,837 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 43 transitions. 19.27/8.98 [2019-03-28 22:39:48,837 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 19.27/8.98 [2019-03-28 22:39:48,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 43 transitions. 19.27/8.98 [2019-03-28 22:39:48,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 19.27/8.98 [2019-03-28 22:39:48,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.27/8.98 [2019-03-28 22:39:48,838 INFO L119 BuchiIsEmpty]: Starting construction of run 19.27/8.98 [2019-03-28 22:39:48,839 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.27/8.98 [2019-03-28 22:39:48,839 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.27/8.98 [2019-03-28 22:39:48,839 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 422#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 428#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 429#L27 [60] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet4_3|)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 424#L27-2 19.27/8.98 [2019-03-28 22:39:48,839 INFO L796 eck$LassoCheckResult]: Loop: 424#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 441#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 423#L27 [59] L27-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 424#L27-2 19.27/8.98 [2019-03-28 22:39:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2021632, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:48,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:48,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:48,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash 85216, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:48,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:48,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:48,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash 96952193, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:48,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:48,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:48,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:48,892 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:48,893 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:48,893 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:48,893 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:48,893 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.27/8.98 [2019-03-28 22:39:48,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:48,893 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:48,893 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:48,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 19.27/8.98 [2019-03-28 22:39:48,894 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:48,894 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:48,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:48,946 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:48,946 INFO L412 LassoAnalysis]: Checking for nontermination... 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:48,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:48,952 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:48,980 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.27/8.98 [2019-03-28 22:39:48,980 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:48,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:48,984 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:49,014 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:49,043 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.27/8.98 [2019-03-28 22:39:49,045 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:49,045 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:49,045 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:49,045 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:49,045 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.27/8.98 [2019-03-28 22:39:49,045 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,045 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:49,045 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:49,046 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 19.27/8.98 [2019-03-28 22:39:49,046 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:49,046 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:49,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,095 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:49,095 INFO L497 LassoAnalysis]: Using template 'affine'. 19.27/8.98 [2019-03-28 22:39:49,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:49,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:49,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.98 [2019-03-28 22:39:49,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:49,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:49,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:49,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:49,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:49,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.27/8.98 [2019-03-28 22:39:49,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:49,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:49,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.98 [2019-03-28 22:39:49,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:49,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:49,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:49,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:49,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:49,106 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.27/8.98 [2019-03-28 22:39:49,108 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.27/8.98 [2019-03-28 22:39:49,108 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.27/8.98 [2019-03-28 22:39:49,109 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.27/8.98 [2019-03-28 22:39:49,109 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.27/8.98 [2019-03-28 22:39:49,109 INFO L518 LassoAnalysis]: Proved termination. 19.27/8.98 [2019-03-28 22:39:49,109 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.27/8.98 Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 19.27/8.98 Supporting invariants [] 19.27/8.98 [2019-03-28 22:39:49,110 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.27/8.98 [2019-03-28 22:39:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:49,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:49,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:49,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:49,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.27/8.98 [2019-03-28 22:39:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:49,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:49,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:49,171 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 19.27/8.98 [2019-03-28 22:39:49,171 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 19.27/8.98 [2019-03-28 22:39:49,171 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 43 transitions. cyclomatic complexity: 25 Second operand 4 states. 19.27/8.98 [2019-03-28 22:39:49,211 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 43 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 55 states and 95 transitions. Complement of second has 7 states. 19.27/8.98 [2019-03-28 22:39:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 19.27/8.98 [2019-03-28 22:39:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 19.27/8.98 [2019-03-28 22:39:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. 19.27/8.98 [2019-03-28 22:39:49,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 3 letters. 19.27/8.98 [2019-03-28 22:39:49,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:49,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 7 letters. Loop has 3 letters. 19.27/8.98 [2019-03-28 22:39:49,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:49,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 6 letters. 19.27/8.98 [2019-03-28 22:39:49,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:49,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 95 transitions. 19.27/8.98 [2019-03-28 22:39:49,216 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 19.27/8.98 [2019-03-28 22:39:49,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 36 states and 66 transitions. 19.27/8.98 [2019-03-28 22:39:49,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 19.27/8.98 [2019-03-28 22:39:49,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 19.27/8.98 [2019-03-28 22:39:49,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 66 transitions. 19.27/8.98 [2019-03-28 22:39:49,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.27/8.98 [2019-03-28 22:39:49,218 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 66 transitions. 19.27/8.98 [2019-03-28 22:39:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 66 transitions. 19.27/8.98 [2019-03-28 22:39:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. 19.27/8.98 [2019-03-28 22:39:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 19.27/8.98 [2019-03-28 22:39:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 58 transitions. 19.27/8.98 [2019-03-28 22:39:49,221 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 58 transitions. 19.27/8.98 [2019-03-28 22:39:49,221 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 58 transitions. 19.27/8.98 [2019-03-28 22:39:49,221 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 19.27/8.98 [2019-03-28 22:39:49,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 58 transitions. 19.27/8.98 [2019-03-28 22:39:49,222 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 19.27/8.98 [2019-03-28 22:39:49,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.27/8.98 [2019-03-28 22:39:49,222 INFO L119 BuchiIsEmpty]: Starting construction of run 19.27/8.98 [2019-03-28 22:39:49,222 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.27/8.98 [2019-03-28 22:39:49,222 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 19.27/8.98 [2019-03-28 22:39:49,222 INFO L794 eck$LassoCheckResult]: Stem: 550#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 551#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 567#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 568#L27 [59] L27-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 553#L27-2 19.27/8.98 [2019-03-28 22:39:49,223 INFO L796 eck$LassoCheckResult]: Loop: 553#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 573#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 552#L27 [59] L27-->L27-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 553#L27-2 19.27/8.98 [2019-03-28 22:39:49,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:49,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2021631, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:49,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:49,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:49,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash 85216, now seen corresponding path program 2 times 19.27/8.98 [2019-03-28 22:39:49,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:49,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:49,238 INFO L82 PathProgramCache]: Analyzing trace with hash 96922402, now seen corresponding path program 2 times 19.27/8.98 [2019-03-28 22:39:49,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:49,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:49,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:49,272 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:49,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:49,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:49,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:49,273 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.27/8.98 [2019-03-28 22:39:49,273 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,273 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:49,273 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:49,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 19.27/8.98 [2019-03-28 22:39:49,273 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:49,273 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:49,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,321 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:49,321 INFO L412 LassoAnalysis]: Checking for nontermination... 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:49,324 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:49,351 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.27/8.98 [2019-03-28 22:39:49,351 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:49,355 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:49,385 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:49,414 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.27/8.98 [2019-03-28 22:39:49,416 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:49,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:49,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:49,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:49,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.27/8.98 [2019-03-28 22:39:49,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:49,417 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:49,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 19.27/8.98 [2019-03-28 22:39:49,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:49,417 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:49,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,473 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:49,473 INFO L497 LassoAnalysis]: Using template 'affine'. 19.27/8.98 [2019-03-28 22:39:49,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:49,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:49,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.98 [2019-03-28 22:39:49,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:49,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:49,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:49,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:49,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:49,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.27/8.98 [2019-03-28 22:39:49,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:49,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:49,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.98 [2019-03-28 22:39:49,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:49,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:49,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:49,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:49,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:49,481 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.27/8.98 [2019-03-28 22:39:49,483 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.27/8.98 [2019-03-28 22:39:49,483 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.27/8.98 [2019-03-28 22:39:49,484 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.27/8.98 [2019-03-28 22:39:49,484 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.27/8.98 [2019-03-28 22:39:49,484 INFO L518 LassoAnalysis]: Proved termination. 19.27/8.98 [2019-03-28 22:39:49,484 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.27/8.98 Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 19.27/8.98 Supporting invariants [] 19.27/8.98 [2019-03-28 22:39:49,484 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.27/8.98 [2019-03-28 22:39:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:49,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:49,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:49,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:49,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.27/8.98 [2019-03-28 22:39:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:49,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.98 [2019-03-28 22:39:49,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.98 [2019-03-28 22:39:49,534 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 19.27/8.98 [2019-03-28 22:39:49,534 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 19.27/8.98 [2019-03-28 22:39:49,534 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 58 transitions. cyclomatic complexity: 32 Second operand 4 states. 19.27/8.98 [2019-03-28 22:39:49,580 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 58 transitions. cyclomatic complexity: 32. Second operand 4 states. Result 81 states and 139 transitions. Complement of second has 7 states. 19.27/8.98 [2019-03-28 22:39:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 19.27/8.98 [2019-03-28 22:39:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 19.27/8.98 [2019-03-28 22:39:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. 19.27/8.98 [2019-03-28 22:39:49,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 3 letters. 19.27/8.98 [2019-03-28 22:39:49,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:49,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 7 letters. Loop has 3 letters. 19.27/8.98 [2019-03-28 22:39:49,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:49,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 6 letters. 19.27/8.98 [2019-03-28 22:39:49,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.98 [2019-03-28 22:39:49,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 139 transitions. 19.27/8.98 [2019-03-28 22:39:49,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 19.27/8.98 [2019-03-28 22:39:49,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 55 states and 97 transitions. 19.27/8.98 [2019-03-28 22:39:49,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 19.27/8.98 [2019-03-28 22:39:49,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 19.27/8.98 [2019-03-28 22:39:49,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 97 transitions. 19.27/8.98 [2019-03-28 22:39:49,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.27/8.98 [2019-03-28 22:39:49,587 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 97 transitions. 19.27/8.98 [2019-03-28 22:39:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 97 transitions. 19.27/8.98 [2019-03-28 22:39:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. 19.27/8.98 [2019-03-28 22:39:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 19.27/8.98 [2019-03-28 22:39:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. 19.27/8.98 [2019-03-28 22:39:49,590 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 54 transitions. 19.27/8.98 [2019-03-28 22:39:49,590 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 54 transitions. 19.27/8.98 [2019-03-28 22:39:49,590 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 19.27/8.98 [2019-03-28 22:39:49,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 54 transitions. 19.27/8.98 [2019-03-28 22:39:49,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 19.27/8.98 [2019-03-28 22:39:49,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.27/8.98 [2019-03-28 22:39:49,591 INFO L119 BuchiIsEmpty]: Starting construction of run 19.27/8.98 [2019-03-28 22:39:49,591 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 19.27/8.98 [2019-03-28 22:39:49,592 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] 19.27/8.98 [2019-03-28 22:39:49,592 INFO L794 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY [35] ULTIMATE.startENTRY-->L27-2: 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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_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_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~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~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 715#L27-2 [56] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_7) (> 0 v_ULTIMATE.start_main_~x~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 728#L19 [50] L19-->L27: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_11) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 729#L27 [60] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 1)) (< 0 |v_ULTIMATE.start_main_#t~nondet4_3|)) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 717#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 720#L19 19.27/8.98 [2019-03-28 22:39:49,592 INFO L796 eck$LassoCheckResult]: Loop: 720#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 721#L20 [57] L20-->L27-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~y~0_8 |v_ULTIMATE.start_main_#t~nondet3_3|) (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 723#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 727#L19 [39] L19-->L20: Formula: (< 0 v_ULTIMATE.start_main_~x~0_8) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[] 724#L20 [47] L20-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 725#L27-2 [55] L27-2-->L19: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (< 0 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} AuxVars[] AssignedVars[] 720#L19 19.27/8.98 [2019-03-28 22:39:49,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:49,592 INFO L82 PathProgramCache]: Analyzing trace with hash 62670647, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:49,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:49,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.98 [2019-03-28 22:39:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.27/8.98 [2019-03-28 22:39:49,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.27/8.98 [2019-03-28 22:39:49,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.27/8.98 [2019-03-28 22:39:49,612 INFO L799 eck$LassoCheckResult]: stem already infeasible 19.27/8.98 [2019-03-28 22:39:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.98 [2019-03-28 22:39:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2058358763, now seen corresponding path program 1 times 19.27/8.98 [2019-03-28 22:39:49,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.27/8.98 [2019-03-28 22:39:49,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.27/8.98 [2019-03-28 22:39:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.27/8.98 [2019-03-28 22:39:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.27/8.98 [2019-03-28 22:39:49,655 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:49,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:49,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:49,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:49,655 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.27/8.98 [2019-03-28 22:39:49,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:49,656 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:49,656 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 19.27/8.98 [2019-03-28 22:39:49,656 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:49,656 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:49,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,712 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:49,712 INFO L412 LassoAnalysis]: Checking for nontermination... 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,715 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:49,715 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:49,742 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.27/8.98 [2019-03-28 22:39:49,742 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: [] 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:49,746 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:49,773 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.27/8.98 [2019-03-28 22:39:49,773 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: [] 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:49,777 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:49,803 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.27/8.98 [2019-03-28 22:39:49,803 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: [] 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:49,807 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.27/8.98 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.27/8.98 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.27/8.98 [2019-03-28 22:39:49,836 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.27/8.98 [2019-03-28 22:39:49,909 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.27/8.98 [2019-03-28 22:39:49,911 INFO L216 LassoAnalysis]: Preferences: 19.27/8.98 [2019-03-28 22:39:49,911 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.27/8.98 [2019-03-28 22:39:49,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.27/8.98 [2019-03-28 22:39:49,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.27/8.98 [2019-03-28 22:39:49,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.27/8.98 [2019-03-28 22:39:49,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.27/8.98 [2019-03-28 22:39:49,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.27/8.98 [2019-03-28 22:39:49,912 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.27/8.98 [2019-03-28 22:39:49,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 19.27/8.98 [2019-03-28 22:39:49,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.27/8.98 [2019-03-28 22:39:49,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.27/8.98 [2019-03-28 22:39:49,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.27/8.98 [2019-03-28 22:39:49,968 INFO L300 LassoAnalysis]: Preprocessing complete. 19.27/8.98 [2019-03-28 22:39:49,968 INFO L497 LassoAnalysis]: Using template 'affine'. 19.27/8.98 [2019-03-28 22:39:49,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:49,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:49,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.98 [2019-03-28 22:39:49,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:49,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:49,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:49,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:49,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:49,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.27/8.98 [2019-03-28 22:39:49,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:49,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:49,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:49,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:49,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:49,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:49,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:49,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.27/8.98 [2019-03-28 22:39:49,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.98 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.98 Number of strict supporting invariants: 0 19.27/8.98 Number of non-strict supporting invariants: 1 19.27/8.98 Consider only non-deceasing supporting invariants: true 19.27/8.98 Simplify termination arguments: true 19.27/8.98 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.98 [2019-03-28 22:39:49,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.98 [2019-03-28 22:39:49,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.98 [2019-03-28 22:39:49,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.98 [2019-03-28 22:39:49,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.98 [2019-03-28 22:39:49,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.27/8.98 [2019-03-28 22:39:49,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.27/8.98 [2019-03-28 22:39:49,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.27/8.98 [2019-03-28 22:39:49,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.27/8.99 Termination analysis: LINEAR_WITH_GUESSES 19.27/8.99 Number of strict supporting invariants: 0 19.27/8.99 Number of non-strict supporting invariants: 1 19.27/8.99 Consider only non-deceasing supporting invariants: true 19.27/8.99 Simplify termination arguments: true 19.27/8.99 Simplify supporting invariants: trueOverapproximate stem: false 19.27/8.99 [2019-03-28 22:39:49,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.27/8.99 [2019-03-28 22:39:49,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.27/8.99 [2019-03-28 22:39:49,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.27/8.99 [2019-03-28 22:39:49,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.27/8.99 [2019-03-28 22:39:49,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.27/8.99 [2019-03-28 22:39:49,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.27/8.99 [2019-03-28 22:39:49,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.27/8.99 [2019-03-28 22:39:49,987 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.27/8.99 [2019-03-28 22:39:49,989 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.27/8.99 [2019-03-28 22:39:49,989 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 19.27/8.99 [2019-03-28 22:39:49,990 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.27/8.99 [2019-03-28 22:39:49,990 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.27/8.99 [2019-03-28 22:39:49,990 INFO L518 LassoAnalysis]: Proved termination. 19.27/8.99 [2019-03-28 22:39:49,990 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.27/8.99 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 19.27/8.99 Supporting invariants [] 19.27/8.99 [2019-03-28 22:39:49,990 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.27/8.99 [2019-03-28 22:39:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.27/8.99 [2019-03-28 22:39:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.99 [2019-03-28 22:39:50,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core 19.27/8.99 [2019-03-28 22:39:50,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.99 [2019-03-28 22:39:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.99 [2019-03-28 22:39:50,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.99 [2019-03-28 22:39:50,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.99 [2019-03-28 22:39:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.27/8.99 [2019-03-28 22:39:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.99 [2019-03-28 22:39:50,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.99 [2019-03-28 22:39:50,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.99 [2019-03-28 22:39:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.99 [2019-03-28 22:39:50,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.99 [2019-03-28 22:39:50,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.99 [2019-03-28 22:39:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.27/8.99 [2019-03-28 22:39:50,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 19.27/8.99 [2019-03-28 22:39:50,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.27/8.99 [2019-03-28 22:39:50,085 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 19.27/8.99 [2019-03-28 22:39:50,085 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 19.27/8.99 [2019-03-28 22:39:50,085 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 54 transitions. cyclomatic complexity: 29 Second operand 5 states. 19.27/8.99 [2019-03-28 22:39:50,111 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 54 transitions. cyclomatic complexity: 29. Second operand 5 states. Result 48 states and 86 transitions. Complement of second has 8 states. 19.27/8.99 [2019-03-28 22:39:50,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 19.27/8.99 [2019-03-28 22:39:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 19.27/8.99 [2019-03-28 22:39:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. 19.27/8.99 [2019-03-28 22:39:50,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 6 letters. 19.27/8.99 [2019-03-28 22:39:50,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.99 [2019-03-28 22:39:50,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 6 letters. 19.27/8.99 [2019-03-28 22:39:50,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.99 [2019-03-28 22:39:50,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 12 letters. 19.27/8.99 [2019-03-28 22:39:50,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.27/8.99 [2019-03-28 22:39:50,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 86 transitions. 19.27/8.99 [2019-03-28 22:39:50,116 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.27/8.99 [2019-03-28 22:39:50,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.27/8.99 [2019-03-28 22:39:50,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.27/8.99 [2019-03-28 22:39:50,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.27/8.99 [2019-03-28 22:39:50,117 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,117 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.27/8.99 [2019-03-28 22:39:50,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.27/8.99 [2019-03-28 22:39:50,118 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. 19.27/8.99 [2019-03-28 22:39:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.27/8.99 [2019-03-28 22:39:50,118 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 19.27/8.99 [2019-03-28 22:39:50,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,119 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.27/8.99 [2019-03-28 22:39:50,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.27/8.99 [2019-03-28 22:39:50,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.27/8.99 [2019-03-28 22:39:50,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.27/8.99 [2019-03-28 22:39:50,120 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,120 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,120 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,120 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 19.27/8.99 [2019-03-28 22:39:50,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 19.27/8.99 [2019-03-28 22:39:50,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.27/8.99 [2019-03-28 22:39:50,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 19.27/8.99 [2019-03-28 22:39:50,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:39:50 BasicIcfg 19.27/8.99 [2019-03-28 22:39:50,127 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 19.27/8.99 [2019-03-28 22:39:50,127 INFO L168 Benchmark]: Toolchain (without parser) took 4549.48 ms. Allocated memory was 649.6 MB in the beginning and 753.9 MB in the end (delta: 104.3 MB). Free memory was 558.5 MB in the beginning and 432.6 MB in the end (delta: 125.8 MB). Peak memory consumption was 230.2 MB. Max. memory is 50.3 GB. 19.27/8.99 [2019-03-28 22:39:50,129 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.27/8.99 [2019-03-28 22:39:50,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.93 ms. Allocated memory is still 649.6 MB. Free memory was 558.5 MB in the beginning and 549.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 19.27/8.99 [2019-03-28 22:39:50,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.85 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 549.0 MB in the beginning and 648.2 MB in the end (delta: -99.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 50.3 GB. 19.27/8.99 [2019-03-28 22:39:50,131 INFO L168 Benchmark]: Boogie Preprocessor took 22.05 ms. Allocated memory is still 680.5 MB. Free memory was 648.2 MB in the beginning and 645.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 19.27/8.99 [2019-03-28 22:39:50,131 INFO L168 Benchmark]: RCFGBuilder took 216.93 ms. Allocated memory is still 680.5 MB. Free memory was 645.1 MB in the beginning and 630.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 19.27/8.99 [2019-03-28 22:39:50,132 INFO L168 Benchmark]: BlockEncodingV2 took 87.54 ms. Allocated memory is still 680.5 MB. Free memory was 630.8 MB in the beginning and 624.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 19.27/8.99 [2019-03-28 22:39:50,132 INFO L168 Benchmark]: TraceAbstraction took 165.43 ms. Allocated memory is still 680.5 MB. Free memory was 624.4 MB in the beginning and 614.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 19.27/8.99 [2019-03-28 22:39:50,133 INFO L168 Benchmark]: BuchiAutomizer took 3721.40 ms. Allocated memory was 680.5 MB in the beginning and 753.9 MB in the end (delta: 73.4 MB). Free memory was 614.9 MB in the beginning and 432.6 MB in the end (delta: 182.3 MB). Peak memory consumption was 255.7 MB. Max. memory is 50.3 GB. 19.27/8.99 [2019-03-28 22:39:50,137 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 19.27/8.99 --- Results --- 19.27/8.99 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 19.27/8.99 - StatisticsResult: Initial Icfg 19.27/8.99 9 locations, 13 edges 19.27/8.99 - StatisticsResult: Encoded RCFG 19.27/8.99 5 locations, 11 edges 19.27/8.99 * Results from de.uni_freiburg.informatik.ultimate.core: 19.27/8.99 - StatisticsResult: Toolchain Benchmarks 19.27/8.99 Benchmark results are: 19.27/8.99 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.27/8.99 * CACSL2BoogieTranslator took 230.93 ms. Allocated memory is still 649.6 MB. Free memory was 558.5 MB in the beginning and 549.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 19.27/8.99 * Boogie Procedure Inliner took 99.85 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 549.0 MB in the beginning and 648.2 MB in the end (delta: -99.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 50.3 GB. 19.27/8.99 * Boogie Preprocessor took 22.05 ms. Allocated memory is still 680.5 MB. Free memory was 648.2 MB in the beginning and 645.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 19.27/8.99 * RCFGBuilder took 216.93 ms. Allocated memory is still 680.5 MB. Free memory was 645.1 MB in the beginning and 630.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 19.27/8.99 * BlockEncodingV2 took 87.54 ms. Allocated memory is still 680.5 MB. Free memory was 630.8 MB in the beginning and 624.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 19.27/8.99 * TraceAbstraction took 165.43 ms. Allocated memory is still 680.5 MB. Free memory was 624.4 MB in the beginning and 614.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 19.27/8.99 * BuchiAutomizer took 3721.40 ms. Allocated memory was 680.5 MB in the beginning and 753.9 MB in the end (delta: 73.4 MB). Free memory was 614.9 MB in the beginning and 432.6 MB in the end (delta: 182.3 MB). Peak memory consumption was 255.7 MB. Max. memory is 50.3 GB. 19.27/8.99 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 19.27/8.99 - AllSpecificationsHoldResult: All specifications hold 19.27/8.99 We were not able to verify any specifiation because the program does not contain any specification. 19.27/8.99 - InvariantResult [Line: 18]: Loop Invariant 19.27/8.99 Derived loop invariant: 1 19.27/8.99 - StatisticsResult: Ultimate Automizer benchmark data 19.27/8.99 CFG has 1 procedures, 5 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=5occurred 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 19.27/8.99 - StatisticsResult: Constructed decomposition of program 19.27/8.99 Your program was decomposed into 9 terminating modules (3 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function -1 * x and consists of 5 locations. One nondeterministic module has affine ranking function -1 * x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. 19.27/8.99 - StatisticsResult: Timing statistics 19.27/8.99 BüchiAutomizer plugin needed 3.6s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 58 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 4. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 39 SDtfs, 108 SDslu, 27 SDs, 0 SdLazy, 254 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax168 hnf100 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s 19.27/8.99 - TerminationAnalysisResult: Termination proven 19.27/8.99 Buchi Automizer proved that your program is terminating 19.27/8.99 RESULT: Ultimate proved your program to be correct! 19.27/8.99 !SESSION 2019-03-28 22:39:42.326 ----------------------------------------------- 19.27/8.99 eclipse.buildId=unknown 19.27/8.99 java.version=1.8.0_181 19.27/8.99 java.vendor=Oracle Corporation 19.27/8.99 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 19.27/8.99 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.27/8.99 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 19.27/8.99 19.27/8.99 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:39:50.370 19.27/8.99 !MESSAGE The workspace will exit with unsaved changes in this session. 19.27/8.99 Received shutdown request... 19.27/8.99 Ultimate: 19.27/8.99 GTK+ Version Check 19.27/8.99 EOF