./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/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 205669a0469477740fa35099dd0e4ee1e635b686 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:23:44,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:23:44,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:23:44,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:23:44,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:23:44,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:23:44,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:23:44,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:23:44,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:23:44,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:23:44,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:23:44,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:23:44,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:23:44,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:23:44,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:23:44,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:23:44,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:23:44,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:23:44,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:23:44,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:23:44,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:23:44,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:23:44,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:23:44,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:23:44,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:23:44,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:23:44,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:23:44,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:23:44,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:23:44,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:23:44,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:23:44,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:23:44,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:23:44,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:23:44,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:23:44,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:23:44,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:23:44,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:23:44,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:23:44,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:23:44,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:23:44,369 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-20 02:23:44,395 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:23:44,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:23:44,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:23:44,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:23:44,406 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:23:44,406 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 02:23:44,406 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 02:23:44,407 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 02:23:44,407 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 02:23:44,407 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 02:23:44,407 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 02:23:44,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:23:44,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 02:23:44,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:23:44,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:23:44,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 02:23:44,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 02:23:44,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 02:23:44,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:23:44,410 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 02:23:44,410 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:23:44,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 02:23:44,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:23:44,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:23:44,411 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 02:23:44,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:23:44,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:23:44,412 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 02:23:44,413 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 02:23:44,414 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/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/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 -> 205669a0469477740fa35099dd0e4ee1e635b686 [2019-11-20 02:23:44,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:23:44,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:23:44,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:23:44,597 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:23:44,598 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:23:44,599 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2019-11-20 02:23:44,655 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/data/a3aff80f8/789833c4988347dcb3e420b467ee91a2/FLAG40bc71d07 [2019-11-20 02:23:45,042 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:23:45,043 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2019-11-20 02:23:45,048 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/data/a3aff80f8/789833c4988347dcb3e420b467ee91a2/FLAG40bc71d07 [2019-11-20 02:23:45,460 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/data/a3aff80f8/789833c4988347dcb3e420b467ee91a2 [2019-11-20 02:23:45,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:23:45,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:23:45,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:23:45,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:23:45,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:23:45,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c427004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45, skipping insertion in model container [2019-11-20 02:23:45,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,484 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:23:45,501 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:23:45,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:23:45,770 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:23:45,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:23:45,810 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:23:45,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45 WrapperNode [2019-11-20 02:23:45,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:23:45,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:23:45,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:23:45,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:23:45,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:23:45,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:23:45,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:23:45,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:23:45,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... [2019-11-20 02:23:45,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:23:45,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:23:45,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:23:45,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:23:45,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/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-11-20 02:23:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 02:23:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-20 02:23:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-20 02:23:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 02:23:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:23:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:23:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 02:23:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:23:46,138 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:23:46,139 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-20 02:23:46,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:23:46 BoogieIcfgContainer [2019-11-20 02:23:46,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:23:46,140 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 02:23:46,141 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 02:23:46,144 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 02:23:46,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:23:46,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 02:23:45" (1/3) ... [2019-11-20 02:23:46,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@146db5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:23:46, skipping insertion in model container [2019-11-20 02:23:46,146 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:23:46,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:45" (2/3) ... [2019-11-20 02:23:46,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@146db5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:23:46, skipping insertion in model container [2019-11-20 02:23:46,147 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:23:46,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:23:46" (3/3) ... [2019-11-20 02:23:46,148 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2.i [2019-11-20 02:23:46,188 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 02:23:46,188 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 02:23:46,188 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 02:23:46,189 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:23:46,189 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:23:46,189 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 02:23:46,189 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:23:46,189 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 02:23:46,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-20 02:23:46,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:23:46,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:46,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:46,234 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 02:23:46,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:46,248 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 02:23:46,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-20 02:23:46,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:23:46,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:46,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:46,251 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 02:23:46,251 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:46,258 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 7#L23-3true [2019-11-20 02:23:46,258 INFO L796 eck$LassoCheckResult]: Loop: 7#L23-3true call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 12#L23-1true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 3#L26true call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 10#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 15#recFINALtrue assume true; 13#recEXITtrue >#31#return; 17#L26-1true call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 7#L23-3true [2019-11-20 02:23:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:46,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-20 02:23:46,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:46,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502509707] [2019-11-20 02:23:46,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:46,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash -5927165, now seen corresponding path program 1 times [2019-11-20 02:23:46,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:46,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380175383] [2019-11-20 02:23:46,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:46,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380175383] [2019-11-20 02:23:46,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:23:46,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:23:46,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140151235] [2019-11-20 02:23:46,614 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:23:46,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:23:46,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:23:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:23:46,631 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-20 02:23:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:46,777 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-20 02:23:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:23:46,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-20 02:23:46,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:23:46,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2019-11-20 02:23:46,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 02:23:46,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 02:23:46,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-20 02:23:46,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:23:46,793 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-20 02:23:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-20 02:23:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-20 02:23:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 02:23:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-20 02:23:46,826 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-20 02:23:46,826 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-20 02:23:46,826 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 02:23:46,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-20 02:23:46,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:23:46,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:46,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:46,829 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 02:23:46,829 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:46,830 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 51#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 52#L23-3 [2019-11-20 02:23:46,830 INFO L796 eck$LassoCheckResult]: Loop: 52#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 59#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 54#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 57#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 55#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 57#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 56#recFINAL assume true; 60#recEXIT >#29#return; 61#L17-1 #res := #t~ret6;havoc #t~ret6; 62#recFINAL assume true; 64#recEXIT >#31#return; 63#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 52#L23-3 [2019-11-20 02:23:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-20 02:23:46,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:46,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602726084] [2019-11-20 02:23:46,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:46,860 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:46,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash -741726607, now seen corresponding path program 1 times [2019-11-20 02:23:46,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:46,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540739647] [2019-11-20 02:23:46,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 02:23:47,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540739647] [2019-11-20 02:23:47,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39636606] [2019-11-20 02:23:47,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/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-11-20 02:23:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:47,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 02:23:47,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:47,279 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 02:23:47,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-20 02:23:47,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:47,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:47,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:23:47,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-20 02:23:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 02:23:47,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:23:47,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-20 02:23:47,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456028954] [2019-11-20 02:23:47,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:23:47,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:23:47,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 02:23:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-20 02:23:47,498 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 16 states. [2019-11-20 02:23:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:47,725 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-20 02:23:47,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:23:47,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-20 02:23:47,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:23:47,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-20 02:23:47,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-20 02:23:47,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-20 02:23:47,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-20 02:23:47,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:23:47,730 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-20 02:23:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-20 02:23:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-20 02:23:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 02:23:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-20 02:23:47,735 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-20 02:23:47,735 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-20 02:23:47,736 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 02:23:47,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-11-20 02:23:47,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:23:47,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:47,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:47,740 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 02:23:47,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:47,741 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 160#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 161#L23-3 [2019-11-20 02:23:47,742 INFO L796 eck$LassoCheckResult]: Loop: 161#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 168#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 163#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 164#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 164#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 165#recFINAL assume true; 169#recEXIT >#29#return; 170#L17-1 #res := #t~ret6;havoc #t~ret6; 171#recFINAL assume true; 176#recEXIT >#29#return; 174#L17-1 #res := #t~ret6;havoc #t~ret6; 175#recFINAL assume true; 173#recEXIT >#31#return; 172#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 161#L23-3 [2019-11-20 02:23:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:47,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2019-11-20 02:23:47,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:47,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61792261] [2019-11-20 02:23:47,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:47,768 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:47,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1620168125, now seen corresponding path program 2 times [2019-11-20 02:23:47,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:47,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651135905] [2019-11-20 02:23:47,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 02:23:48,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651135905] [2019-11-20 02:23:48,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318044952] [2019-11-20 02:23:48,048 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:23:48,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:23:48,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:23:48,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-20 02:23:48,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:48,169 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-20 02:23:48,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-20 02:23:48,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:48,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:48,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:23:48,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-20 02:23:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 02:23:48,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:23:48,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2019-11-20 02:23:48,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297981416] [2019-11-20 02:23:48,431 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:23:48,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:23:48,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 02:23:48,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-11-20 02:23:48,432 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 19 states. [2019-11-20 02:23:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:48,694 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-20 02:23:48,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:23:48,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-20 02:23:48,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:23:48,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-20 02:23:48,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 02:23:48,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 02:23:48,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-20 02:23:48,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:23:48,699 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-20 02:23:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-20 02:23:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-20 02:23:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 02:23:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-20 02:23:48,702 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-20 02:23:48,702 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-20 02:23:48,702 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 02:23:48,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-11-20 02:23:48,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 02:23:48,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:48,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:48,708 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 02:23:48,708 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:48,708 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 316#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 317#L23-3 [2019-11-20 02:23:48,709 INFO L796 eck$LassoCheckResult]: Loop: 317#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 320#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 313#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 315#recFINAL assume true; 331#recEXIT >#29#return; 324#L17-1 #res := #t~ret6;havoc #t~ret6; 323#recFINAL assume true; 321#recEXIT >#29#return; 322#L17-1 #res := #t~ret6;havoc #t~ret6; 330#recFINAL assume true; 329#recEXIT >#29#return; 327#L17-1 #res := #t~ret6;havoc #t~ret6; 328#recFINAL assume true; 326#recEXIT >#31#return; 325#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 317#L23-3 [2019-11-20 02:23:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:48,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2019-11-20 02:23:48,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:48,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591472090] [2019-11-20 02:23:48,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:48,725 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:48,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:48,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1930575665, now seen corresponding path program 3 times [2019-11-20 02:23:48,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:48,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485124824] [2019-11-20 02:23:48,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:48,842 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:48,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:48,843 INFO L82 PathProgramCache]: Analyzing trace with hash 650376563, now seen corresponding path program 1 times [2019-11-20 02:23:48,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:48,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640901844] [2019-11-20 02:23:48,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:48,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:49,410 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-11-20 02:23:49,587 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 02:23:50,026 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-11-20 02:23:50,313 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-20 02:23:50,681 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-11-20 02:23:50,912 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-20 02:23:51,036 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-20 02:23:51,589 WARN L191 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-11-20 02:23:51,724 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-20 02:23:51,814 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:23:51,815 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:23:51,815 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:23:51,815 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:23:51,815 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:23:51,815 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:51,816 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:23:51,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:23:51,816 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration4_Lasso [2019-11-20 02:23:51,816 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:23:51,816 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:23:51,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:51,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:51,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:51,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:51,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:52,100 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-11-20 02:23:52,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-11-20 02:23:52,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:52,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:52,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:52,935 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-20 02:23:52,993 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:23:52,997 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:53,006 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-11-20 02:23:53,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:53,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:53,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:53,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:53,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:53,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:53,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:53,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:53,017 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-11-20 02:23:53,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:53,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:53,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:53,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:53,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:53,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:53,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:53,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:53,025 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-11-20 02:23:53,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:53,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:53,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:53,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:53,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:53,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:53,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:53,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:53,040 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-11-20 02:23:53,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:53,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:53,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:53,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:53,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:53,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:53,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:53,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:23:53,049 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 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:53,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:53,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:53,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:53,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:53,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:53,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:53,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:53,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:53,068 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-11-20 02:23:53,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:53,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:53,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:53,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:53,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:53,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:23:53,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:23:53,104 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-11-20 02:23:53,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:53,107 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-20 02:23:53,107 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2019-11-20 02:23:53,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:53,641 INFO L401 nArgumentSynthesizer]: We have 608 Motzkin's Theorem applications. [2019-11-20 02:23:53,642 INFO L402 nArgumentSynthesizer]: A total of 32 supporting invariants were added. [2019-11-20 02:23:55,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:55,086 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-11-20 02:23:55,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:55,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:55,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:55,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:55,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:55,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:55,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:55,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:55,098 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-11-20 02:23:55,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:55,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:55,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:55,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:55,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:55,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:55,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:55,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:55,106 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-11-20 02:23:55,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:55,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:55,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:55,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:55,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:55,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:23:55,118 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:23:55,132 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-20 02:23:55,133 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:55,146 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:23:55,149 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 02:23:55,149 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:23:55,150 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1 Supporting invariants [] [2019-11-20 02:23:55,180 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-20 02:23:55,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 02:23:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:55,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:23:55,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:55,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 02:23:55,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:55,340 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:55,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 02:23:55,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:55,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:55,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:23:55,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 02:23:55,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:55,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:55,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:23:55,370 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-11-20 02:23:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 02:23:55,500 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-11-20 02:23:55,501 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-11-20 02:23:55,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 66 states and 73 transitions. Complement of second has 24 states. [2019-11-20 02:23:55,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-20 02:23:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 02:23:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-11-20 02:23:55,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 26 letters. [2019-11-20 02:23:55,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:55,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 28 letters. Loop has 26 letters. [2019-11-20 02:23:55,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:55,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 52 letters. [2019-11-20 02:23:55,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:55,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 73 transitions. [2019-11-20 02:23:55,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:23:55,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 35 states and 40 transitions. [2019-11-20 02:23:55,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 02:23:55,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 02:23:55,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-11-20 02:23:55,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:23:55,672 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-20 02:23:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-11-20 02:23:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-11-20 02:23:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 02:23:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-20 02:23:55,676 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-20 02:23:55,677 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-20 02:23:55,677 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 02:23:55,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2019-11-20 02:23:55,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:23:55,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:55,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:55,678 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 02:23:55,678 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:23:55,679 INFO L794 eck$LassoCheckResult]: Stem: 560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 547#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 548#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 561#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 550#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 556#recENTRY [2019-11-20 02:23:55,679 INFO L796 eck$LassoCheckResult]: Loop: 556#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 549#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 551#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 556#recENTRY [2019-11-20 02:23:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash 36330294, now seen corresponding path program 1 times [2019-11-20 02:23:55,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:55,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180075787] [2019-11-20 02:23:55,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,694 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:55,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 1 times [2019-11-20 02:23:55,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:55,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135411868] [2019-11-20 02:23:55,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash -15969886, now seen corresponding path program 1 times [2019-11-20 02:23:55,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:55,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593084448] [2019-11-20 02:23:55,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:55,729 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:55,888 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-20 02:23:56,391 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-11-20 02:23:56,652 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:23:56,652 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:23:56,652 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:23:56,652 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:23:56,652 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:23:56,652 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:56,652 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:23:56,652 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:23:56,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration5_Lasso [2019-11-20 02:23:56,652 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:23:56,652 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:23:56,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:56,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:57,324 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:23:57,325 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:23:57,350 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-11-20 02:23:57,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,360 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-11-20 02:23:57,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:57,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,368 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-11-20 02:23:57,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:57,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,383 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-11-20 02:23:57,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:57,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,392 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-11-20 02:23:57,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:57,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,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-11-20 02:23:57,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:57,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:23:57,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,425 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-11-20 02:23:57,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:57,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,436 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-11-20 02:23:57,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:57,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,444 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-11-20 02:23:57,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:57,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,452 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-11-20 02:23:57,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:57,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,459 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-11-20 02:23:57,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:57,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:23:57,477 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-11-20 02:23:57,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:57,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:57,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:23:57,487 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-11-20 02:23:57,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:57,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,510 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-11-20 02:23:57,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:57,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:57,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:57,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:57,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:23:57,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:23:57,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:23:57,536 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-20 02:23:57,536 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:23:57,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:57,543 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 02:23:57,543 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:23:57,543 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2019-11-20 02:23:57,554 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-20 02:23:57,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 02:23:57,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:57,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:23:57,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:57,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 02:23:57,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:57,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 02:23:57,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:57,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:57,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:23:57,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-20 02:23:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:57,676 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-11-20 02:23:57,677 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-20 02:23:57,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 14 states. [2019-11-20 02:23:57,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-20 02:23:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 02:23:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-20 02:23:57,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-20 02:23:57,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:57,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-20 02:23:57,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:57,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-20 02:23:57,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:57,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-11-20 02:23:57,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:23:57,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2019-11-20 02:23:57,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 02:23:57,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-20 02:23:57,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2019-11-20 02:23:57,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:23:57,753 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-20 02:23:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2019-11-20 02:23:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-20 02:23:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 02:23:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-20 02:23:57,758 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-20 02:23:57,758 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-20 02:23:57,758 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 02:23:57,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2019-11-20 02:23:57,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:23:57,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:57,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:57,760 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 02:23:57,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:23:57,761 INFO L794 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 710#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 711#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 727#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 729#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 743#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 742#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 722#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 739#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 723#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 739#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 723#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 736#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 737#recFINAL assume true; 741#recEXIT >#29#return; 719#L17-1 #res := #t~ret6;havoc #t~ret6; 724#recFINAL assume true; 735#recEXIT >#29#return; 733#L17-1 #res := #t~ret6;havoc #t~ret6; 734#recFINAL assume true; 732#recEXIT >#29#return; 731#L17-1 #res := #t~ret6;havoc #t~ret6; 730#recFINAL assume true; 728#recEXIT >#31#return; 725#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 726#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 715#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 706#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 712#recENTRY [2019-11-20 02:23:57,761 INFO L796 eck$LassoCheckResult]: Loop: 712#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 704#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 705#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 712#recENTRY [2019-11-20 02:23:57,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:57,761 INFO L82 PathProgramCache]: Analyzing trace with hash 770731142, now seen corresponding path program 2 times [2019-11-20 02:23:57,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:57,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753478800] [2019-11-20 02:23:57,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 02:23:58,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753478800] [2019-11-20 02:23:58,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412604712] [2019-11-20 02:23:58,145 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:23:58,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:23:58,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:23:58,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-20 02:23:58,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:58,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 02:23:58,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:58,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:58,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:23:58,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 02:23:58,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:58,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 02:23:58,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:58,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:58,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2019-11-20 02:23:58,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:58,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:58,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:23:58,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2019-11-20 02:23:58,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-20 02:23:58,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:58,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:58,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:23:58,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:41 [2019-11-20 02:23:58,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2019-11-20 02:23:58,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:58,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:58,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:23:58,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:29 [2019-11-20 02:23:58,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-20 02:23:58,889 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:23:58,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:58,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:23:58,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:14 [2019-11-20 02:23:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 02:23:58,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:23:58,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-11-20 02:23:58,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567972445] [2019-11-20 02:23:58,914 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 02:23:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 2 times [2019-11-20 02:23:58,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:58,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870632432] [2019-11-20 02:23:58,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:58,924 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:59,048 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-20 02:23:59,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:23:59,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 02:23:59,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-11-20 02:23:59,207 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 32 states. [2019-11-20 02:23:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:59,596 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-20 02:23:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 02:23:59,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2019-11-20 02:23:59,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:23:59,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2019-11-20 02:23:59,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-20 02:23:59,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-20 02:23:59,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-11-20 02:23:59,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:23:59,600 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-20 02:23:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-11-20 02:23:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-11-20 02:23:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 02:23:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-11-20 02:23:59,605 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-20 02:23:59,605 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-20 02:23:59,605 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 02:23:59,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-11-20 02:23:59,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 02:23:59,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:59,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:59,607 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 02:23:59,607 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:23:59,608 INFO L794 eck$LassoCheckResult]: Stem: 1004#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 995#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 996#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 1006#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 998#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 999#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1021#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 992#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 991#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 994#recFINAL assume true; 1009#recEXIT >#29#return; 1010#L17-1 #res := #t~ret6;havoc #t~ret6; 1011#recFINAL assume true; 1007#recEXIT >#29#return; 1008#L17-1 #res := #t~ret6;havoc #t~ret6; 1026#recFINAL assume true; 1024#recEXIT >#29#return; 1020#L17-1 #res := #t~ret6;havoc #t~ret6; 1022#recFINAL assume true; 1019#recEXIT >#29#return; 1018#L17-1 #res := #t~ret6;havoc #t~ret6; 1017#recFINAL assume true; 1015#recEXIT >#31#return; 1012#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 1013#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 1005#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 990#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 997#recENTRY [2019-11-20 02:23:59,608 INFO L796 eck$LassoCheckResult]: Loop: 997#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 988#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 989#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 997#recENTRY [2019-11-20 02:23:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:59,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1655830132, now seen corresponding path program 3 times [2019-11-20 02:23:59,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:59,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515769580] [2019-11-20 02:23:59,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 3 times [2019-11-20 02:23:59,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:59,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732647991] [2019-11-20 02:23:59,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,701 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:59,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1136068004, now seen corresponding path program 4 times [2019-11-20 02:23:59,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:59,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157819628] [2019-11-20 02:23:59,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:59,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:59,960 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-20 02:24:00,762 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-11-20 02:24:00,946 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 02:24:01,395 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-11-20 02:24:02,066 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-11-20 02:24:02,267 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-20 02:24:02,876 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-11-20 02:24:03,066 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-20 02:24:03,277 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-20 02:24:03,431 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-20 02:24:05,342 WARN L191 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 243 DAG size of output: 210 [2019-11-20 02:24:05,770 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-11-20 02:24:06,224 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-20 02:24:06,475 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-20 02:24:06,479 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:24:06,479 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:24:06,479 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:24:06,479 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:24:06,479 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:24:06,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:06,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:24:06,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:24:06,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration7_Lasso [2019-11-20 02:24:06,479 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:24:06,479 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:24:06,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,748 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-20 02:24:06,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:06,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:24:07,020 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-20 02:24:14,189 WARN L191 SmtUtils]: Spent 7.12 s on a formula simplification. DAG size of input: 174 DAG size of output: 174 [2019-11-20 02:24:14,336 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:24:14,336 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:24:14,349 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-11-20 02:24:14,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:14,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:24:14,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:14,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:14,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:14,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:24:14,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:14,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:24:14,361 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-11-20 02:24:14,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:14,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:24:14,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:14,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:14,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:14,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:24:14,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:14,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:24:14,373 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-11-20 02:24:14,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:14,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:24:14,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:14,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:14,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:14,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:24:14,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:14,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:24:14,385 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-11-20 02:24:14,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:14,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:24:14,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:14,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:14,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:14,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:24:14,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:14,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:24:14,395 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-11-20 02:24:14,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:14,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:14,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:14,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:14,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:24:14,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:14,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:24:14,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-11-20 02:24:14,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:14,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:24:14,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:14,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:14,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:14,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:14,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:24:14,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:14,427 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-11-20 02:24:14,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:14,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:24:14,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:14,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:14,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:14,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:24:14,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:24:14,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:14,434 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-11-20 02:24:14,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:14,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:14,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:14,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:14,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:24:14,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:24:14,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:14,446 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-11-20 02:24:14,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:14,447 INFO L203 nArgumentSynthesizer]: 128 stem disjuncts [2019-11-20 02:24:14,448 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-20 02:24:14,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:14,758 INFO L401 nArgumentSynthesizer]: We have 524 Motzkin's Theorem applications. [2019-11-20 02:24:14,758 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-20 02:24:15,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:15,285 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-11-20 02:24:15,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:15,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:15,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:15,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:15,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:24:15,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:24:15,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:15,297 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-11-20 02:24:15,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:15,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:15,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:15,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:15,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:24:15,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:24:15,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:15,323 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-11-20 02:24:15,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:15,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:15,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:15,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:15,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:24:15,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:24:15,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:15,341 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-11-20 02:24:15,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:15,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:15,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:15,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:15,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:24:15,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:24:15,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:15,357 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-11-20 02:24:15,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:24:15,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:24:15,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:24:15,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:24:15,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 02:24:15,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 02:24:15,369 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:24:15,386 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-20 02:24:15,386 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c62aa3ae-b423-4219-ab2f-b6d6b6b66f10/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:24:15,390 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:24:15,391 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 02:24:15,392 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:24:15,392 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2019-11-20 02:24:15,400 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-20 02:24:15,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 02:24:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:15,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:24:15,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:15,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 02:24:15,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:15,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 02:24:15,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:15,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:15,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:24:15,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-20 02:24:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:24:15,579 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-20 02:24:15,579 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-20 02:24:15,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 14 states. [2019-11-20 02:24:15,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-20 02:24:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 02:24:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-20 02:24:15,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-20 02:24:15,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:24:15,634 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 02:24:15,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:15,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:24:15,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:15,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:15,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 02:24:15,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:15,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 02:24:15,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:15,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:15,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:24:15,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-20 02:24:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:24:15,783 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-20 02:24:15,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-20 02:24:15,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 14 states. [2019-11-20 02:24:15,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-20 02:24:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 02:24:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-20 02:24:15,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-20 02:24:15,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:24:15,834 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 02:24:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:15,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:24:15,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:15,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:15,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 02:24:15,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:15,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-20 02:24:15,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:24:15,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:24:15,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:24:15,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-20 02:24:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:24:15,985 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-20 02:24:15,986 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-20 02:24:16,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 63 states and 72 transitions. Complement of second has 15 states. [2019-11-20 02:24:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-20 02:24:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-20 02:24:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-11-20 02:24:16,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-20 02:24:16,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:24:16,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 40 letters. Loop has 3 letters. [2019-11-20 02:24:16,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:24:16,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 37 letters. Loop has 6 letters. [2019-11-20 02:24:16,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:24:16,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2019-11-20 02:24:16,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 02:24:16,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2019-11-20 02:24:16,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 02:24:16,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 02:24:16,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 02:24:16,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:24:16,068 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:24:16,068 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:24:16,068 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:24:16,068 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 02:24:16,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 02:24:16,069 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 02:24:16,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 02:24:16,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 02:24:16 BoogieIcfgContainer [2019-11-20 02:24:16,074 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 02:24:16,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:24:16,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:24:16,074 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:24:16,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:23:46" (3/4) ... [2019-11-20 02:24:16,078 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 02:24:16,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:24:16,079 INFO L168 Benchmark]: Toolchain (without parser) took 30615.36 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 586.7 MB). Free memory was 950.1 MB in the beginning and 987.1 MB in the end (delta: -37.0 MB). Peak memory consumption was 549.7 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:16,080 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:24:16,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:16,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:24:16,081 INFO L168 Benchmark]: Boogie Preprocessor took 19.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:24:16,081 INFO L168 Benchmark]: RCFGBuilder took 279.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:16,082 INFO L168 Benchmark]: BuchiAutomizer took 29933.31 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 474.0 MB). Free memory was 1.1 GB in the beginning and 987.1 MB in the end (delta: 95.1 MB). Peak memory consumption was 569.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:24:16,082 INFO L168 Benchmark]: Witness Printer took 4.30 ms. Allocated memory is still 1.6 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:24:16,085 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 279.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29933.31 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 474.0 MB). Free memory was 1.1 GB in the beginning and 987.1 MB in the end (delta: 95.1 MB). Peak memory consumption was 569.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.30 ms. Allocated memory is still 1.6 GB. Free memory is still 987.1 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[ip][ip] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.8s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 27.3s. Construction of modules took 0.7s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 30/30 HoareTripleCheckerStatistics: 82 SDtfs, 61 SDslu, 243 SDs, 0 SdLazy, 618 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital364 mio100 ax100 hnf100 lsp97 ukn53 mio100 lsp31 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf2648 smp80 tf100 neg86 sie150 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 1979ms VariablesStem: 3 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 16 SupportingInvariants: 32 MotzkinApplications: 608 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...