./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c721a987debd4748cfed075333b7fa46c2d0f9ef ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:48:46,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:48:46,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:48:46,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:48:46,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:48:46,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:48:46,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:48:46,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:48:46,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:48:46,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:48:46,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:48:46,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:48:46,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:48:46,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:48:47,000 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:48:47,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:48:47,002 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:48:47,003 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:48:47,005 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:48:47,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:48:47,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:48:47,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:48:47,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:48:47,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:48:47,010 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:48:47,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:48:47,011 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:48:47,012 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:48:47,012 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:48:47,013 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:48:47,014 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:48:47,014 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:48:47,014 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:48:47,015 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:48:47,015 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:48:47,016 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:48:47,016 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 22:48:47,029 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:48:47,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:48:47,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:48:47,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:48:47,030 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:48:47,031 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:48:47,031 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:48:47,031 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:48:47,031 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:48:47,031 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:48:47,031 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:48:47,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:48:47,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:48:47,032 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:48:47,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:48:47,032 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:48:47,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:48:47,033 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:48:47,033 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:48:47,033 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:48:47,033 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:48:47,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:48:47,033 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:48:47,034 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:48:47,034 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:48:47,034 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:48:47,034 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:48:47,034 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:48:47,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:48:47,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:48:47,035 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:48:47,035 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:48:47,035 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c721a987debd4748cfed075333b7fa46c2d0f9ef [2018-11-22 22:48:47,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:48:47,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:48:47,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:48:47,078 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:48:47,078 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:48:47,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i [2018-11-22 22:48:47,131 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/data/2ca65422e/7e54cd4042a245c6be934051a8a8082c/FLAG2d2e9f6f6 [2018-11-22 22:48:47,481 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:48:47,481 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/sv-benchmarks/c/reducercommutativity/max_true-unreach-call_true-termination.i [2018-11-22 22:48:47,486 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/data/2ca65422e/7e54cd4042a245c6be934051a8a8082c/FLAG2d2e9f6f6 [2018-11-22 22:48:47,908 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/data/2ca65422e/7e54cd4042a245c6be934051a8a8082c [2018-11-22 22:48:47,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:48:47,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:48:47,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:48:47,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:48:47,916 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:48:47,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:48:47" (1/1) ... [2018-11-22 22:48:47,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:47, skipping insertion in model container [2018-11-22 22:48:47,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:48:47" (1/1) ... [2018-11-22 22:48:47,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:48:47,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:48:48,052 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:48:48,057 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:48:48,070 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:48:48,079 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:48:48,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48 WrapperNode [2018-11-22 22:48:48,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:48:48,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:48:48,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:48:48,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:48:48,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... [2018-11-22 22:48:48,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... [2018-11-22 22:48:48,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:48:48,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:48:48,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:48:48,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:48:48,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... [2018-11-22 22:48:48,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... [2018-11-22 22:48:48,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... [2018-11-22 22:48:48,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... [2018-11-22 22:48:48,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... [2018-11-22 22:48:48,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... [2018-11-22 22:48:48,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... [2018-11-22 22:48:48,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:48:48,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:48:48,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:48:48,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:48:48,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:48:48,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:48:48,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:48:48,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:48:48,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:48:48,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:48:48,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:48:48,397 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:48:48,397 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-22 22:48:48,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:48:48 BoogieIcfgContainer [2018-11-22 22:48:48,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:48:48,398 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:48:48,399 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:48:48,401 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:48:48,402 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:48:48,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:48:47" (1/3) ... [2018-11-22 22:48:48,403 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d6e7c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:48:48, skipping insertion in model container [2018-11-22 22:48:48,403 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:48:48,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:48" (2/3) ... [2018-11-22 22:48:48,403 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d6e7c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:48:48, skipping insertion in model container [2018-11-22 22:48:48,403 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:48:48,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:48:48" (3/3) ... [2018-11-22 22:48:48,406 INFO L375 chiAutomizerObserver]: Analyzing ICFG max_true-unreach-call_true-termination.i [2018-11-22 22:48:48,445 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:48:48,446 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:48:48,446 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:48:48,446 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:48:48,446 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:48:48,446 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:48:48,446 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:48:48,446 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:48:48,446 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:48:48,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-22 22:48:48,471 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-22 22:48:48,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:48,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:48,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:48:48,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:48:48,475 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:48:48,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-22 22:48:48,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-22 22:48:48,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:48,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:48,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:48:48,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:48:48,482 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 8#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 6#L11-3true [2018-11-22 22:48:48,482 INFO L796 eck$LassoCheckResult]: Loop: 6#L11-3true assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 12#L12true assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 11#L12-2true max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 7#L11-2true max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6#L11-3true [2018-11-22 22:48:48,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-22 22:48:48,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:48,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:48,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:48,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:48,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times [2018-11-22 22:48:48,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:48,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:48,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:48,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:48,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:48,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times [2018-11-22 22:48:48,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:48,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:48,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:48,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:48,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:48,753 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:48:48,754 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:48:48,754 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:48:48,754 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:48:48,754 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:48:48,754 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:48:48,754 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:48:48,754 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:48:48,755 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-22 22:48:48,755 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:48:48,755 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:48:48,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:48,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:49,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:48:49,122 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:48:49,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:49,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:49,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:49,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:49,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:49,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:49,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:49,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:49,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:49,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,195 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:48:49,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,198 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:48:49,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:49,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:49,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:49,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:49,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:49,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:49,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:49,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:49,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:49,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:49,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:49,261 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:48:49,277 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:48:49,277 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:48:49,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:48:49,282 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:48:49,283 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:48:49,283 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_max_~x.base)_1, ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset) = 1*v_rep(select #length ULTIMATE.start_max_~x.base)_1 - 4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2018-11-22 22:48:49,306 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:48:49,311 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:48:49,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:49,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:49,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:49,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:48:49,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2018-11-22 22:48:49,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 63 states and 87 transitions. Complement of second has 8 states. [2018-11-22 22:48:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 22:48:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:48:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-22 22:48:49,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-22 22:48:49,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:49,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-22 22:48:49,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:49,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-22 22:48:49,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:49,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2018-11-22 22:48:49,439 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:49,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions. [2018-11-22 22:48:49,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-22 22:48:49,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-22 22:48:49,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2018-11-22 22:48:49,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:48:49,443 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-22 22:48:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2018-11-22 22:48:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-22 22:48:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 22:48:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-11-22 22:48:49,461 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-22 22:48:49,461 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-22 22:48:49,461 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:48:49,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2018-11-22 22:48:49,462 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:49,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:49,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:49,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-22 22:48:49,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:48:49,463 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 171#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 169#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 164#L11-3 assume !(max_~i~0 < ~N~0); 160#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 161#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 176#L11-8 [2018-11-22 22:48:49,463 INFO L796 eck$LassoCheckResult]: Loop: 176#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 168#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 158#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 159#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 176#L11-8 [2018-11-22 22:48:49,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times [2018-11-22 22:48:49,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:49,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:49,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:48:49,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:48:49,501 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:48:49,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times [2018-11-22 22:48:49,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:49,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:49,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:48:49,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:48:49,561 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-22 22:48:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:48:49,591 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2018-11-22 22:48:49,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:48:49,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-22 22:48:49,592 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:49,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2018-11-22 22:48:49,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-22 22:48:49,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-22 22:48:49,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2018-11-22 22:48:49,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:48:49,593 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-22 22:48:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2018-11-22 22:48:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-11-22 22:48:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 22:48:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-22 22:48:49,595 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-22 22:48:49,595 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-22 22:48:49,595 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:48:49,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-22 22:48:49,596 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:49,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:49,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:49,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:49,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:48:49,597 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 226#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 224#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 219#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 220#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 227#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 222#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 221#L11-3 assume !(max_~i~0 < ~N~0); 215#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 216#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 231#L11-8 [2018-11-22 22:48:49,597 INFO L796 eck$LassoCheckResult]: Loop: 231#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 223#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 213#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 214#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 231#L11-8 [2018-11-22 22:48:49,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:49,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times [2018-11-22 22:48:49,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:49,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:49,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:49,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:49,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:48:49,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:48:49,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:49,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:49,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:48:49,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-22 22:48:49,707 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:48:49,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times [2018-11-22 22:48:49,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:49,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:48:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:48:49,758 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-22 22:48:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:48:49,813 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2018-11-22 22:48:49,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:48:49,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2018-11-22 22:48:49,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:49,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2018-11-22 22:48:49,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-22 22:48:49,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-22 22:48:49,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2018-11-22 22:48:49,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:48:49,816 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-22 22:48:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2018-11-22 22:48:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-22 22:48:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 22:48:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-11-22 22:48:49,818 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-22 22:48:49,818 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-22 22:48:49,818 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:48:49,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-11-22 22:48:49,819 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:49,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:49,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:49,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:49,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:48:49,819 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 315#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 314#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 308#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 309#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 324#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 312#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 310#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 311#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 317#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 318#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 323#L11-3 assume !(max_~i~0 < ~N~0); 302#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 303#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 322#L11-8 [2018-11-22 22:48:49,819 INFO L796 eck$LassoCheckResult]: Loop: 322#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 313#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 304#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 305#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 322#L11-8 [2018-11-22 22:48:49,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:49,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times [2018-11-22 22:48:49,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:49,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:49,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:49,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 3 times [2018-11-22 22:48:49,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:49,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:49,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1198284866, now seen corresponding path program 1 times [2018-11-22 22:48:49,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:49,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:50,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:48:50,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:48:50,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:50,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:50,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-22 22:48:50,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:48:50,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-22 22:48:50,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:48:50,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-22 22:48:50,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 22:48:50,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:50,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:50,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:50,304 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2018-11-22 22:48:50,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-22 22:48:50,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-22 22:48:50,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:48:50,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:50,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:50,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-22 22:48:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:50,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:48:50,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-11-22 22:48:50,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-22 22:48:50,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-11-22 22:48:50,387 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand 18 states. [2018-11-22 22:48:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:48:51,419 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-11-22 22:48:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-22 22:48:51,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 126 transitions. [2018-11-22 22:48:51,420 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 22 [2018-11-22 22:48:51,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 126 transitions. [2018-11-22 22:48:51,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-11-22 22:48:51,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-11-22 22:48:51,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 126 transitions. [2018-11-22 22:48:51,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:48:51,423 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-11-22 22:48:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 126 transitions. [2018-11-22 22:48:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 39. [2018-11-22 22:48:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 22:48:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-22 22:48:51,426 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-22 22:48:51,426 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-22 22:48:51,426 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:48:51,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2018-11-22 22:48:51,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:51,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:51,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:51,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:51,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:48:51,427 INFO L794 eck$LassoCheckResult]: Stem: 550#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 547#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 545#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 539#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 540#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 548#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 549#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 567#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 559#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 562#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 563#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 557#L11-3 assume !(max_~i~0 < ~N~0); 558#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 556#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 554#L11-8 [2018-11-22 22:48:51,427 INFO L796 eck$LassoCheckResult]: Loop: 554#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 555#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 535#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 536#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 554#L11-8 [2018-11-22 22:48:51,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2083741857, now seen corresponding path program 1 times [2018-11-22 22:48:51,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:51,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:51,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:51,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 4 times [2018-11-22 22:48:51,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:51,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:51,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:51,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2085565180, now seen corresponding path program 1 times [2018-11-22 22:48:51,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:51,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:51,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:51,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:51,747 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2018-11-22 22:48:51,880 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-22 22:48:51,881 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:48:51,882 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:48:51,882 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:48:51,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:48:51,882 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:48:51,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:48:51,882 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:48:51,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:48:51,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-22 22:48:51,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:48:51,882 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:48:51,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:51,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:51,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:51,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:51,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:51,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:51,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:51,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:51,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:51,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,084 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-11-22 22:48:52,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:52,332 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:48:52,332 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:48:52,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:52,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:52,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:52,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:52,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:52,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:52,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:52,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:52,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:52,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:52,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:52,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:52,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:52,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:52,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:52,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:52,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:52,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:52,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:52,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:52,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:52,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:52,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:52,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:52,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:52,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:52,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:52,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:52,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:52,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:52,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:52,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:52,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,369 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:48:52,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,371 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:48:52,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:52,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,378 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:48:52,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,379 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:48:52,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:52,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:52,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:52,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:52,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:52,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:52,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:52,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:52,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:52,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:52,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:52,403 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:48:52,417 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-22 22:48:52,418 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 22:48:52,418 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:48:52,419 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-22 22:48:52,419 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:48:52,419 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 3 Supporting invariants [-1*~N~0 + 2 >= 0] [2018-11-22 22:48:52,440 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2018-11-22 22:48:52,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:52,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:52,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:52,500 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-22 22:48:52,500 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-22 22:48:52,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 80 states and 109 transitions. Complement of second has 13 states. [2018-11-22 22:48:52,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-22 22:48:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 22:48:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2018-11-22 22:48:52,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-22 22:48:52,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:52,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-22 22:48:52,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:52,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-22 22:48:52,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:52,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 109 transitions. [2018-11-22 22:48:52,570 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-22 22:48:52,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 71 states and 94 transitions. [2018-11-22 22:48:52,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-22 22:48:52,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-22 22:48:52,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 94 transitions. [2018-11-22 22:48:52,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:48:52,571 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 94 transitions. [2018-11-22 22:48:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 94 transitions. [2018-11-22 22:48:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2018-11-22 22:48:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-22 22:48:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2018-11-22 22:48:52,575 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-22 22:48:52,575 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2018-11-22 22:48:52,575 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:48:52,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2018-11-22 22:48:52,576 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:52,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:52,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:52,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:52,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:48:52,577 INFO L794 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 791#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 790#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 782#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 783#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 821#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 819#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 817#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 815#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 813#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 812#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 810#L11-3 assume !(max_~i~0 < ~N~0); 808#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 806#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 804#L11-8 assume !(max_~i~0 < ~N~0); 797#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 798#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 780#L32-3 [2018-11-22 22:48:52,577 INFO L796 eck$LassoCheckResult]: Loop: 780#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 781#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 780#L32-3 [2018-11-22 22:48:52,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:52,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1591298555, now seen corresponding path program 1 times [2018-11-22 22:48:52,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:52,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:52,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:52,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:48:52,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:48:52,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:48:52,605 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:48:52,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:52,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2018-11-22 22:48:52,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:52,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:52,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:52,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:52,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:48:52,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:48:52,642 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. cyclomatic complexity: 24 Second operand 4 states. [2018-11-22 22:48:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:48:52,672 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2018-11-22 22:48:52,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:48:52,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 86 transitions. [2018-11-22 22:48:52,674 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:52,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 86 transitions. [2018-11-22 22:48:52,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-22 22:48:52,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-22 22:48:52,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2018-11-22 22:48:52,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:48:52,675 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-11-22 22:48:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2018-11-22 22:48:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2018-11-22 22:48:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-22 22:48:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2018-11-22 22:48:52,678 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 73 transitions. [2018-11-22 22:48:52,678 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 73 transitions. [2018-11-22 22:48:52,679 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:48:52,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 73 transitions. [2018-11-22 22:48:52,679 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-22 22:48:52,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:52,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:52,680 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:52,680 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:48:52,680 INFO L794 eck$LassoCheckResult]: Stem: 926#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 924#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 922#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 914#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 915#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 951#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 950#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 949#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 948#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 945#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 944#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 943#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 940#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 942#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 941#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 939#L11-3 assume !(max_~i~0 < ~N~0); 938#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 937#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 936#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 935#L12-3 [2018-11-22 22:48:52,680 INFO L796 eck$LassoCheckResult]: Loop: 935#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 908#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 909#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 934#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 935#L12-3 [2018-11-22 22:48:52,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash 209733900, now seen corresponding path program 1 times [2018-11-22 22:48:52,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:52,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:52,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:52,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:52,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:52,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2128124, now seen corresponding path program 5 times [2018-11-22 22:48:52,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:52,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:52,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:52,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:52,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -772848505, now seen corresponding path program 2 times [2018-11-22 22:48:52,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:53,042 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 132 [2018-11-22 22:48:53,234 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-22 22:48:53,235 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:48:53,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:48:53,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:48:53,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:48:53,235 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:48:53,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:48:53,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:48:53,236 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:48:53,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-22 22:48:53,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:48:53,236 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:48:53,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,458 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-11-22 22:48:53,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:53,784 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:48:53,784 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:48:53,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:53,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:53,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:53,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:53,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:53,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:53,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:53,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:53,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:53,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:53,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:53,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:53,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:53,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:53,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:53,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:53,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:53,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:53,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:53,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:53,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:53,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:53,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:53,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:53,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:53,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:53,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:53,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:53,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:53,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:53,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:53,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:53,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:53,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:53,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:53,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:53,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:53,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:53,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:53,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:53,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:53,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:53,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:53,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:53,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:53,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:53,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:53,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:53,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:53,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:53,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:53,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:53,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:53,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:53,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:53,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:53,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:53,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:53,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:53,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:53,819 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:48:53,836 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-22 22:48:53,837 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-22 22:48:53,837 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:48:53,838 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:48:53,838 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:48:53,838 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_max_~x.base)_3, ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset) = 1*v_rep(select #length ULTIMATE.start_max_~x.base)_3 - 4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2018-11-22 22:48:53,864 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-22 22:48:53,865 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:48:53,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:53,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:53,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:53,913 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:48:53,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 73 transitions. cyclomatic complexity: 21 Second operand 4 states. [2018-11-22 22:48:53,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 73 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 71 states and 95 transitions. Complement of second has 7 states. [2018-11-22 22:48:53,946 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 [2018-11-22 22:48:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:48:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-22 22:48:53,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-22 22:48:53,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:53,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-22 22:48:53,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:53,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-22 22:48:53,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:53,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 95 transitions. [2018-11-22 22:48:53,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:48:53,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 65 states and 87 transitions. [2018-11-22 22:48:53,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-22 22:48:53,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-22 22:48:53,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 87 transitions. [2018-11-22 22:48:53,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:48:53,950 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 87 transitions. [2018-11-22 22:48:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 87 transitions. [2018-11-22 22:48:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-11-22 22:48:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-22 22:48:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2018-11-22 22:48:53,953 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2018-11-22 22:48:53,953 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2018-11-22 22:48:53,953 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 22:48:53,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 77 transitions. [2018-11-22 22:48:53,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:48:53,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:53,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:53,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:53,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:48:53,955 INFO L794 eck$LassoCheckResult]: Stem: 1163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1160#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1159#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1152#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1153#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1192#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1190#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1188#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1185#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1182#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1181#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1179#L11-3 assume !(max_~i~0 < ~N~0); 1180#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1169#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1166#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1167#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1146#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1147#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1170#L11-8 assume !(max_~i~0 < ~N~0); 1164#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1165#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1150#L32-3 [2018-11-22 22:48:53,955 INFO L796 eck$LassoCheckResult]: Loop: 1150#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1151#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1150#L32-3 [2018-11-22 22:48:53,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:53,956 INFO L82 PathProgramCache]: Analyzing trace with hash -18080898, now seen corresponding path program 1 times [2018-11-22 22:48:53,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:53,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:53,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:53,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:53,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:48:53,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:48:53,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:48:54,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:54,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:48:54,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:48:54,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-22 22:48:54,074 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:48:54,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2018-11-22 22:48:54,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:54,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:54,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:54,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:54,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:54,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:48:54,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:48:54,113 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. cyclomatic complexity: 24 Second operand 7 states. [2018-11-22 22:48:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:48:54,185 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2018-11-22 22:48:54,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:48:54,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 104 transitions. [2018-11-22 22:48:54,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:48:54,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 96 transitions. [2018-11-22 22:48:54,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-22 22:48:54,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-22 22:48:54,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 96 transitions. [2018-11-22 22:48:54,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:48:54,189 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 96 transitions. [2018-11-22 22:48:54,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 96 transitions. [2018-11-22 22:48:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2018-11-22 22:48:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-22 22:48:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2018-11-22 22:48:54,192 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2018-11-22 22:48:54,192 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2018-11-22 22:48:54,192 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-22 22:48:54,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. [2018-11-22 22:48:54,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:48:54,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:54,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:54,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:54,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:48:54,198 INFO L794 eck$LassoCheckResult]: Stem: 1372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1370#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1368#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1360#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1361#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1371#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1364#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1365#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1405#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1394#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1402#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1400#L11-3 assume !(max_~i~0 < ~N~0); 1399#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1398#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1396#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1395#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1356#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1357#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1377#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1378#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1354#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1355#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1379#L11-8 assume !(max_~i~0 < ~N~0); 1374#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1375#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1358#L32-3 [2018-11-22 22:48:54,198 INFO L796 eck$LassoCheckResult]: Loop: 1358#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1359#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1358#L32-3 [2018-11-22 22:48:54,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:54,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2011161481, now seen corresponding path program 2 times [2018-11-22 22:48:54,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:54,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:54,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:54,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:54,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:54,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:48:54,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d859f718-c479-4468-9e06-a16a2a31ffc6/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:48:54,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:48:54,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:48:54,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:48:54,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:54,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-22 22:48:54,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:48:54,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2018-11-22 22:48:54,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:48:54,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-22 22:48:54,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 22:48:54,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:54,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:54,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:54,731 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:19 [2018-11-22 22:48:54,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-22 22:48:54,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-22 22:48:54,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:48:54,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:54,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:48:54,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-22 22:48:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 22:48:54,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:48:54,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-11-22 22:48:54,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:48:54,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:54,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2018-11-22 22:48:54,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:54,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:54,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-22 22:48:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-11-22 22:48:54,859 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. cyclomatic complexity: 21 Second operand 22 states. [2018-11-22 22:48:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:48:55,985 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2018-11-22 22:48:55,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-22 22:48:55,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 175 transitions. [2018-11-22 22:48:55,988 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-22 22:48:55,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 175 transitions. [2018-11-22 22:48:55,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-22 22:48:55,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-22 22:48:55,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 175 transitions. [2018-11-22 22:48:55,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:48:55,990 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 175 transitions. [2018-11-22 22:48:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 175 transitions. [2018-11-22 22:48:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2018-11-22 22:48:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-22 22:48:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-11-22 22:48:55,994 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-11-22 22:48:55,995 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-11-22 22:48:55,995 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-22 22:48:55,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 117 transitions. [2018-11-22 22:48:55,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 22:48:55,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:55,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:55,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:55,996 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:48:55,996 INFO L794 eck$LassoCheckResult]: Stem: 1718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1716#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1714#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1705#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1706#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1743#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1744#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1739#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1740#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1766#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1764#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1762#L11-3 assume !(max_~i~0 < ~N~0); 1759#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1757#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1755#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1753#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1751#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1750#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1724#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1725#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1746#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1726#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1727#L11-8 assume !(max_~i~0 < ~N~0); 1721#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1722#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1703#L32-3 [2018-11-22 22:48:55,996 INFO L796 eck$LassoCheckResult]: Loop: 1703#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1704#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1703#L32-3 [2018-11-22 22:48:55,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:55,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2068419783, now seen corresponding path program 1 times [2018-11-22 22:48:55,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:55,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:55,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:56,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2018-11-22 22:48:56,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:56,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:56,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:56,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:56,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:56,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash 818448475, now seen corresponding path program 1 times [2018-11-22 22:48:56,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:56,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:56,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:56,658 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 156 [2018-11-22 22:48:57,018 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2018-11-22 22:48:57,019 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:48:57,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:48:57,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:48:57,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:48:57,020 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:48:57,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:48:57,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:48:57,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:48:57,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration10_Lasso [2018-11-22 22:48:57,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:48:57,020 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:48:57,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,103 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-22 22:48:57,375 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-11-22 22:48:57,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:48:57,790 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-22 22:48:57,837 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:48:57,837 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:48:57,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:57,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:57,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:57,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:57,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:57,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:57,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:57,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:57,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:57,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:57,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:57,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:57,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:57,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:57,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:57,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:57,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:57,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:57,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:57,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:48:57,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:48:57,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:48:57,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:57,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:57,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,854 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:48:57,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,856 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:48:57,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:57,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:57,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:57,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:57,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:57,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,868 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:48:57,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,869 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:48:57,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:57,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:48:57,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:48:57,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:48:57,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:48:57,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:48:57,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:48:57,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:48:57,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:48:57,885 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:48:57,894 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 22:48:57,895 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 22:48:57,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:48:57,896 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:48:57,896 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:48:57,896 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_4, ULTIMATE.start_main_~#x~0.offset, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_4 - 1*ULTIMATE.start_main_~#x~0.offset - 4*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-22 22:48:57,949 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-22 22:48:57,951 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:48:57,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:57,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:57,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:48:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:48:57,996 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:48:57,996 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 117 transitions. cyclomatic complexity: 33 Second operand 3 states. [2018-11-22 22:48:58,016 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 117 transitions. cyclomatic complexity: 33. Second operand 3 states. Result 101 states and 134 transitions. Complement of second has 6 states. [2018-11-22 22:48:58,017 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 [2018-11-22 22:48:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:48:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-22 22:48:58,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 2 letters. [2018-11-22 22:48:58,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:58,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 27 letters. Loop has 2 letters. [2018-11-22 22:48:58,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:58,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 4 letters. [2018-11-22 22:48:58,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:48:58,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 134 transitions. [2018-11-22 22:48:58,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:48:58,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 92 states and 119 transitions. [2018-11-22 22:48:58,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-22 22:48:58,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-22 22:48:58,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 119 transitions. [2018-11-22 22:48:58,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:48:58,020 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-11-22 22:48:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 119 transitions. [2018-11-22 22:48:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-22 22:48:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-22 22:48:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2018-11-22 22:48:58,026 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-11-22 22:48:58,026 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-11-22 22:48:58,026 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-22 22:48:58,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 119 transitions. [2018-11-22 22:48:58,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:48:58,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:58,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:58,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:58,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:48:58,028 INFO L794 eck$LassoCheckResult]: Stem: 2051#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2049#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2046#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2039#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2040#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2092#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2091#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2090#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2089#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2087#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2084#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2080#L11-3 assume !(max_~i~0 < ~N~0); 2077#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2075#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2072#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2068#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2067#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2066#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2064#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2060#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2061#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2074#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2071#L11-8 assume !(max_~i~0 < ~N~0); 2052#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2053#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2035#L32-3 assume !(main_~i~1 < ~N~0 - 1); 2036#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2048#L11-13 [2018-11-22 22:48:58,028 INFO L796 eck$LassoCheckResult]: Loop: 2048#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2059#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2026#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2047#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2048#L11-13 [2018-11-22 22:48:58,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash 818448417, now seen corresponding path program 1 times [2018-11-22 22:48:58,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:58,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:48:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:48:58,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:48:58,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:48:58,069 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:48:58,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 1 times [2018-11-22 22:48:58,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:58,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:58,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:48:58,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:48:58,101 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. cyclomatic complexity: 34 Second operand 4 states. [2018-11-22 22:48:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:48:58,122 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2018-11-22 22:48:58,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:48:58,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2018-11-22 22:48:58,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:48:58,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 115 transitions. [2018-11-22 22:48:58,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-22 22:48:58,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-22 22:48:58,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 115 transitions. [2018-11-22 22:48:58,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:48:58,126 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-11-22 22:48:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 115 transitions. [2018-11-22 22:48:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2018-11-22 22:48:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-22 22:48:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2018-11-22 22:48:58,128 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-11-22 22:48:58,128 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-11-22 22:48:58,128 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-22 22:48:58,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 101 transitions. [2018-11-22 22:48:58,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:48:58,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:48:58,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:48:58,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:48:58,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:48:58,129 INFO L794 eck$LassoCheckResult]: Stem: 2238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2236#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2234#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2227#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2228#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2269#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2268#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2267#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2266#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2264#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2262#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2259#L11-3 assume !(max_~i~0 < ~N~0); 2257#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2255#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2253#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2251#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2220#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2221#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2249#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2248#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2218#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2219#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2246#L11-8 assume !(max_~i~0 < ~N~0); 2239#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2240#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2224#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 2225#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2226#L32-3 assume !(main_~i~1 < ~N~0 - 1); 2216#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2217#L11-13 [2018-11-22 22:48:58,130 INFO L796 eck$LassoCheckResult]: Loop: 2217#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2214#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2215#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2235#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2217#L11-13 [2018-11-22 22:48:58,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:58,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1168061379, now seen corresponding path program 1 times [2018-11-22 22:48:58,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:58,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:58,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:58,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 2 times [2018-11-22 22:48:58,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:58,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:48:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:58,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:48:58,164 INFO L82 PathProgramCache]: Analyzing trace with hash 934015144, now seen corresponding path program 1 times [2018-11-22 22:48:58,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:48:58,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:48:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:48:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:48:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:48:59,250 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 229 DAG size of output: 192 [2018-11-22 22:49:00,353 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2018-11-22 22:49:00,355 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:49:00,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:49:00,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:49:00,355 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:49:00,355 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:49:00,355 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:49:00,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:49:00,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:49:00,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-22 22:49:00,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:49:00,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:49:00,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-22 22:49:00,728 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2018-11-22 22:49:00,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:00,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:49:01,111 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-22 22:49:01,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:49:01,156 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:49:01,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:49:01,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:49:01,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:49:01,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:49:01,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:49:01,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:49:01,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:49:01,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:49:01,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:49:01,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:49:01,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:49:01,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:49:01,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:49:01,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:49:01,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:49:01,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:49:01,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:49:01,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:49:01,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:49:01,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:49:01,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:49:01,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:49:01,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:49:01,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:49:01,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:49:01,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:49:01,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:49:01,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:49:01,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:49:01,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:49:01,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:49:01,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,184 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:49:01,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,185 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:49:01,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:49:01,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:49:01,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:49:01,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:49:01,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:49:01,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,197 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:49:01,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,199 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:49:01,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:49:01,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:49:01,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:49:01,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:49:01,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:49:01,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:49:01,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:49:01,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:49:01,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:49:01,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:49:01,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:49:01,217 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:49:01,229 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 22:49:01,229 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 22:49:01,229 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:49:01,230 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:49:01,230 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:49:01,230 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_5) = -4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_5 Supporting invariants [] [2018-11-22 22:49:01,299 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2018-11-22 22:49:01,301 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:49:01,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:49:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:49:01,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:49:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:49:01,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:49:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:49:01,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:49:01,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 101 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-22 22:49:01,403 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 101 transitions. cyclomatic complexity: 28. Second operand 3 states. Result 83 states and 107 transitions. Complement of second has 4 states. [2018-11-22 22:49:01,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:49:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:49:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-22 22:49:01,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 4 letters. [2018-11-22 22:49:01,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:49:01,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-22 22:49:01,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:49:01,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-22 22:49:01,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:49:01,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 107 transitions. [2018-11-22 22:49:01,406 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:49:01,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 0 states and 0 transitions. [2018-11-22 22:49:01,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:49:01,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:49:01,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:49:01,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:49:01,407 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:49:01,407 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:49:01,407 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:49:01,407 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-22 22:49:01,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:49:01,407 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:49:01,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:49:01,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:49:01 BoogieIcfgContainer [2018-11-22 22:49:01,414 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:49:01,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:49:01,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:49:01,414 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:49:01,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:48:48" (3/4) ... [2018-11-22 22:49:01,418 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:49:01,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:49:01,419 INFO L168 Benchmark]: Toolchain (without parser) took 13507.79 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 454.6 MB). Free memory was 958.0 MB in the beginning and 1.2 GB in the end (delta: -249.6 MB). Peak memory consumption was 204.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:49:01,420 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:49:01,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.76 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:49:01,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.12 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:49:01,421 INFO L168 Benchmark]: Boogie Preprocessor took 57.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -206.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:49:01,422 INFO L168 Benchmark]: RCFGBuilder took 236.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:49:01,422 INFO L168 Benchmark]: BuchiAutomizer took 13015.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.0 MB). Peak memory consumption was 216.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:49:01,423 INFO L168 Benchmark]: Witness Printer took 4.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:49:01,426 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.76 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.12 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -206.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13015.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.0 MB). Peak memory consumption was 216.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 10 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -1 * x + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.9s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 9.9s. Construction of modules took 1.0s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 171 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 92 states and ocurred in iteration 10. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 238 SDtfs, 609 SDslu, 315 SDs, 0 SdLazy, 1934 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital399 mio100 ax100 hnf99 lsp87 ukn69 mio100 lsp42 div121 bol100 ite100 ukn100 eq157 hnf80 smp83 dnf175 smp64 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...