./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb53649e57c73811eb036860baf1102917fa8259 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:54:14,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:54:14,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:54:14,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:54:14,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:54:14,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:54:14,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:54:14,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:54:14,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:54:14,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:54:14,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:54:14,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:54:14,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:54:14,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:54:14,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:54:14,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:54:14,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:54:14,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:54:14,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:54:14,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:54:14,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:54:14,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:54:14,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:54:14,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:54:14,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:54:14,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:54:14,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:54:14,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:54:14,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:54:14,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:54:14,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:54:14,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:54:14,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:54:14,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:54:14,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:54:14,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:54:14,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:54:14,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:54:14,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:54:14,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:54:14,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:54:14,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:54:14,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:54:14,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:54:14,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:54:14,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:54:14,504 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:54:14,504 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:54:14,505 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:54:14,505 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:54:14,505 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:54:14,505 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:54:14,506 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:54:14,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:54:14,506 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:54:14,507 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:54:14,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:54:14,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:54:14,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:54:14,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:54:14,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:54:14,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:54:14,510 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:54:14,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:54:14,510 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:54:14,511 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:54:14,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:54:14,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:54:14,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:54:14,512 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:54:14,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:54:14,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:54:14,513 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:54:14,515 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:54:14,516 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb53649e57c73811eb036860baf1102917fa8259 [2019-11-28 03:54:14,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:54:14,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:54:14,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:54:14,859 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:54:14,859 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:54:14,860 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2019-11-28 03:54:14,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004738204/d0fd6c11431b4bf1b6342ddb941f7f93/FLAG22d6d3d84 [2019-11-28 03:54:15,551 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:54:15,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2019-11-28 03:54:15,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004738204/d0fd6c11431b4bf1b6342ddb941f7f93/FLAG22d6d3d84 [2019-11-28 03:54:15,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004738204/d0fd6c11431b4bf1b6342ddb941f7f93 [2019-11-28 03:54:15,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:54:15,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:54:15,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:15,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:54:15,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:54:15,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21695d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15, skipping insertion in model container [2019-11-28 03:54:15,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:54:15,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:54:16,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:16,346 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:54:16,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:16,556 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:54:16,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16 WrapperNode [2019-11-28 03:54:16,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:16,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:16,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:54:16,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:54:16,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... [2019-11-28 03:54:16,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... [2019-11-28 03:54:16,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:16,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:54:16,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:54:16,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:54:16,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... [2019-11-28 03:54:16,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... [2019-11-28 03:54:16,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... [2019-11-28 03:54:16,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... [2019-11-28 03:54:16,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... [2019-11-28 03:54:16,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... [2019-11-28 03:54:16,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... [2019-11-28 03:54:16,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:54:16,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:54:16,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:54:16,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:54:16,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:54:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:54:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:54:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:54:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:54:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 03:54:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:54:16,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:54:17,061 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:54:17,062 INFO L297 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-28 03:54:17,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:17 BoogieIcfgContainer [2019-11-28 03:54:17,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:54:17,064 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:54:17,064 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:54:17,068 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:54:17,070 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:17,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:54:15" (1/3) ... [2019-11-28 03:54:17,071 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53a07033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:17, skipping insertion in model container [2019-11-28 03:54:17,072 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:17,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:16" (2/3) ... [2019-11-28 03:54:17,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53a07033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:17, skipping insertion in model container [2019-11-28 03:54:17,073 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:17,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:17" (3/3) ... [2019-11-28 03:54:17,075 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_1.i [2019-11-28 03:54:17,116 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:54:17,116 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:54:17,116 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:54:17,116 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:54:17,117 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:54:17,117 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:54:17,117 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:54:17,117 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:54:17,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:54:17,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:54:17,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:17,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:17,160 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:54:17,161 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:54:17,161 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:54:17,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:54:17,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:54:17,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:17,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:17,164 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:54:17,164 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:54:17,170 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 10#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 4#L526true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 16#L529true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 11#L766true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 14#L767-3true [2019-11-28 03:54:17,171 INFO L796 eck$LassoCheckResult]: Loop: 14#L767-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 6#L526-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 17#L529-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 9#L769true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 13#L767-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 14#L767-3true [2019-11-28 03:54:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 03:54:17,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:17,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302616270] [2019-11-28 03:54:17,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:17,382 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-28 03:54:17,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302616270] [2019-11-28 03:54:17,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:17,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:54:17,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079077992] [2019-11-28 03:54:17,389 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2019-11-28 03:54:17,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:17,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604735456] [2019-11-28 03:54:17,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:17,447 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:17,709 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-28 03:54:17,823 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 03:54:17,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:54:17,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:54:17,848 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-11-28 03:54:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:17,950 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-28 03:54:17,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:17,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-11-28 03:54:17,956 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 03:54:17,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 25 transitions. [2019-11-28 03:54:17,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:54:17,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 03:54:17,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-11-28 03:54:17,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:17,964 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-28 03:54:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-11-28 03:54:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-11-28 03:54:17,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 03:54:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-28 03:54:17,989 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-28 03:54:17,989 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-28 03:54:17,989 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:54:17,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-11-28 03:54:17,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:54:17,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:17,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:17,991 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:54:17,991 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:54:17,991 INFO L794 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 66#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 59#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 60#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 67#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 68#L767-3 [2019-11-28 03:54:17,991 INFO L796 eck$LassoCheckResult]: Loop: 68#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 62#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 63#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 64#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 65#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 68#L767-3 [2019-11-28 03:54:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2019-11-28 03:54:17,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:17,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686194257] [2019-11-28 03:54:17,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:18,027 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2019-11-28 03:54:18,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:18,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931595150] [2019-11-28 03:54:18,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:18,085 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2019-11-28 03:54:18,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:18,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477241734] [2019-11-28 03:54:18,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:18,168 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:18,362 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-28 03:54:18,706 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-11-28 03:54:18,813 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 03:54:18,837 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:54:18,839 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:54:18,839 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:54:18,839 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:54:18,839 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:54:18,840 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:18,840 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:54:18,840 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:54:18,848 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration2_Lasso [2019-11-28 03:54:18,848 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:54:18,849 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:54:18,901 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-28 03:54:18,910 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-28 03:54:18,915 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-28 03:54:18,919 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-28 03:54:18,922 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-28 03:54:18,928 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-28 03:54:18,931 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-28 03:54:18,935 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-28 03:54:18,939 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-28 03:54:18,945 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-28 03:54:18,949 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-28 03:54:18,953 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-28 03:54:19,227 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-28 03:54:19,325 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-28 03:54:19,327 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-28 03:54:19,330 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-28 03:54:19,334 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-28 03:54:19,338 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-28 03:54:19,341 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-28 03:54:20,033 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-28 03:54:20,163 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:54:20,171 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:20,189 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-28 03:54:20,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:20,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:20,225 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-28 03:54:20,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:20,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:20,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:20,245 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-28 03:54:20,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:20,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:20,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:20,266 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-28 03:54:20,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:20,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:20,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:20,288 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-28 03:54:20,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:20,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:20,327 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-28 03:54:20,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:20,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:20,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:20,358 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-28 03:54:20,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:20,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:20,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:20,382 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-28 03:54:20,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:20,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:20,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:20,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:20,408 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-28 03:54:20,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:20,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:20,429 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-28 03:54:20,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:20,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:20,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:20,458 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-28 03:54:20,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:20,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:20,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:20,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:20,472 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-28 03:54:20,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:20,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:20,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:20,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:20,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:20,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:20,523 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:54:20,586 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 03:54:20,587 INFO L444 ModelExtractionUtils]: 18 out of 43 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:20,603 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:20,608 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:54:20,608 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:54:20,609 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~0) = -2*ULTIMATE.start_entry_point_~i~0 + 19 Supporting invariants [-1*ULTIMATE.start_entry_point_~len~0 + 10 >= 0] [2019-11-28 03:54:20,648 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:54:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:20,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 03:54:20,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:20,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:54:20,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:20,781 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-28 03:54:20,789 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:54:20,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 03:54:20,902 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 27 states and 36 transitions. Complement of second has 7 states. [2019-11-28 03:54:20,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:54:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:54:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-28 03:54:20,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-28 03:54:20,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:20,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-28 03:54:20,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:20,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 03:54:20,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:20,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-28 03:54:20,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:54:20,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2019-11-28 03:54:20,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:54:20,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:54:20,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-28 03:54:20,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:20,929 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-28 03:54:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-28 03:54:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-28 03:54:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:54:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 03:54:20,933 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:54:20,933 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:54:20,933 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:54:20,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 03:54:20,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:20,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:20,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:20,936 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:20,937 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:20,937 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 193#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 183#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 184#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 194#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 195#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 181#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 182#L773-3 [2019-11-28 03:54:20,938 INFO L796 eck$LassoCheckResult]: Loop: 182#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 185#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 182#L773-3 [2019-11-28 03:54:20,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968475, now seen corresponding path program 1 times [2019-11-28 03:54:20,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:20,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717047890] [2019-11-28 03:54:20,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:21,041 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-28 03:54:21,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717047890] [2019-11-28 03:54:21,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:21,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:54:21,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578463143] [2019-11-28 03:54:21,043 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:21,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2019-11-28 03:54:21,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082012403] [2019-11-28 03:54:21,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,065 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:21,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:21,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:54:21,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:54:21,097 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 03:54:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:21,121 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-11-28 03:54:21,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:54:21,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-11-28 03:54:21,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:54:21,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2019-11-28 03:54:21,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 03:54:21,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 03:54:21,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-28 03:54:21,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:21,125 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 03:54:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-28 03:54:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-11-28 03:54:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:54:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-28 03:54:21,128 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 03:54:21,128 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 03:54:21,128 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:54:21,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-11-28 03:54:21,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:21,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:21,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:21,130 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:21,130 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:21,130 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 244#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 234#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 235#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 245#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 246#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 237#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 238#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 241#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 232#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 233#L773-3 [2019-11-28 03:54:21,130 INFO L796 eck$LassoCheckResult]: Loop: 233#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 236#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 233#L773-3 [2019-11-28 03:54:21,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218535, now seen corresponding path program 1 times [2019-11-28 03:54:21,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355090543] [2019-11-28 03:54:21,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,156 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 2 times [2019-11-28 03:54:21,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772505055] [2019-11-28 03:54:21,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:21,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2113388251, now seen corresponding path program 1 times [2019-11-28 03:54:21,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537019376] [2019-11-28 03:54:21,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:21,216 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-28 03:54:21,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537019376] [2019-11-28 03:54:21,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:21,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:54:21,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521533835] [2019-11-28 03:54:21,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:21,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:54:21,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:54:21,251 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 03:54:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:21,293 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-11-28 03:54:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:54:21,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-11-28 03:54:21,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:21,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2019-11-28 03:54:21,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:54:21,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:54:21,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-11-28 03:54:21,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:21,300 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-28 03:54:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-11-28 03:54:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-11-28 03:54:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:54:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 03:54:21,307 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 03:54:21,308 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 03:54:21,308 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:54:21,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-28 03:54:21,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:21,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:21,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:21,311 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:21,312 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:21,313 INFO L794 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 298#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 288#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 289#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 299#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 300#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 293#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 294#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 296#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 297#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 302#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 286#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 287#L773-3 [2019-11-28 03:54:21,313 INFO L796 eck$LassoCheckResult]: Loop: 287#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 290#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 287#L773-3 [2019-11-28 03:54:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2113443111, now seen corresponding path program 1 times [2019-11-28 03:54:21,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148360408] [2019-11-28 03:54:21,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:21,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148360408] [2019-11-28 03:54:21,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:21,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:54:21,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565776433] [2019-11-28 03:54:21,382 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:21,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 3 times [2019-11-28 03:54:21,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410213338] [2019-11-28 03:54:21,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:21,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:21,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:54:21,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:54:21,434 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 03:54:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:21,473 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-11-28 03:54:21,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:21,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-11-28 03:54:21,475 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:54:21,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2019-11-28 03:54:21,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:54:21,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 03:54:21,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-11-28 03:54:21,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:21,477 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-28 03:54:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-11-28 03:54:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-28 03:54:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:54:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 03:54:21,483 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:54:21,483 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:54:21,484 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:54:21,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 03:54:21,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:21,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:21,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:21,487 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:21,488 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:21,488 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 351#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 341#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 342#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 352#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 353#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 346#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 347#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 349#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 350#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 355#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 339#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 340#L773-3 [2019-11-28 03:54:21,488 INFO L796 eck$LassoCheckResult]: Loop: 340#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 343#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 340#L773-3 [2019-11-28 03:54:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2056184809, now seen corresponding path program 1 times [2019-11-28 03:54:21,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940693724] [2019-11-28 03:54:21,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:21,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940693724] [2019-11-28 03:54:21,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975860687] [2019-11-28 03:54:21,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:54:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:21,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:54:21,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:21,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:54:21,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-28 03:54:21,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820132365] [2019-11-28 03:54:21,662 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:21,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 4 times [2019-11-28 03:54:21,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020489392] [2019-11-28 03:54:21,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:21,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:21,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:54:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:54:21,711 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-28 03:54:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:21,752 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-11-28 03:54:21,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:21,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-11-28 03:54:21,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:54:21,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2019-11-28 03:54:21,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 03:54:21,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 03:54:21,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2019-11-28 03:54:21,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:21,758 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-28 03:54:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2019-11-28 03:54:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-11-28 03:54:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 03:54:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-28 03:54:21,763 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-28 03:54:21,764 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-28 03:54:21,764 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:54:21,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-11-28 03:54:21,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:21,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:21,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:21,766 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:21,766 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:21,767 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 443#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 433#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 434#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 444#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 445#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 448#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 449#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 441#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 442#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 447#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 436#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 437#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 440#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 431#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 432#L773-3 [2019-11-28 03:54:21,767 INFO L796 eck$LassoCheckResult]: Loop: 432#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 435#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 432#L773-3 [2019-11-28 03:54:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,768 INFO L82 PathProgramCache]: Analyzing trace with hash 979558027, now seen corresponding path program 1 times [2019-11-28 03:54:21,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239220268] [2019-11-28 03:54:21,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 5 times [2019-11-28 03:54:21,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530708645] [2019-11-28 03:54:21,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,813 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:21,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash 757427661, now seen corresponding path program 1 times [2019-11-28 03:54:21,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:21,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678806171] [2019-11-28 03:54:21,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:21,844 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:22,552 WARN L192 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 144 [2019-11-28 03:54:22,740 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-28 03:54:22,750 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:54:22,750 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:54:22,750 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:54:22,750 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:54:22,751 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:54:22,751 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:22,751 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:54:22,751 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:54:22,751 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration7_Lasso [2019-11-28 03:54:22,751 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:54:22,752 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:54:22,757 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-28 03:54:22,764 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-28 03:54:22,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:54:22,791 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-28 03:54:22,799 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-28 03:54:22,802 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-28 03:54:22,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-28 03:54:22,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-28 03:54:22,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-28 03:54:22,810 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-28 03:54:22,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-28 03:54:22,817 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-28 03:54:22,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-28 03:54:22,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-28 03:54:22,828 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-28 03:54:22,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-28 03:54:22,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-28 03:54:23,027 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-28 03:54:23,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:23,082 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-28 03:54:23,084 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-28 03:54:23,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:23,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:23,573 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2019-11-28 03:54:23,632 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:54:23,632 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:23,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:54:23,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:23,683 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-28 03:54:23,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:23,705 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-28 03:54:23,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:23,737 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-28 03:54:23,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:23,763 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-28 03:54:23,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:54:23,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,818 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-28 03:54:23,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,834 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-28 03:54:23,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,848 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-28 03:54:23,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,863 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-28 03:54:23,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:23,876 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-28 03:54:23,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,881 INFO L402 nArgumentSynthesizer]: A total of 2 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-28 03:54:23,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:23,891 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-28 03:54:23,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,895 INFO L402 nArgumentSynthesizer]: A total of 0 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-28 03:54:23,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,906 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-28 03:54:23,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:23,925 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-28 03:54:23,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,943 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-28 03:54:23,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:23,956 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-28 03:54:23,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,958 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-28 03:54:23,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,966 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-28 03:54:23,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,979 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-28 03:54:23,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,990 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-28 03:54:23,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:24,015 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:54:24,064 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 03:54:24,064 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:54:24,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:24,072 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:54:24,072 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:54:24,072 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2019-11-28 03:54:24,090 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:54:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:24,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:54:24,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:24,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:54:24,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:24,143 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-28 03:54:24,143 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:54:24,144 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 03:54:24,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2019-11-28 03:54:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:54:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:54:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-28 03:54:24,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-28 03:54:24,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:24,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-28 03:54:24,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:24,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 03:54:24,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:24,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-28 03:54:24,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:54:24,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-11-28 03:54:24,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:54:24,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:54:24,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:54:24,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:24,157 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:54:24,157 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:54:24,157 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:54:24,157 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:54:24,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:54:24,157 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:54:24,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:54:24,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:54:24 BoogieIcfgContainer [2019-11-28 03:54:24,164 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:54:24,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:54:24,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:54:24,165 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:54:24,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:17" (3/4) ... [2019-11-28 03:54:24,169 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:54:24,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:54:24,171 INFO L168 Benchmark]: Toolchain (without parser) took 8371.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -63.9 MB). Peak memory consumption was 239.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:24,171 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:24,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:24,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:24,173 INFO L168 Benchmark]: Boogie Preprocessor took 29.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:24,174 INFO L168 Benchmark]: RCFGBuilder took 403.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:24,174 INFO L168 Benchmark]: BuchiAutomizer took 7100.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 218.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:24,175 INFO L168 Benchmark]: Witness Printer took 4.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:24,178 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 758.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 403.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7100.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 218.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 19 and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 113 SDtfs, 139 SDslu, 109 SDs, 0 SdLazy, 92 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital255 mio100 ax111 hnf101 lsp83 ukn56 mio100 lsp58 div100 bol100 ite100 ukn100 eq191 hnf90 smp100 dnf109 smp92 tf100 neg98 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...