21.00/10.38 YES 21.00/10.38 21.08/10.38 Ultimate: Cannot open display: 21.08/10.38 This is Ultimate 0.1.24-8dc7c08-m 21.08/10.38 [2019-03-28 12:03:15,361 INFO L170 SettingsManager]: Resetting all preferences to default values... 21.08/10.38 [2019-03-28 12:03:15,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 21.08/10.38 [2019-03-28 12:03:15,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 21.08/10.38 [2019-03-28 12:03:15,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 21.08/10.38 [2019-03-28 12:03:15,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 21.08/10.38 [2019-03-28 12:03:15,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 21.08/10.38 [2019-03-28 12:03:15,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 21.08/10.38 [2019-03-28 12:03:15,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 21.08/10.38 [2019-03-28 12:03:15,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 21.08/10.38 [2019-03-28 12:03:15,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 21.08/10.38 [2019-03-28 12:03:15,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 21.08/10.38 [2019-03-28 12:03:15,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 21.08/10.38 [2019-03-28 12:03:15,384 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 21.08/10.38 [2019-03-28 12:03:15,385 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 21.08/10.38 [2019-03-28 12:03:15,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 21.08/10.38 [2019-03-28 12:03:15,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 21.08/10.38 [2019-03-28 12:03:15,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 21.08/10.38 [2019-03-28 12:03:15,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 21.08/10.38 [2019-03-28 12:03:15,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 21.08/10.38 [2019-03-28 12:03:15,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 21.08/10.38 [2019-03-28 12:03:15,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 21.08/10.38 [2019-03-28 12:03:15,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 21.08/10.38 [2019-03-28 12:03:15,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 21.08/10.38 [2019-03-28 12:03:15,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 21.08/10.38 [2019-03-28 12:03:15,397 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 21.08/10.38 [2019-03-28 12:03:15,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 21.08/10.38 [2019-03-28 12:03:15,398 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 21.08/10.38 [2019-03-28 12:03:15,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 21.08/10.38 [2019-03-28 12:03:15,399 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 21.08/10.38 [2019-03-28 12:03:15,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 21.08/10.38 [2019-03-28 12:03:15,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 21.08/10.38 [2019-03-28 12:03:15,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 21.08/10.38 [2019-03-28 12:03:15,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 21.08/10.38 [2019-03-28 12:03:15,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 21.08/10.38 [2019-03-28 12:03:15,403 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 21.08/10.38 [2019-03-28 12:03:15,403 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 21.08/10.38 [2019-03-28 12:03:15,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 21.08/10.38 [2019-03-28 12:03:15,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 21.08/10.38 [2019-03-28 12:03:15,405 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 21.08/10.38 [2019-03-28 12:03:15,419 INFO L110 SettingsManager]: Loading preferences was successful 21.08/10.38 [2019-03-28 12:03:15,419 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 21.08/10.38 [2019-03-28 12:03:15,420 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 21.08/10.38 [2019-03-28 12:03:15,421 INFO L133 SettingsManager]: * Rewrite not-equals=true 21.08/10.38 [2019-03-28 12:03:15,421 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 21.08/10.38 [2019-03-28 12:03:15,421 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 21.08/10.38 [2019-03-28 12:03:15,421 INFO L133 SettingsManager]: * Use SBE=true 21.08/10.38 [2019-03-28 12:03:15,421 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 21.08/10.38 [2019-03-28 12:03:15,422 INFO L133 SettingsManager]: * Use old map elimination=false 21.08/10.38 [2019-03-28 12:03:15,422 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 21.08/10.38 [2019-03-28 12:03:15,422 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 21.08/10.38 [2019-03-28 12:03:15,422 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 21.08/10.38 [2019-03-28 12:03:15,422 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 21.08/10.38 [2019-03-28 12:03:15,422 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 21.08/10.38 [2019-03-28 12:03:15,423 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:15,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 21.08/10.38 [2019-03-28 12:03:15,423 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 21.08/10.38 [2019-03-28 12:03:15,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE 21.08/10.38 [2019-03-28 12:03:15,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 21.08/10.38 [2019-03-28 12:03:15,424 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 21.08/10.38 [2019-03-28 12:03:15,424 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 21.08/10.38 [2019-03-28 12:03:15,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 21.08/10.38 [2019-03-28 12:03:15,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 21.08/10.38 [2019-03-28 12:03:15,424 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 21.08/10.38 [2019-03-28 12:03:15,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.08/10.38 [2019-03-28 12:03:15,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 21.08/10.38 [2019-03-28 12:03:15,425 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 21.08/10.38 [2019-03-28 12:03:15,425 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 21.08/10.38 [2019-03-28 12:03:15,425 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 21.08/10.38 [2019-03-28 12:03:15,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 21.08/10.38 [2019-03-28 12:03:15,466 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 21.08/10.38 [2019-03-28 12:03:15,469 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 21.08/10.38 [2019-03-28 12:03:15,471 INFO L271 PluginConnector]: Initializing CDTParser... 21.08/10.38 [2019-03-28 12:03:15,471 INFO L276 PluginConnector]: CDTParser initialized 21.08/10.38 [2019-03-28 12:03:15,472 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 21.08/10.38 [2019-03-28 12:03:15,542 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/4652c55867214d9ab2645ba6aecfc861/FLAG6aa66a889 21.08/10.38 [2019-03-28 12:03:15,874 INFO L307 CDTParser]: Found 1 translation units. 21.08/10.38 [2019-03-28 12:03:15,875 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 21.08/10.38 [2019-03-28 12:03:15,882 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/4652c55867214d9ab2645ba6aecfc861/FLAG6aa66a889 21.08/10.38 [2019-03-28 12:03:16,363 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/4652c55867214d9ab2645ba6aecfc861 21.08/10.38 [2019-03-28 12:03:16,375 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 21.08/10.38 [2019-03-28 12:03:16,376 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 21.08/10.38 [2019-03-28 12:03:16,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 21.08/10.38 [2019-03-28 12:03:16,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 21.08/10.38 [2019-03-28 12:03:16,381 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 21.08/10.38 [2019-03-28 12:03:16,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4849d303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16, skipping insertion in model container 21.08/10.38 [2019-03-28 12:03:16,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 21.08/10.38 [2019-03-28 12:03:16,411 INFO L176 MainTranslator]: Built tables and reachable declarations 21.08/10.38 [2019-03-28 12:03:16,567 INFO L206 PostProcessor]: Analyzing one entry point: main 21.08/10.38 [2019-03-28 12:03:16,572 INFO L191 MainTranslator]: Completed pre-run 21.08/10.38 [2019-03-28 12:03:16,587 INFO L206 PostProcessor]: Analyzing one entry point: main 21.08/10.38 [2019-03-28 12:03:16,601 INFO L195 MainTranslator]: Completed translation 21.08/10.38 [2019-03-28 12:03:16,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16 WrapperNode 21.08/10.38 [2019-03-28 12:03:16,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 21.08/10.38 [2019-03-28 12:03:16,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 21.08/10.38 [2019-03-28 12:03:16,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 21.08/10.38 [2019-03-28 12:03:16,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 21.08/10.38 [2019-03-28 12:03:16,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 21.08/10.38 [2019-03-28 12:03:16,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 21.08/10.38 [2019-03-28 12:03:16,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 21.08/10.38 [2019-03-28 12:03:16,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized 21.08/10.38 [2019-03-28 12:03:16,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 21.08/10.38 [2019-03-28 12:03:16,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 21.08/10.38 [2019-03-28 12:03:16,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... 21.08/10.38 [2019-03-28 12:03:16,713 INFO L276 PluginConnector]: RCFGBuilder initialized 21.08/10.38 [2019-03-28 12:03:16,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (1/1) ... 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 21.08/10.38 [2019-03-28 12:03:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 21.08/10.38 [2019-03-28 12:03:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 21.08/10.38 [2019-03-28 12:03:16,921 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 21.08/10.38 [2019-03-28 12:03:16,921 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 21.08/10.38 [2019-03-28 12:03:16,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:16 BoogieIcfgContainer 21.08/10.38 [2019-03-28 12:03:16,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 21.08/10.38 [2019-03-28 12:03:16,923 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 21.08/10.38 [2019-03-28 12:03:16,924 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 21.08/10.38 [2019-03-28 12:03:16,926 INFO L276 PluginConnector]: BlockEncodingV2 initialized 21.08/10.38 [2019-03-28 12:03:16,926 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:16" (1/1) ... 21.08/10.38 [2019-03-28 12:03:16,941 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 13 edges 21.08/10.38 [2019-03-28 12:03:16,942 INFO L258 BlockEncoder]: Using Remove infeasible edges 21.08/10.38 [2019-03-28 12:03:16,943 INFO L263 BlockEncoder]: Using Maximize final states 21.08/10.38 [2019-03-28 12:03:16,944 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 21.08/10.38 [2019-03-28 12:03:16,944 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 21.08/10.38 [2019-03-28 12:03:16,946 INFO L296 BlockEncoder]: Using Remove sink states 21.08/10.38 [2019-03-28 12:03:16,947 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 21.08/10.38 [2019-03-28 12:03:16,947 INFO L179 BlockEncoder]: Using Rewrite not-equals 21.08/10.38 [2019-03-28 12:03:16,962 INFO L185 BlockEncoder]: Using Use SBE 21.08/10.38 [2019-03-28 12:03:16,978 INFO L200 BlockEncoder]: SBE split 2 edges 21.08/10.38 [2019-03-28 12:03:16,983 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 21.08/10.38 [2019-03-28 12:03:16,984 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.08/10.38 [2019-03-28 12:03:16,996 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 21.08/10.38 [2019-03-28 12:03:16,998 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 21.08/10.38 [2019-03-28 12:03:17,000 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 21.08/10.38 [2019-03-28 12:03:17,000 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.08/10.38 [2019-03-28 12:03:17,003 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 21.08/10.38 [2019-03-28 12:03:17,004 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 21.08/10.38 [2019-03-28 12:03:17,004 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 21.08/10.38 [2019-03-28 12:03:17,004 INFO L71 MaximizeFinalStates]: 0 new accepting states 21.08/10.38 [2019-03-28 12:03:17,005 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 21.08/10.38 [2019-03-28 12:03:17,005 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 21.08/10.38 [2019-03-28 12:03:17,005 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 5 edges 21.08/10.38 [2019-03-28 12:03:17,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:03:17 BasicIcfg 21.08/10.38 [2019-03-28 12:03:17,006 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 21.08/10.38 [2019-03-28 12:03:17,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 21.08/10.38 [2019-03-28 12:03:17,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... 21.08/10.38 [2019-03-28 12:03:17,010 INFO L276 PluginConnector]: TraceAbstraction initialized 21.08/10.38 [2019-03-28 12:03:17,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:03:16" (1/4) ... 21.08/10.38 [2019-03-28 12:03:17,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db3489b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:03:17, skipping insertion in model container 21.08/10.38 [2019-03-28 12:03:17,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (2/4) ... 21.08/10.38 [2019-03-28 12:03:17,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db3489b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:03:17, skipping insertion in model container 21.08/10.38 [2019-03-28 12:03:17,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:16" (3/4) ... 21.08/10.38 [2019-03-28 12:03:17,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db3489b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:03:17, skipping insertion in model container 21.08/10.38 [2019-03-28 12:03:17,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:03:17" (4/4) ... 21.08/10.38 [2019-03-28 12:03:17,015 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.08/10.38 [2019-03-28 12:03:17,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 21.08/10.38 [2019-03-28 12:03:17,033 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 21.08/10.38 [2019-03-28 12:03:17,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 21.08/10.38 [2019-03-28 12:03:17,078 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.08/10.38 [2019-03-28 12:03:17,079 INFO L382 AbstractCegarLoop]: Interprodecural is true 21.08/10.38 [2019-03-28 12:03:17,079 INFO L383 AbstractCegarLoop]: Hoare is true 21.08/10.38 [2019-03-28 12:03:17,079 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 21.08/10.38 [2019-03-28 12:03:17,080 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 21.08/10.38 [2019-03-28 12:03:17,080 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.08/10.38 [2019-03-28 12:03:17,080 INFO L387 AbstractCegarLoop]: Difference is false 21.08/10.38 [2019-03-28 12:03:17,080 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 21.08/10.38 [2019-03-28 12:03:17,080 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 21.08/10.38 [2019-03-28 12:03:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. 21.08/10.38 [2019-03-28 12:03:17,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 21.08/10.38 [2019-03-28 12:03:17,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. 21.08/10.38 [2019-03-28 12:03:17,152 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. 21.08/10.38 [2019-03-28 12:03:17,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 21.08/10.38 [2019-03-28 12:03:17,153 INFO L451 ceAbstractionStarter]: At program point L15-2(lines 14 20) the Hoare annotation is: true 21.08/10.38 [2019-03-28 12:03:17,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:03:17 BasicIcfg 21.08/10.38 [2019-03-28 12:03:17,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 21.08/10.38 [2019-03-28 12:03:17,162 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 21.08/10.38 [2019-03-28 12:03:17,162 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 21.08/10.38 [2019-03-28 12:03:17,165 INFO L276 PluginConnector]: BuchiAutomizer initialized 21.08/10.38 [2019-03-28 12:03:17,166 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.08/10.38 [2019-03-28 12:03:17,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:03:16" (1/5) ... 21.08/10.38 [2019-03-28 12:03:17,167 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d3ea150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:03:17, skipping insertion in model container 21.08/10.38 [2019-03-28 12:03:17,167 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.08/10.38 [2019-03-28 12:03:17,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:16" (2/5) ... 21.08/10.38 [2019-03-28 12:03:17,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d3ea150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:03:17, skipping insertion in model container 21.08/10.38 [2019-03-28 12:03:17,168 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.08/10.38 [2019-03-28 12:03:17,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:16" (3/5) ... 21.08/10.38 [2019-03-28 12:03:17,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d3ea150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:03:17, skipping insertion in model container 21.08/10.38 [2019-03-28 12:03:17,168 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.08/10.38 [2019-03-28 12:03:17,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:03:17" (4/5) ... 21.08/10.38 [2019-03-28 12:03:17,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d3ea150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:03:17, skipping insertion in model container 21.08/10.38 [2019-03-28 12:03:17,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 21.08/10.38 [2019-03-28 12:03:17,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:03:17" (5/5) ... 21.08/10.38 [2019-03-28 12:03:17,171 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 21.08/10.38 [2019-03-28 12:03:17,198 INFO L133 ementStrategyFactory]: Using default assertion order modulation 21.08/10.38 [2019-03-28 12:03:17,198 INFO L374 BuchiCegarLoop]: Interprodecural is true 21.08/10.38 [2019-03-28 12:03:17,198 INFO L375 BuchiCegarLoop]: Hoare is true 21.08/10.38 [2019-03-28 12:03:17,198 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 21.08/10.38 [2019-03-28 12:03:17,198 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 21.08/10.38 [2019-03-28 12:03:17,198 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 21.08/10.38 [2019-03-28 12:03:17,199 INFO L379 BuchiCegarLoop]: Difference is false 21.08/10.38 [2019-03-28 12:03:17,199 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 21.08/10.38 [2019-03-28 12:03:17,199 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 21.08/10.38 [2019-03-28 12:03:17,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 21.08/10.38 [2019-03-28 12:03:17,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 21.08/10.38 [2019-03-28 12:03:17,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.08/10.38 [2019-03-28 12:03:17,219 INFO L119 BuchiIsEmpty]: Starting construction of run 21.08/10.38 [2019-03-28 12:03:17,225 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 21.08/10.38 [2019-03-28 12:03:17,225 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 21.08/10.38 [2019-03-28 12:03:17,225 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 21.08/10.38 [2019-03-28 12:03:17,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 21.08/10.38 [2019-03-28 12:03:17,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 21.08/10.38 [2019-03-28 12:03:17,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.08/10.38 [2019-03-28 12:03:17,226 INFO L119 BuchiIsEmpty]: Starting construction of run 21.08/10.38 [2019-03-28 12:03:17,226 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 21.08/10.38 [2019-03-28 12:03:17,226 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 21.08/10.38 [2019-03-28 12:03:17,231 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 5#L15-2true 21.08/10.38 [2019-03-28 12:03:17,232 INFO L796 eck$LassoCheckResult]: Loop: 5#L15-2true [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 3#L15true [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 5#L15-2true 21.08/10.38 [2019-03-28 12:03:17,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:17,238 INFO L82 PathProgramCache]: Analyzing trace with hash 88, now seen corresponding path program 1 times 21.08/10.38 [2019-03-28 12:03:17,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:17,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:17,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:17,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:17,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:17,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2590, now seen corresponding path program 1 times 21.08/10.38 [2019-03-28 12:03:17,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:17,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:17,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:17,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash 86197, now seen corresponding path program 1 times 21.08/10.38 [2019-03-28 12:03:17,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:17,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:17,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:17,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:17,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:17,436 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:17,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:17,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:17,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:17,438 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.08/10.38 [2019-03-28 12:03:17,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:17,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:17,438 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:17,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 21.08/10.38 [2019-03-28 12:03:17,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:17,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:17,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:17,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:17,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:17,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:17,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:17,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:17,665 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:17,666 INFO L412 LassoAnalysis]: Checking for nontermination... 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:17,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:17,675 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:17,683 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.08/10.38 [2019-03-28 12:03:17,683 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:17,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:17,713 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:17,717 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.08/10.38 [2019-03-28 12:03:17,717 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gcd_#res=0} Honda state: {ULTIMATE.start_gcd_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:17,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:17,746 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:17,750 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.08/10.38 [2019-03-28 12:03:17,750 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:17,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:17,779 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:17,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:17,817 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:18,056 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.08/10.38 [2019-03-28 12:03:18,058 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:18,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:18,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:18,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:18,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.08/10.38 [2019-03-28 12:03:18,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:18,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:18,060 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:18,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 21.08/10.38 [2019-03-28 12:03:18,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:18,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:18,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,173 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:18,179 INFO L497 LassoAnalysis]: Using template 'affine'. 21.08/10.38 [2019-03-28 12:03:18,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:18,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:18,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:18,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:18,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:18,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:18,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:18,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:18,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:18,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:18,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:18,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:18,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:18,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:18,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:18,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:18,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:18,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:18,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:18,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:18,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:18,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:18,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:18,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:18,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:18,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:18,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:18,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:18,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:18,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:18,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:18,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:18,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:18,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:18,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:18,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:18,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:18,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:18,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:18,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:18,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:18,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:18,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:18,261 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.08/10.38 [2019-03-28 12:03:18,302 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 21.08/10.38 [2019-03-28 12:03:18,302 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. 21.08/10.38 [2019-03-28 12:03:18,305 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.08/10.38 [2019-03-28 12:03:18,308 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 21.08/10.38 [2019-03-28 12:03:18,308 INFO L518 LassoAnalysis]: Proved termination. 21.08/10.38 [2019-03-28 12:03:18,309 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.08/10.38 Ranking function f(ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1) = 1*ULTIMATE.start_gcd_~y2 - 1*ULTIMATE.start_gcd_~y1 21.08/10.38 Supporting invariants [1*ULTIMATE.start_gcd_~y1 - 1 >= 0] 21.08/10.38 [2019-03-28 12:03:18,316 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 21.08/10.38 [2019-03-28 12:03:18,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:18,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:18,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:18,385 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:18,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.08/10.38 [2019-03-28 12:03:18,413 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 21.08/10.38 [2019-03-28 12:03:18,419 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 21.08/10.38 [2019-03-28 12:03:18,420 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. 21.08/10.38 [2019-03-28 12:03:18,500 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 9 states and 20 transitions. Complement of second has 6 states. 21.08/10.38 [2019-03-28 12:03:18,501 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 21.08/10.38 [2019-03-28 12:03:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 21.08/10.38 [2019-03-28 12:03:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. 21.08/10.38 [2019-03-28 12:03:18,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 1 letters. Loop has 2 letters. 21.08/10.38 [2019-03-28 12:03:18,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:18,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 2 letters. 21.08/10.38 [2019-03-28 12:03:18,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:18,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 1 letters. Loop has 4 letters. 21.08/10.38 [2019-03-28 12:03:18,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:18,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 20 transitions. 21.08/10.38 [2019-03-28 12:03:18,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 21.08/10.38 [2019-03-28 12:03:18,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 7 states and 15 transitions. 21.08/10.38 [2019-03-28 12:03:18,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 21.08/10.38 [2019-03-28 12:03:18,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 21.08/10.38 [2019-03-28 12:03:18,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 15 transitions. 21.08/10.38 [2019-03-28 12:03:18,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.08/10.38 [2019-03-28 12:03:18,523 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 15 transitions. 21.08/10.38 [2019-03-28 12:03:18,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 15 transitions. 21.08/10.38 [2019-03-28 12:03:18,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. 21.08/10.38 [2019-03-28 12:03:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 21.08/10.38 [2019-03-28 12:03:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. 21.08/10.38 [2019-03-28 12:03:18,555 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 15 transitions. 21.08/10.38 [2019-03-28 12:03:18,555 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 15 transitions. 21.08/10.38 [2019-03-28 12:03:18,555 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 21.08/10.38 [2019-03-28 12:03:18,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 15 transitions. 21.08/10.38 [2019-03-28 12:03:18,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 21.08/10.38 [2019-03-28 12:03:18,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.08/10.38 [2019-03-28 12:03:18,556 INFO L119 BuchiIsEmpty]: Starting construction of run 21.08/10.38 [2019-03-28 12:03:18,556 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 21.08/10.38 [2019-03-28 12:03:18,556 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 21.08/10.38 [2019-03-28 12:03:18,557 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 61#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 56#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 57#L15-2 21.08/10.38 [2019-03-28 12:03:18,558 INFO L796 eck$LassoCheckResult]: Loop: 57#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 62#L15 [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 57#L15-2 21.08/10.38 [2019-03-28 12:03:18,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:18,558 INFO L82 PathProgramCache]: Analyzing trace with hash 86213, now seen corresponding path program 1 times 21.08/10.38 [2019-03-28 12:03:18,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:18,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:18,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:18,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:18,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2590, now seen corresponding path program 2 times 21.08/10.38 [2019-03-28 12:03:18,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:18,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:18,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:18,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:18,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:18,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:18,577 INFO L82 PathProgramCache]: Analyzing trace with hash 82852322, now seen corresponding path program 1 times 21.08/10.38 [2019-03-28 12:03:18,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:18,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:18,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:18,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:18,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:18,655 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:18,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:18,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:18,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:18,655 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.08/10.38 [2019-03-28 12:03:18,656 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:18,656 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:18,656 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:18,656 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 21.08/10.38 [2019-03-28 12:03:18,656 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:18,656 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:18,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:18,776 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:18,776 INFO L412 LassoAnalysis]: Checking for nontermination... 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:18,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:18,785 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:18,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:18,831 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:19,077 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.08/10.38 [2019-03-28 12:03:19,080 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:19,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:19,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:19,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:19,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.08/10.38 [2019-03-28 12:03:19,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:19,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:19,081 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:19,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 21.08/10.38 [2019-03-28 12:03:19,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:19,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:19,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,180 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:19,181 INFO L497 LassoAnalysis]: Using template 'affine'. 21.08/10.38 [2019-03-28 12:03:19,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:19,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:19,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:19,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:19,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:19,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:19,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:19,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:19,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:19,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:19,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:19,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:19,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:19,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:19,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:19,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:19,216 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.08/10.38 [2019-03-28 12:03:19,233 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 21.08/10.38 [2019-03-28 12:03:19,233 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. 21.08/10.38 [2019-03-28 12:03:19,234 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.08/10.38 [2019-03-28 12:03:19,235 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 21.08/10.38 [2019-03-28 12:03:19,236 INFO L518 LassoAnalysis]: Proved termination. 21.08/10.38 [2019-03-28 12:03:19,236 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.08/10.38 Ranking function f(ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1) = 1*ULTIMATE.start_gcd_~y2 - 1*ULTIMATE.start_gcd_~y1 21.08/10.38 Supporting invariants [1*ULTIMATE.start_gcd_~y1 - 1 >= 0] 21.08/10.38 [2019-03-28 12:03:19,239 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 21.08/10.38 [2019-03-28 12:03:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:19,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:19,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:19,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:19,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.08/10.38 [2019-03-28 12:03:19,329 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 21.08/10.38 [2019-03-28 12:03:19,330 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates 21.08/10.38 [2019-03-28 12:03:19,330 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 15 transitions. cyclomatic complexity: 10 Second operand 4 states. 21.08/10.38 [2019-03-28 12:03:19,399 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 15 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 43 states and 86 transitions. Complement of second has 29 states. 21.08/10.38 [2019-03-28 12:03:19,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states 21.08/10.38 [2019-03-28 12:03:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 21.08/10.38 [2019-03-28 12:03:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. 21.08/10.38 [2019-03-28 12:03:19,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 2 letters. 21.08/10.38 [2019-03-28 12:03:19,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:19,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. 21.08/10.38 [2019-03-28 12:03:19,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:19,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 4 letters. 21.08/10.38 [2019-03-28 12:03:19,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:19,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 86 transitions. 21.08/10.38 [2019-03-28 12:03:19,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 21.08/10.38 [2019-03-28 12:03:19,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 16 states and 28 transitions. 21.08/10.38 [2019-03-28 12:03:19,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 21.08/10.38 [2019-03-28 12:03:19,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 21.08/10.38 [2019-03-28 12:03:19,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 28 transitions. 21.08/10.38 [2019-03-28 12:03:19,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 21.08/10.38 [2019-03-28 12:03:19,409 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 28 transitions. 21.08/10.38 [2019-03-28 12:03:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 28 transitions. 21.08/10.38 [2019-03-28 12:03:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 5. 21.08/10.38 [2019-03-28 12:03:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 21.08/10.38 [2019-03-28 12:03:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. 21.08/10.38 [2019-03-28 12:03:19,411 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 9 transitions. 21.08/10.38 [2019-03-28 12:03:19,411 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 9 transitions. 21.08/10.38 [2019-03-28 12:03:19,411 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 21.08/10.38 [2019-03-28 12:03:19,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 9 transitions. 21.08/10.38 [2019-03-28 12:03:19,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 21.08/10.38 [2019-03-28 12:03:19,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.08/10.38 [2019-03-28 12:03:19,412 INFO L119 BuchiIsEmpty]: Starting construction of run 21.08/10.38 [2019-03-28 12:03:19,412 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 21.08/10.38 [2019-03-28 12:03:19,412 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 21.08/10.38 [2019-03-28 12:03:19,413 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 180#L15-2 21.08/10.38 [2019-03-28 12:03:19,413 INFO L796 eck$LassoCheckResult]: Loop: 180#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 179#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 180#L15-2 21.08/10.38 [2019-03-28 12:03:19,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:19,414 INFO L82 PathProgramCache]: Analyzing trace with hash 88, now seen corresponding path program 2 times 21.08/10.38 [2019-03-28 12:03:19,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:19,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:19,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:19,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:19,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2575, now seen corresponding path program 1 times 21.08/10.38 [2019-03-28 12:03:19,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:19,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:19,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.08/10.38 [2019-03-28 12:03:19,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 21.08/10.38 [2019-03-28 12:03:19,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 21.08/10.38 [2019-03-28 12:03:19,459 INFO L811 eck$LassoCheckResult]: loop already infeasible 21.08/10.38 [2019-03-28 12:03:19,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 21.08/10.38 [2019-03-28 12:03:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 21.08/10.38 [2019-03-28 12:03:19,463 INFO L87 Difference]: Start difference. First operand 5 states and 9 transitions. cyclomatic complexity: 5 Second operand 3 states. 21.08/10.38 [2019-03-28 12:03:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 21.08/10.38 [2019-03-28 12:03:19,477 INFO L93 Difference]: Finished difference Result 6 states and 9 transitions. 21.08/10.38 [2019-03-28 12:03:19,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 21.08/10.38 [2019-03-28 12:03:19,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 9 transitions. 21.08/10.38 [2019-03-28 12:03:19,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 21.08/10.38 [2019-03-28 12:03:19,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 5 states and 7 transitions. 21.08/10.38 [2019-03-28 12:03:19,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 21.08/10.38 [2019-03-28 12:03:19,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 21.08/10.38 [2019-03-28 12:03:19,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 7 transitions. 21.08/10.38 [2019-03-28 12:03:19,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 21.08/10.38 [2019-03-28 12:03:19,481 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. 21.08/10.38 [2019-03-28 12:03:19,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 7 transitions. 21.08/10.38 [2019-03-28 12:03:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. 21.08/10.38 [2019-03-28 12:03:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 21.08/10.38 [2019-03-28 12:03:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. 21.08/10.38 [2019-03-28 12:03:19,482 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. 21.08/10.38 [2019-03-28 12:03:19,482 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. 21.08/10.38 [2019-03-28 12:03:19,482 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 21.08/10.38 [2019-03-28 12:03:19,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. 21.08/10.38 [2019-03-28 12:03:19,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 21.08/10.38 [2019-03-28 12:03:19,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.08/10.38 [2019-03-28 12:03:19,483 INFO L119 BuchiIsEmpty]: Starting construction of run 21.08/10.38 [2019-03-28 12:03:19,483 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 21.08/10.38 [2019-03-28 12:03:19,483 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 21.08/10.38 [2019-03-28 12:03:19,484 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 197#L15-2 21.08/10.38 [2019-03-28 12:03:19,484 INFO L796 eck$LassoCheckResult]: Loop: 197#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 196#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 197#L15-2 21.08/10.38 [2019-03-28 12:03:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:19,484 INFO L82 PathProgramCache]: Analyzing trace with hash 88, now seen corresponding path program 3 times 21.08/10.38 [2019-03-28 12:03:19,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:19,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:19,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:19,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2606, now seen corresponding path program 1 times 21.08/10.38 [2019-03-28 12:03:19,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:19,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:19,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:19,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:19,496 INFO L82 PathProgramCache]: Analyzing trace with hash 86213, now seen corresponding path program 2 times 21.08/10.38 [2019-03-28 12:03:19,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:19,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:19,535 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:19,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:19,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:19,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:19,535 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.08/10.38 [2019-03-28 12:03:19,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:19,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:19,536 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:19,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 21.08/10.38 [2019-03-28 12:03:19,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:19,536 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:19,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:19,671 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:19,671 INFO L412 LassoAnalysis]: Checking for nontermination... 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:19,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:19,677 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:19,681 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.08/10.38 [2019-03-28 12:03:19,681 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:19,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:19,711 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:19,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.08/10.38 [2019-03-28 12:03:19,715 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:19,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:19,745 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:19,748 INFO L445 LassoAnalysis]: Proved nontermination for one component. 21.08/10.38 [2019-03-28 12:03:19,749 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:19,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:19,780 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:19,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:19,816 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:20,062 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.08/10.38 [2019-03-28 12:03:20,064 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:20,065 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:20,065 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:20,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:20,065 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.08/10.38 [2019-03-28 12:03:20,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:20,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:20,065 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:20,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 21.08/10.38 [2019-03-28 12:03:20,066 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:20,066 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:20,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,154 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:20,154 INFO L497 LassoAnalysis]: Using template 'affine'. 21.08/10.38 [2019-03-28 12:03:20,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:20,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:20,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:20,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:20,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:20,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:20,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:20,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:20,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,187 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.08/10.38 [2019-03-28 12:03:20,198 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 21.08/10.38 [2019-03-28 12:03:20,198 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. 21.08/10.38 [2019-03-28 12:03:20,199 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.08/10.38 [2019-03-28 12:03:20,200 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 21.08/10.38 [2019-03-28 12:03:20,201 INFO L518 LassoAnalysis]: Proved termination. 21.08/10.38 [2019-03-28 12:03:20,201 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.08/10.38 Ranking function f(ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1) = -1*ULTIMATE.start_gcd_~y2 + 1*ULTIMATE.start_gcd_~y1 21.08/10.38 Supporting invariants [1*ULTIMATE.start_gcd_~y2 - 1 >= 0] 21.08/10.38 [2019-03-28 12:03:20,204 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 21.08/10.38 [2019-03-28 12:03:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:20,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:20,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:20,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:20,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.08/10.38 [2019-03-28 12:03:20,306 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 21.08/10.38 [2019-03-28 12:03:20,306 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 21.08/10.38 [2019-03-28 12:03:20,307 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. 21.08/10.38 [2019-03-28 12:03:20,351 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 6 states. 21.08/10.38 [2019-03-28 12:03:20,352 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 21.08/10.38 [2019-03-28 12:03:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 21.08/10.38 [2019-03-28 12:03:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. 21.08/10.38 [2019-03-28 12:03:20,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 2 letters. 21.08/10.38 [2019-03-28 12:03:20,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:20,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 2 letters. 21.08/10.38 [2019-03-28 12:03:20,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:20,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 4 letters. 21.08/10.38 [2019-03-28 12:03:20,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:20,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. 21.08/10.38 [2019-03-28 12:03:20,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 21.08/10.38 [2019-03-28 12:03:20,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. 21.08/10.38 [2019-03-28 12:03:20,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 21.08/10.38 [2019-03-28 12:03:20,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 21.08/10.38 [2019-03-28 12:03:20,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. 21.08/10.38 [2019-03-28 12:03:20,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 21.08/10.38 [2019-03-28 12:03:20,357 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. 21.08/10.38 [2019-03-28 12:03:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. 21.08/10.38 [2019-03-28 12:03:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. 21.08/10.38 [2019-03-28 12:03:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 21.08/10.38 [2019-03-28 12:03:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. 21.08/10.38 [2019-03-28 12:03:20,359 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 21.08/10.38 [2019-03-28 12:03:20,359 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 21.08/10.38 [2019-03-28 12:03:20,359 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 21.08/10.38 [2019-03-28 12:03:20,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. 21.08/10.38 [2019-03-28 12:03:20,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 21.08/10.38 [2019-03-28 12:03:20,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.08/10.38 [2019-03-28 12:03:20,360 INFO L119 BuchiIsEmpty]: Starting construction of run 21.08/10.38 [2019-03-28 12:03:20,360 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 21.08/10.38 [2019-03-28 12:03:20,360 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 21.08/10.38 [2019-03-28 12:03:20,361 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 260#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 261#L15 [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 262#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 255#L15 21.08/10.38 [2019-03-28 12:03:20,361 INFO L796 eck$LassoCheckResult]: Loop: 255#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 256#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 255#L15 21.08/10.38 [2019-03-28 12:03:20,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:20,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2672159, now seen corresponding path program 1 times 21.08/10.38 [2019-03-28 12:03:20,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:20,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:20,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:20,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:20,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:20,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:20,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2036, now seen corresponding path program 2 times 21.08/10.38 [2019-03-28 12:03:20,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:20,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:20,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:20,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1727021422, now seen corresponding path program 2 times 21.08/10.38 [2019-03-28 12:03:20,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:20,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:20,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:20,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:20,439 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:20,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:20,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:20,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:20,440 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.08/10.38 [2019-03-28 12:03:20,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:20,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:20,441 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:20,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 21.08/10.38 [2019-03-28 12:03:20,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:20,441 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:20,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,534 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:20,534 INFO L412 LassoAnalysis]: Checking for nontermination... 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:20,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:20,541 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:20,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:20,579 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:20,876 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.08/10.38 [2019-03-28 12:03:20,879 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:20,879 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:20,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:20,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:20,880 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.08/10.38 [2019-03-28 12:03:20,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:20,880 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:20,880 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:20,880 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 21.08/10.38 [2019-03-28 12:03:20,880 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:20,881 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:20,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:20,961 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:20,961 INFO L497 LassoAnalysis]: Using template 'affine'. 21.08/10.38 [2019-03-28 12:03:20,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:20,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:20,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:20,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:20,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:20,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:20,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:20,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:20,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:20,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 21.08/10.38 [2019-03-28 12:03:20,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:20,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:20,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:20,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:20,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:20,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:20,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:20,992 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.08/10.38 [2019-03-28 12:03:21,002 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 21.08/10.38 [2019-03-28 12:03:21,002 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. 21.08/10.38 [2019-03-28 12:03:21,003 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.08/10.38 [2019-03-28 12:03:21,004 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 21.08/10.38 [2019-03-28 12:03:21,004 INFO L518 LassoAnalysis]: Proved termination. 21.08/10.38 [2019-03-28 12:03:21,004 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.08/10.38 Ranking function f(ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1) = -1*ULTIMATE.start_gcd_~y2 + 1*ULTIMATE.start_gcd_~y1 21.08/10.38 Supporting invariants [1*ULTIMATE.start_gcd_~y2 - 1 >= 0] 21.08/10.38 [2019-03-28 12:03:21,007 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 21.08/10.38 [2019-03-28 12:03:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:21,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:21,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:21,074 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:21,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.08/10.38 [2019-03-28 12:03:21,121 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 21.08/10.38 [2019-03-28 12:03:21,121 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates 21.08/10.38 [2019-03-28 12:03:21,121 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 5 states. 21.08/10.38 [2019-03-28 12:03:21,194 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 16 states and 20 transitions. Complement of second has 8 states. 21.08/10.38 [2019-03-28 12:03:21,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states 21.08/10.38 [2019-03-28 12:03:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 21.08/10.38 [2019-03-28 12:03:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. 21.08/10.38 [2019-03-28 12:03:21,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 2 letters. 21.08/10.38 [2019-03-28 12:03:21,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:21,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. 21.08/10.38 [2019-03-28 12:03:21,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:21,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. 21.08/10.38 [2019-03-28 12:03:21,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:21,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. 21.08/10.38 [2019-03-28 12:03:21,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 21.08/10.38 [2019-03-28 12:03:21,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. 21.08/10.38 [2019-03-28 12:03:21,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 21.08/10.38 [2019-03-28 12:03:21,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 21.08/10.38 [2019-03-28 12:03:21,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. 21.08/10.38 [2019-03-28 12:03:21,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 21.08/10.38 [2019-03-28 12:03:21,201 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. 21.08/10.38 [2019-03-28 12:03:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. 21.08/10.38 [2019-03-28 12:03:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. 21.08/10.38 [2019-03-28 12:03:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 21.08/10.38 [2019-03-28 12:03:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. 21.08/10.38 [2019-03-28 12:03:21,202 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 21.08/10.38 [2019-03-28 12:03:21,202 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 21.08/10.38 [2019-03-28 12:03:21,202 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 21.08/10.38 [2019-03-28 12:03:21,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. 21.08/10.38 [2019-03-28 12:03:21,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 21.08/10.38 [2019-03-28 12:03:21,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 21.08/10.38 [2019-03-28 12:03:21,203 INFO L119 BuchiIsEmpty]: Starting construction of run 21.08/10.38 [2019-03-28 12:03:21,203 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 21.08/10.38 [2019-03-28 12:03:21,203 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 21.08/10.38 [2019-03-28 12:03:21,204 INFO L794 eck$LassoCheckResult]: Stem: 340#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 341#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 342#L15 [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 343#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 337#L15 21.08/10.38 [2019-03-28 12:03:21,204 INFO L796 eck$LassoCheckResult]: Loop: 337#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 338#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 342#L15 [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 343#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 337#L15 21.08/10.38 [2019-03-28 12:03:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2672159, now seen corresponding path program 2 times 21.08/10.38 [2019-03-28 12:03:21,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:21,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:21,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:21,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:21,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1957175, now seen corresponding path program 1 times 21.08/10.38 [2019-03-28 12:03:21,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:21,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:21,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:21,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:21,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1810209707, now seen corresponding path program 3 times 21.08/10.38 [2019-03-28 12:03:21,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 21.08/10.38 [2019-03-28 12:03:21,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 21.08/10.38 [2019-03-28 12:03:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:21,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:21,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 21.08/10.38 [2019-03-28 12:03:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 21.08/10.38 [2019-03-28 12:03:21,259 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:21,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:21,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:21,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:21,259 INFO L127 ssoRankerPreferences]: Use exernal solver: true 21.08/10.38 [2019-03-28 12:03:21,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:21,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:21,260 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:21,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 21.08/10.38 [2019-03-28 12:03:21,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:21,260 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:21,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:21,293 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:21,293 INFO L412 LassoAnalysis]: Checking for nontermination... 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:21,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:21,298 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 21.08/10.38 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 21.08/10.38 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:21,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 21.08/10.38 [2019-03-28 12:03:21,329 INFO L163 nArgumentSynthesizer]: Using integer mode. 21.08/10.38 [2019-03-28 12:03:21,762 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 21.08/10.38 [2019-03-28 12:03:21,765 INFO L216 LassoAnalysis]: Preferences: 21.08/10.38 [2019-03-28 12:03:21,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 21.08/10.38 [2019-03-28 12:03:21,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 21.08/10.38 [2019-03-28 12:03:21,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 21.08/10.38 [2019-03-28 12:03:21,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false 21.08/10.38 [2019-03-28 12:03:21,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 21.08/10.38 [2019-03-28 12:03:21,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 21.08/10.38 [2019-03-28 12:03:21,766 INFO L130 ssoRankerPreferences]: Path of dumped script: 21.08/10.38 [2019-03-28 12:03:21,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 21.08/10.38 [2019-03-28 12:03:21,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 21.08/10.38 [2019-03-28 12:03:21,766 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 21.08/10.38 [2019-03-28 12:03:21,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 21.08/10.38 [2019-03-28 12:03:21,797 INFO L300 LassoAnalysis]: Preprocessing complete. 21.08/10.38 [2019-03-28 12:03:21,798 INFO L497 LassoAnalysis]: Using template 'affine'. 21.08/10.38 [2019-03-28 12:03:21,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 21.08/10.38 Termination analysis: LINEAR_WITH_GUESSES 21.08/10.38 Number of strict supporting invariants: 0 21.08/10.38 Number of non-strict supporting invariants: 1 21.08/10.38 Consider only non-deceasing supporting invariants: true 21.08/10.38 Simplify termination arguments: true 21.08/10.38 Simplify supporting invariants: trueOverapproximate stem: false 21.08/10.38 [2019-03-28 12:03:21,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. 21.08/10.38 [2019-03-28 12:03:21,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 21.08/10.38 [2019-03-28 12:03:21,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 21.08/10.38 [2019-03-28 12:03:21,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 21.08/10.38 [2019-03-28 12:03:21,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 21.08/10.38 [2019-03-28 12:03:21,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 21.08/10.38 [2019-03-28 12:03:21,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 21.08/10.38 [2019-03-28 12:03:21,803 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 21.08/10.38 [2019-03-28 12:03:21,807 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 21.08/10.38 [2019-03-28 12:03:21,807 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 21.08/10.38 [2019-03-28 12:03:21,807 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 21.08/10.38 [2019-03-28 12:03:21,807 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 21.08/10.38 [2019-03-28 12:03:21,807 INFO L518 LassoAnalysis]: Proved termination. 21.08/10.38 [2019-03-28 12:03:21,808 INFO L520 LassoAnalysis]: Termination argument consisting of: 21.08/10.38 Ranking function f(ULTIMATE.start_gcd_~y1) = 1*ULTIMATE.start_gcd_~y1 21.08/10.38 Supporting invariants [] 21.08/10.38 [2019-03-28 12:03:21,808 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 21.08/10.38 [2019-03-28 12:03:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 21.08/10.38 [2019-03-28 12:03:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:21,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:21,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:21,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:21,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 21.08/10.38 [2019-03-28 12:03:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:21,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:21,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 21.08/10.38 [2019-03-28 12:03:21,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core 21.08/10.38 [2019-03-28 12:03:21,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... 21.08/10.38 [2019-03-28 12:03:21,932 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 7 predicates after loop cannibalization 21.08/10.38 [2019-03-28 12:03:21,933 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 21.08/10.38 [2019-03-28 12:03:21,933 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. 21.08/10.38 [2019-03-28 12:03:22,217 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 61 states and 87 transitions. Complement of second has 43 states. 21.08/10.38 [2019-03-28 12:03:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 2 accepting loop states 21.08/10.38 [2019-03-28 12:03:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 21.08/10.38 [2019-03-28 12:03:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. 21.08/10.38 [2019-03-28 12:03:22,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 4 letters. Loop has 4 letters. 21.08/10.38 [2019-03-28 12:03:22,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:22,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. 21.08/10.38 [2019-03-28 12:03:22,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:22,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 4 letters. Loop has 8 letters. 21.08/10.38 [2019-03-28 12:03:22,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. 21.08/10.38 [2019-03-28 12:03:22,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. 21.08/10.38 [2019-03-28 12:03:22,223 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 21.08/10.38 [2019-03-28 12:03:22,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. 21.08/10.38 [2019-03-28 12:03:22,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 21.08/10.38 [2019-03-28 12:03:22,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 21.08/10.38 [2019-03-28 12:03:22,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 21.08/10.38 [2019-03-28 12:03:22,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 21.08/10.38 [2019-03-28 12:03:22,224 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.08/10.38 [2019-03-28 12:03:22,224 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.08/10.38 [2019-03-28 12:03:22,224 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 21.08/10.38 [2019-03-28 12:03:22,224 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 21.08/10.38 [2019-03-28 12:03:22,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 21.08/10.38 [2019-03-28 12:03:22,224 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 21.08/10.38 [2019-03-28 12:03:22,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 21.08/10.38 [2019-03-28 12:03:22,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:03:22 BasicIcfg 21.08/10.38 [2019-03-28 12:03:22,231 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 21.08/10.38 [2019-03-28 12:03:22,231 INFO L168 Benchmark]: Toolchain (without parser) took 5856.12 ms. Allocated memory was 649.6 MB in the beginning and 755.5 MB in the end (delta: 105.9 MB). Free memory was 559.5 MB in the beginning and 402.9 MB in the end (delta: 156.7 MB). Peak memory consumption was 262.6 MB. Max. memory is 50.3 GB. 21.08/10.38 [2019-03-28 12:03:22,233 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 21.08/10.38 [2019-03-28 12:03:22,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.46 ms. Allocated memory is still 649.6 MB. Free memory was 559.5 MB in the beginning and 550.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 21.08/10.38 [2019-03-28 12:03:22,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.42 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 550.0 MB in the beginning and 646.0 MB in the end (delta: -96.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 50.3 GB. 21.08/10.38 [2019-03-28 12:03:22,235 INFO L168 Benchmark]: Boogie Preprocessor took 19.63 ms. Allocated memory is still 678.4 MB. Free memory was 646.0 MB in the beginning and 642.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 21.08/10.38 [2019-03-28 12:03:22,235 INFO L168 Benchmark]: RCFGBuilder took 210.33 ms. Allocated memory is still 678.4 MB. Free memory was 642.9 MB in the beginning and 627.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 50.3 GB. 21.08/10.38 [2019-03-28 12:03:22,236 INFO L168 Benchmark]: BlockEncodingV2 took 82.72 ms. Allocated memory is still 678.4 MB. Free memory was 627.6 MB in the beginning and 622.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 21.08/10.38 [2019-03-28 12:03:22,236 INFO L168 Benchmark]: TraceAbstraction took 154.51 ms. Allocated memory is still 678.4 MB. Free memory was 620.8 MB in the beginning and 612.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 21.08/10.38 [2019-03-28 12:03:22,237 INFO L168 Benchmark]: BuchiAutomizer took 5068.78 ms. Allocated memory was 678.4 MB in the beginning and 755.5 MB in the end (delta: 77.1 MB). Free memory was 612.8 MB in the beginning and 402.9 MB in the end (delta: 209.9 MB). Peak memory consumption was 287.0 MB. Max. memory is 50.3 GB. 21.08/10.38 [2019-03-28 12:03:22,241 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 21.08/10.38 --- Results --- 21.08/10.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 21.08/10.38 - StatisticsResult: Initial Icfg 21.08/10.38 10 locations, 13 edges 21.08/10.38 - StatisticsResult: Encoded RCFG 21.08/10.38 3 locations, 5 edges 21.08/10.38 * Results from de.uni_freiburg.informatik.ultimate.core: 21.08/10.38 - StatisticsResult: Toolchain Benchmarks 21.08/10.38 Benchmark results are: 21.08/10.38 * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 21.08/10.38 * CACSL2BoogieTranslator took 225.46 ms. Allocated memory is still 649.6 MB. Free memory was 559.5 MB in the beginning and 550.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 21.08/10.38 * Boogie Procedure Inliner took 89.42 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 550.0 MB in the beginning and 646.0 MB in the end (delta: -96.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 50.3 GB. 21.08/10.38 * Boogie Preprocessor took 19.63 ms. Allocated memory is still 678.4 MB. Free memory was 646.0 MB in the beginning and 642.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 21.08/10.38 * RCFGBuilder took 210.33 ms. Allocated memory is still 678.4 MB. Free memory was 642.9 MB in the beginning and 627.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 50.3 GB. 21.08/10.38 * BlockEncodingV2 took 82.72 ms. Allocated memory is still 678.4 MB. Free memory was 627.6 MB in the beginning and 622.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 21.08/10.38 * TraceAbstraction took 154.51 ms. Allocated memory is still 678.4 MB. Free memory was 620.8 MB in the beginning and 612.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 21.08/10.38 * BuchiAutomizer took 5068.78 ms. Allocated memory was 678.4 MB in the beginning and 755.5 MB in the end (delta: 77.1 MB). Free memory was 612.8 MB in the beginning and 402.9 MB in the end (delta: 209.9 MB). Peak memory consumption was 287.0 MB. Max. memory is 50.3 GB. 21.08/10.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 21.08/10.38 - AllSpecificationsHoldResult: All specifications hold 21.08/10.38 We were not able to verify any specifiation because the program does not contain any specification. 21.08/10.38 - InvariantResult [Line: 14]: Loop Invariant 21.08/10.38 Derived loop invariant: 1 21.08/10.38 - StatisticsResult: Ultimate Automizer benchmark data 21.08/10.38 CFG has 1 procedures, 3 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=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 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 21.08/10.38 - StatisticsResult: Constructed decomposition of program 21.08/10.38 Your program was decomposed into 6 terminating modules (1 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function y2 + -1 * y1 and consists of 4 locations. One nondeterministic module has affine ranking function y2 + -1 * y1 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * y2 + y1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y2 + y1 and consists of 5 locations. One nondeterministic module has affine ranking function y1 and consists of 11 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 21.08/10.38 - StatisticsResult: Timing statistics 21.08/10.38 BüchiAutomizer plugin needed 5.0s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 11 SDtfs, 62 SDslu, 0 SDs, 0 SdLazy, 134 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax100 hnf91 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq175 hnf91 smp100 dnf100 smp100 tf101 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 109ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s 21.08/10.38 - TerminationAnalysisResult: Termination proven 21.08/10.38 Buchi Automizer proved that your program is terminating 21.08/10.38 RESULT: Ultimate proved your program to be correct! 21.08/10.38 !SESSION 2019-03-28 12:03:13.056 ----------------------------------------------- 21.08/10.38 eclipse.buildId=unknown 21.08/10.38 java.version=1.8.0_181 21.08/10.38 java.vendor=Oracle Corporation 21.08/10.38 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 21.08/10.38 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 21.08/10.38 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 21.08/10.38 21.08/10.38 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:03:22.475 21.08/10.38 !MESSAGE The workspace will exit with unsaved changes in this session. 21.08/10.38 Received shutdown request... 21.08/10.38 Ultimate: 21.08/10.38 GTK+ Version Check 21.08/10.38 EOF