./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/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 64bit --witnessprinter.graph.data.programhash a398041f87cd84898ae142142fdf4872d746c3b1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:40,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:40,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:40,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:40,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:40,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:40,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:40,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:40,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:40,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:40,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:40,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:40,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:40,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:40,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:40,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:40,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:40,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:40,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:40,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:40,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:40,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:40,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:40,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:40,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:40,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:40,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:40,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:40,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:40,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:40,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:40,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:40,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:40,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:40,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:40,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:40,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:40,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:40,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:40,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:40,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:40,902 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:01:40,914 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:40,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:40,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:40,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:40,916 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:40,916 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:40,916 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:40,916 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:40,917 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:40,917 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:40,917 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:40,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:40,917 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:40,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:40,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:40,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:40,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:40,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:40,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:40,919 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:40,919 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:40,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:40,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:40,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:40,920 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:40,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:40,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:40,920 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:40,921 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:40,922 INFO L138 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_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a398041f87cd84898ae142142fdf4872d746c3b1 [2019-10-22 09:01:40,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:40,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:40,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:40,966 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:40,966 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:40,967 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2019-10-22 09:01:41,019 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/data/178fd1472/30b3fead5f1b4172a65ab3cd023a4dc5/FLAGc0414393d [2019-10-22 09:01:41,440 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:41,441 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2019-10-22 09:01:41,451 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/data/178fd1472/30b3fead5f1b4172a65ab3cd023a4dc5/FLAGc0414393d [2019-10-22 09:01:41,460 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/data/178fd1472/30b3fead5f1b4172a65ab3cd023a4dc5 [2019-10-22 09:01:41,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:41,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:41,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:41,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:41,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:41,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d11e977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41, skipping insertion in model container [2019-10-22 09:01:41,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,479 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:41,511 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:41,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:41,820 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:41,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:41,912 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:41,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41 WrapperNode [2019-10-22 09:01:41,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:41,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:41,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:41,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:41,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:41,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:41,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:41,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:41,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:41,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:41,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:41,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:41,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/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 [2019-10-22 09:01:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:42,313 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:42,313 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:01:42,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:42 BoogieIcfgContainer [2019-10-22 09:01:42,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:42,315 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:42,315 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:42,318 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:42,319 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:42,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:41" (1/3) ... [2019-10-22 09:01:42,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31091953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:42, skipping insertion in model container [2019-10-22 09:01:42,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:42,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41" (2/3) ... [2019-10-22 09:01:42,325 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31091953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:42, skipping insertion in model container [2019-10-22 09:01:42,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:42,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:42" (3/3) ... [2019-10-22 09:01:42,334 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.17-alloca.i [2019-10-22 09:01:42,384 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:42,385 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:42,385 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:42,386 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:42,386 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:42,386 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:42,386 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:42,386 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:42,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 09:01:42,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:42,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:42,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:42,432 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:42,433 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:42,433 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:42,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 09:01:42,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:42,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:42,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:42,435 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:42,435 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:42,444 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L557-3true [2019-10-22 09:01:42,444 INFO L793 eck$LassoCheckResult]: Loop: 13#L557-3true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 8#L557-1true assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 11#L558-3true assume !true; 14#L558-4true call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 13#L557-3true [2019-10-22 09:01:42,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:01:42,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628357751] [2019-10-22 09:01:42,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,659 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2019-10-22 09:01:42,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236066754] [2019-10-22 09:01:42,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:42,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236066754] [2019-10-22 09:01:42,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:42,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:42,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437682470] [2019-10-22 09:01:42,706 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:42,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:42,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:01:42,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:01:42,729 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-10-22 09:01:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:42,736 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-10-22 09:01:42,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:01:42,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-10-22 09:01:42,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:42,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2019-10-22 09:01:42,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 09:01:42,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 09:01:42,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-10-22 09:01:42,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:42,742 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 09:01:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-10-22 09:01:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 09:01:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 09:01:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-10-22 09:01:42,764 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 09:01:42,764 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 09:01:42,764 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:42,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-10-22 09:01:42,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:42,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:42,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:42,765 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:42,765 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:42,766 INFO L791 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L557-3 [2019-10-22 09:01:42,766 INFO L793 eck$LassoCheckResult]: Loop: 33#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 38#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 37#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 36#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 33#L557-3 [2019-10-22 09:01:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,766 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 09:01:42,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682025723] [2019-10-22 09:01:42,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,860 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:42,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2019-10-22 09:01:42,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788377683] [2019-10-22 09:01:42,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,892 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:42,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2019-10-22 09:01:42,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209360692] [2019-10-22 09:01:42,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,954 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:43,072 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-10-22 09:01:43,842 WARN L191 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-10-22 09:01:44,117 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-22 09:01:44,131 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:44,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:44,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:44,132 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:44,133 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:44,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:44,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:44,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:44,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca.i_Iteration2_Lasso [2019-10-22 09:01:44,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:44,134 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:44,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,837 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-10-22 09:01:44,964 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-22 09:01:44,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,116 WARN L191 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 09:01:46,217 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:46,222 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:46,223 INFO L120 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 [2019-10-22 09:01:46,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,225 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:46,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,225 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,227 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:46,227 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:46,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,229 INFO L120 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 [2019-10-22 09:01:46,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,229 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:46,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,230 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:46,230 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:46,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,232 INFO L120 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 [2019-10-22 09:01:46,232 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,233 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,235 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,235 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,238 INFO L120 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 [2019-10-22 09:01:46,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,241 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,241 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,247 INFO L120 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 [2019-10-22 09:01:46,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,249 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,249 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,253 INFO L120 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 [2019-10-22 09:01:46,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,255 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,255 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,258 INFO L120 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 [2019-10-22 09:01:46,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,259 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,261 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,261 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,270 INFO L120 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 [2019-10-22 09:01:46,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,276 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,277 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,311 INFO L120 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 [2019-10-22 09:01:46,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,312 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-10-22 09:01:46,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,324 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-10-22 09:01:46,325 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,402 INFO L120 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 [2019-10-22 09:01:46,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,404 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,404 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,409 INFO L120 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 [2019-10-22 09:01:46,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,410 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,410 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,412 INFO L120 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 [2019-10-22 09:01:46,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,414 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,414 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,415 INFO L120 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 [2019-10-22 09:01:46,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,418 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,418 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,424 INFO L120 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 [2019-10-22 09:01:46,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,427 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,428 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,432 INFO L120 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 [2019-10-22 09:01:46,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,436 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,437 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,459 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:46,488 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:01:46,490 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:01:46,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:46,493 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:46,494 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:46,494 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2019-10-22 09:01:46,617 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-10-22 09:01:46,624 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:46,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:46,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,733 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:01:46,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-10-22 09:01:46,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 17 states and 20 transitions. Complement of second has 7 states. [2019-10-22 09:01:46,793 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 [2019-10-22 09:01:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-10-22 09:01:46,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2019-10-22 09:01:46,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2019-10-22 09:01:46,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2019-10-22 09:01:46,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-10-22 09:01:46,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:46,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2019-10-22 09:01:46,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:01:46,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:01:46,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-10-22 09:01:46,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:46,799 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 09:01:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-10-22 09:01:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 09:01:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 09:01:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-10-22 09:01:46,800 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 09:01:46,800 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-22 09:01:46,800 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:46,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-10-22 09:01:46,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:46,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:46,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:46,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,802 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:46,802 INFO L791 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 251#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 257#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 258#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 253#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 254#L558-3 [2019-10-22 09:01:46,802 INFO L793 eck$LassoCheckResult]: Loop: 254#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 264#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 254#L558-3 [2019-10-22 09:01:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-10-22 09:01:46,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790449287] [2019-10-22 09:01:46,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,865 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2019-10-22 09:01:46,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615633691] [2019-10-22 09:01:46,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,888 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,888 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2019-10-22 09:01:46,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989672171] [2019-10-22 09:01:46,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,947 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,765 WARN L191 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2019-10-22 09:01:48,072 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-10-22 09:01:48,075 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:48,075 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:48,075 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:48,075 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:48,075 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:48,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:48,075 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:48,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:48,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca.i_Iteration3_Lasso [2019-10-22 09:01:48,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:48,076 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:48,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,493 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-10-22 09:01:48,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:48,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,569 WARN L191 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 09:01:49,625 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:49,625 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:49,626 INFO L120 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 [2019-10-22 09:01:49,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,628 INFO L120 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 [2019-10-22 09:01:49,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,628 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,629 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,630 INFO L120 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 [2019-10-22 09:01:49,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,631 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,631 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,633 INFO L120 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 [2019-10-22 09:01:49,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,634 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,634 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,636 INFO L120 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 [2019-10-22 09:01:49,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,637 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,638 INFO L120 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 [2019-10-22 09:01:49,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,639 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,640 INFO L120 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 [2019-10-22 09:01:49,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,641 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,641 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,643 INFO L120 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 [2019-10-22 09:01:49,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,644 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,644 INFO L120 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 [2019-10-22 09:01:49,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,645 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,646 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,646 INFO L120 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 [2019-10-22 09:01:49,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,648 INFO L120 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 [2019-10-22 09:01:49,648 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:49,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,649 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,649 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:49,649 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:49,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,650 INFO L120 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 [2019-10-22 09:01:49,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,651 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,651 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,652 INFO L120 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 [2019-10-22 09:01:49,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,654 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,655 INFO L120 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 [2019-10-22 09:01:49,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,658 INFO L120 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 [2019-10-22 09:01:49,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,660 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,660 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,663 INFO L120 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 [2019-10-22 09:01:49,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,666 INFO L120 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 [2019-10-22 09:01:49,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,666 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,667 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,667 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,669 INFO L120 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 [2019-10-22 09:01:49,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,670 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,670 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,672 INFO L120 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 [2019-10-22 09:01:49,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,673 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,673 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,675 INFO L120 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 [2019-10-22 09:01:49,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,676 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:49,677 INFO L120 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 [2019-10-22 09:01:49,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:49,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:49,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:49,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:49,680 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:49,680 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:49,693 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:49,699 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:01:49,700 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:49,700 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:49,701 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:49,701 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:49,701 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2019-10-22 09:01:49,802 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-10-22 09:01:49,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:49,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:49,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:49,862 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 [2019-10-22 09:01:49,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 09:01:49,879 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2019-10-22 09:01:49,880 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 [2019-10-22 09:01:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 09:01:49,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 09:01:49,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:49,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 09:01:49,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:49,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 09:01:49,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:49,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-10-22 09:01:49,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:49,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2019-10-22 09:01:49,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:01:49,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:01:49,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-10-22 09:01:49,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:49,884 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-10-22 09:01:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-10-22 09:01:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-22 09:01:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 09:01:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-22 09:01:49,887 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-22 09:01:49,887 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-22 09:01:49,887 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:49,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-10-22 09:01:49,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:49,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:49,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:49,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:49,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:49,888 INFO L791 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 464#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 465#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 471#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 472#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 483#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 482#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 467#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 468#L558-4 [2019-10-22 09:01:49,888 INFO L793 eck$LassoCheckResult]: Loop: 468#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 478#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 479#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 475#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 476#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 468#L558-4 [2019-10-22 09:01:49,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2019-10-22 09:01:49,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157363617] [2019-10-22 09:01:49,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,933 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2019-10-22 09:01:49,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490724808] [2019-10-22 09:01:49,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,944 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2019-10-22 09:01:49,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332806121] [2019-10-22 09:01:49,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,021 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:50,853 WARN L191 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 142 [2019-10-22 09:01:51,147 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-10-22 09:01:51,149 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:51,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:51,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:51,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:51,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:51,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:51,150 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:51,150 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:51,150 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca.i_Iteration4_Lasso [2019-10-22 09:01:51,150 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:51,150 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:51,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,643 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-10-22 09:01:51,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:51,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:52,768 WARN L191 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 09:01:52,793 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:52,793 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:52,793 INFO L120 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 [2019-10-22 09:01:52,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,794 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:52,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,795 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:52,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:52,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,795 INFO L120 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 [2019-10-22 09:01:52,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,797 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:52,797 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:52,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,799 INFO L120 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 [2019-10-22 09:01:52,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:52,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,800 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:52,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:52,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,801 INFO L120 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 [2019-10-22 09:01:52,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:52,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,802 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:52,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:52,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,802 INFO L120 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 [2019-10-22 09:01:52,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:52,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,803 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:52,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:52,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,804 INFO L120 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 [2019-10-22 09:01:52,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:52,806 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:52,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,807 INFO L120 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 [2019-10-22 09:01:52,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,808 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:52,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,809 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:52,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:52,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,809 INFO L120 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 [2019-10-22 09:01:52,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,811 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:52,811 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:52,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,812 INFO L120 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 [2019-10-22 09:01:52,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,813 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:52,814 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:52,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,817 INFO L120 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 [2019-10-22 09:01:52,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,818 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:52,818 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:52,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:52,820 INFO L120 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 [2019-10-22 09:01:52,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:52,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:52,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:52,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:52,823 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:52,823 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:52,835 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:52,844 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:01:52,844 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:52,845 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:52,845 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:52,845 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:52,846 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2019-10-22 09:01:52,998 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-10-22 09:01:53,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:53,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:53,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:53,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:53,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:01:53,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:53,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:53,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 60 [2019-10-22 09:01:53,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:53,129 INFO L567 ElimStorePlain]: treesize reduction 52, result has 34.2 percent of original size [2019-10-22 09:01:53,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 09:01:53,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:26 [2019-10-22 09:01:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:53,233 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 09:01:53,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-10-22 09:01:53,369 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 59 states and 71 transitions. Complement of second has 13 states. [2019-10-22 09:01:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:01:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-10-22 09:01:53,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 8 letters. Loop has 5 letters. [2019-10-22 09:01:53,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:53,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 13 letters. Loop has 5 letters. [2019-10-22 09:01:53,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:53,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 8 letters. Loop has 10 letters. [2019-10-22 09:01:53,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:53,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2019-10-22 09:01:53,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 09:01:53,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 55 states and 67 transitions. [2019-10-22 09:01:53,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 09:01:53,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 09:01:53,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 67 transitions. [2019-10-22 09:01:53,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:53,374 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-10-22 09:01:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 67 transitions. [2019-10-22 09:01:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2019-10-22 09:01:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 09:01:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-10-22 09:01:53,378 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-10-22 09:01:53,378 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-10-22 09:01:53,378 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:01:53,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 60 transitions. [2019-10-22 09:01:53,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 09:01:53,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:53,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:53,380 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:53,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-10-22 09:01:53,380 INFO L791 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 783#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 784#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 811#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 810#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 809#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 808#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 805#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 804#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 798#L557-3 [2019-10-22 09:01:53,380 INFO L793 eck$LassoCheckResult]: Loop: 798#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 830#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 829#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 828#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 827#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 825#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 797#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 798#L557-3 [2019-10-22 09:01:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 2 times [2019-10-22 09:01:53,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:53,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754817809] [2019-10-22 09:01:53,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:53,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:53,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:53,416 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:53,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2019-10-22 09:01:53,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:53,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078002913] [2019-10-22 09:01:53,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:53,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:53,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:53,427 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:53,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:53,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1864355357, now seen corresponding path program 3 times [2019-10-22 09:01:53,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:53,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822251477] [2019-10-22 09:01:53,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:53,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:53,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:53,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822251477] [2019-10-22 09:01:53,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456882981] [2019-10-22 09:01:53,738 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e27e0bea-877e-40ff-b79c-2c365a449a5b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:53,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-22 09:01:53,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:53,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 09:01:53,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:53,813 INFO L375 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 10 treesize of output 8 [2019-10-22 09:01:53,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:53,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:53,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:53,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-22 09:01:53,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:53,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 65 [2019-10-22 09:01:53,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:53,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:53,945 INFO L567 ElimStorePlain]: treesize reduction 87, result has 31.5 percent of original size [2019-10-22 09:01:53,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:53,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:40 [2019-10-22 09:01:53,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:54,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:54,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:54,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2019-10-22 09:01:54,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:54,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:54,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:54,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 09:01:54,102 INFO L567 ElimStorePlain]: treesize reduction 17, result has 43.3 percent of original size [2019-10-22 09:01:54,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:54,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2019-10-22 09:01:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:54,121 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:54,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-22 09:01:54,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231642110] [2019-10-22 09:01:54,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 09:01:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:01:54,201 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. cyclomatic complexity: 18 Second operand 16 states. [2019-10-22 09:01:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:54,791 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-10-22 09:01:54,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 09:01:54,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2019-10-22 09:01:54,793 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:54,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-10-22 09:01:54,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:01:54,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:01:54,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:01:54,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:54,793 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:54,793 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:54,793 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:54,794 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:54,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:54,794 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:54,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:01:54,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:54 BoogieIcfgContainer [2019-10-22 09:01:54,799 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:54,799 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:54,799 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:54,800 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:54,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:42" (3/4) ... [2019-10-22 09:01:54,802 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:54,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:54,803 INFO L168 Benchmark]: Toolchain (without parser) took 13340.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.3 MB). Free memory was 937.8 MB in the beginning and 1.3 GB in the end (delta: -323.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:54,804 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:54,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:54,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:54,805 INFO L168 Benchmark]: Boogie Preprocessor took 24.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:54,805 INFO L168 Benchmark]: RCFGBuilder took 334.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:54,805 INFO L168 Benchmark]: BuchiAutomizer took 12484.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -152.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:54,806 INFO L168 Benchmark]: Witness Printer took 2.94 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:54,808 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 334.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12484.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -152.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.94 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 33 SDslu, 13 SDs, 0 SdLazy, 173 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital888 mio100 ax102 hnf100 lsp96 ukn32 mio100 lsp31 div100 bol100 ite100 ukn100 eq194 hnf87 smp99 dnf729 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 90ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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...