./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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.25-9a8b2e8 [2020-10-20 08:19:39,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:19:39,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:19:39,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:19:39,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:19:39,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:19:39,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:19:39,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:19:39,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:19:39,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:19:39,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:19:39,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:19:39,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:19:39,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:19:39,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:19:39,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:19:39,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:19:39,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:19:39,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:19:39,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:19:39,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:19:39,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:19:39,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:19:39,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:19:39,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:19:39,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:19:39,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:19:39,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:19:39,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:19:39,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:19:39,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:19:39,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:19:39,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:19:39,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:19:39,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:19:39,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:19:39,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:19:39,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:19:39,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:19:39,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:19:39,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:19:39,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:19:39,846 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:19:39,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:19:39,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:19:39,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:19:39,847 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:19:39,848 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:19:39,848 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:19:39,848 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:19:39,848 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:19:39,848 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:19:39,849 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:19:39,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:19:39,849 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:19:39,849 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:19:39,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:19:39,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:19:39,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:19:39,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:19:39,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:19:39,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:19:39,850 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:19:39,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:19:39,851 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:19:39,851 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:19:39,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:19:39,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:19:39,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:19:39,852 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:19:39,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:19:39,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:19:39,852 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:19:39,852 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:19:39,853 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:19:39,853 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 [2020-10-20 08:19:40,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:19:40,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:19:40,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:19:40,088 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:19:40,088 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:19:40,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2020-10-20 08:19:40,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf631d49b/a150eac5a9804dd79b2a88dc70520469/FLAG9f9f69934 [2020-10-20 08:19:40,724 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:19:40,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2020-10-20 08:19:40,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf631d49b/a150eac5a9804dd79b2a88dc70520469/FLAG9f9f69934 [2020-10-20 08:19:40,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf631d49b/a150eac5a9804dd79b2a88dc70520469 [2020-10-20 08:19:40,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:19:40,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:19:40,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:40,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:19:40,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:19:40,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:40" (1/1) ... [2020-10-20 08:19:40,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4072de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:40, skipping insertion in model container [2020-10-20 08:19:40,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:40" (1/1) ... [2020-10-20 08:19:40,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:19:40,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:19:41,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:41,450 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:19:41,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:41,642 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:19:41,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41 WrapperNode [2020-10-20 08:19:41,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:41,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:41,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:19:41,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:19:41,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (1/1) ... [2020-10-20 08:19:41,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (1/1) ... [2020-10-20 08:19:41,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:41,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:19:41,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:19:41,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:19:41,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (1/1) ... [2020-10-20 08:19:41,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (1/1) ... [2020-10-20 08:19:41,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (1/1) ... [2020-10-20 08:19:41,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (1/1) ... [2020-10-20 08:19:41,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (1/1) ... [2020-10-20 08:19:41,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (1/1) ... [2020-10-20 08:19:41,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (1/1) ... [2020-10-20 08:19:41,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:19:41,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:19:41,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:19:41,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:19:41,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (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 [2020-10-20 08:19:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 08:19:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 08:19:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:19:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 08:19:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:19:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-10-20 08:19:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:19:41,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:19:42,140 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:19:42,140 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-20 08:19:42,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:42 BoogieIcfgContainer [2020-10-20 08:19:42,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:19:42,143 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:19:42,143 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:19:42,147 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:19:42,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:42,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:19:40" (1/3) ... [2020-10-20 08:19:42,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17e332b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:42, skipping insertion in model container [2020-10-20 08:19:42,149 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:42,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:41" (2/3) ... [2020-10-20 08:19:42,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17e332b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:42, skipping insertion in model container [2020-10-20 08:19:42,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:42,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:42" (3/3) ... [2020-10-20 08:19:42,152 INFO L373 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_1.i [2020-10-20 08:19:42,211 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:19:42,211 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:19:42,211 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:19:42,211 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:19:42,212 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:19:42,212 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:19:42,212 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:19:42,212 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:19:42,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-20 08:19:42,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:19:42,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:42,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:42,250 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:19:42,251 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 08:19:42,251 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:19:42,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-20 08:19:42,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:19:42,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:42,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:42,254 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:19:42,254 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 08:19:42,258 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 [2020-10-20 08:19:42,259 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 [2020-10-20 08:19:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:42,265 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-10-20 08:19:42,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:42,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465500752] [2020-10-20 08:19:42,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:42,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465500752] [2020-10-20 08:19:42,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:42,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:19:42,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206192408] [2020-10-20 08:19:42,482 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:19:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2020-10-20 08:19:42,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:42,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003730162] [2020-10-20 08:19:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:42,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:42,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:42,581 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:42,789 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-10-20 08:19:42,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:19:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:19:42,916 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2020-10-20 08:19:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:42,996 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-10-20 08:19:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:19:42,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2020-10-20 08:19:43,001 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-10-20 08:19:43,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 25 transitions. [2020-10-20 08:19:43,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-20 08:19:43,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 08:19:43,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2020-10-20 08:19:43,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:43,008 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-20 08:19:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2020-10-20 08:19:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2020-10-20 08:19:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 08:19:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2020-10-20 08:19:43,039 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-10-20 08:19:43,039 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-10-20 08:19:43,039 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:19:43,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2020-10-20 08:19:43,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:19:43,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:43,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:43,041 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 08:19:43,041 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 08:19:43,041 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 [2020-10-20 08:19:43,041 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 [2020-10-20 08:19:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2020-10-20 08:19:43,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:43,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043464257] [2020-10-20 08:19:43,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:43,058 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:43,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:43,075 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:43,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:43,076 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2020-10-20 08:19:43,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:43,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033066468] [2020-10-20 08:19:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:43,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:43,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:43,108 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:43,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2020-10-20 08:19:43,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:43,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820205474] [2020-10-20 08:19:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:43,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:43,159 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:43,166 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:43,344 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-10-20 08:19:43,620 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2020-10-20 08:19:43,709 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:19:43,710 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:19:43,710 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:19:43,710 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:19:43,711 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:19:43,711 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:43,711 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:19:43,711 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:19:43,712 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration2_Lasso [2020-10-20 08:19:43,712 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:19:43,712 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:19:43,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:43,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:43,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:43,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:43,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:43,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:43,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:43,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:43,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:43,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:44,025 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-20 08:19:44,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:44,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:44,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:44,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:44,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:44,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:44,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:44,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:44,694 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-10-20 08:19:44,810 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:19:44,816 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:44,831 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 [2020-10-20 08:19:44,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:44,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:44,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:44,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:44,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:44,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:44,844 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) [2020-10-20 08:19:44,882 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 [2020-10-20 08:19:44,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:44,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:44,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:44,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:44,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:44,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:44,886 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 [2020-10-20 08:19:44,888 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:44,919 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 [2020-10-20 08:19:44,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:44,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:44,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:44,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:44,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:44,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:44,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:44,923 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:44,949 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 [2020-10-20 08:19:44,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:44,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:44,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:44,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:44,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:44,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:44,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:44,954 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:44,978 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 [2020-10-20 08:19:44,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:44,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:44,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:44,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:44,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:44,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:44,992 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) [2020-10-20 08:19:45,034 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 [2020-10-20 08:19:45,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:45,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:45,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:45,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:45,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:45,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:45,037 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 [2020-10-20 08:19:45,039 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:45,065 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 [2020-10-20 08:19:45,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:45,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:45,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:45,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:45,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:45,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:45,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:45,069 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) [2020-10-20 08:19:45,093 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 [2020-10-20 08:19:45,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:45,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:45,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:45,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:45,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:45,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:45,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:45,098 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:45,123 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 [2020-10-20 08:19:45,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:45,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:45,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:45,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:45,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:45,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:45,133 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:45,178 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 [2020-10-20 08:19:45,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:45,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:45,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:45,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:45,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:45,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:45,187 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 [2020-10-20 08:19:45,211 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 [2020-10-20 08:19:45,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:45,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:45,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:45,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:45,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:45,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:45,255 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:19:45,300 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-20 08:19:45,300 INFO L444 ModelExtractionUtils]: 9 out of 34 variables were initially zero. Simplification set additionally 22 variables to zero. 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 [2020-10-20 08:19:45,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:19:45,311 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:19:45,311 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:19:45,312 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~0, ULTIMATE.start_entry_point_~len~0) = -1*ULTIMATE.start_entry_point_~i~0 + 1*ULTIMATE.start_entry_point_~len~0 Supporting invariants [] [2020-10-20 08:19:45,379 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2020-10-20 08:19:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:45,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:19:45,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:45,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:19:45,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:45,534 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 [2020-10-20 08:19:45,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-20 08:19:45,603 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 6 states. [2020-10-20 08:19:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:19:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-10-20 08:19:45,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2020-10-20 08:19:45,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:45,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2020-10-20 08:19:45,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:45,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2020-10-20 08:19:45,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:45,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2020-10-20 08:19:45,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 08:19:45,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2020-10-20 08:19:45,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 08:19:45,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 08:19:45,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-10-20 08:19:45,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:45,625 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 08:19:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-10-20 08:19:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2020-10-20 08:19:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:19:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-10-20 08:19:45,629 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 08:19:45,629 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 08:19:45,629 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:19:45,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-10-20 08:19:45,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:19:45,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:45,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:45,632 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:45,632 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:19:45,633 INFO L794 eck$LassoCheckResult]: Stem: 185#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); 182#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; 172#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; 173#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; 183#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 184#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 170#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 171#L773-3 [2020-10-20 08:19:45,633 INFO L796 eck$LassoCheckResult]: Loop: 171#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; 174#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 171#L773-3 [2020-10-20 08:19:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968475, now seen corresponding path program 1 times [2020-10-20 08:19:45,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:45,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571109210] [2020-10-20 08:19:45,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:45,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571109210] [2020-10-20 08:19:45,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:45,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:19:45,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872248431] [2020-10-20 08:19:45,715 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:19:45,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:45,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2020-10-20 08:19:45,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:45,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370342378] [2020-10-20 08:19:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:45,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:45,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:45,737 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:45,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:45,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:19:45,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:19:45,779 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-20 08:19:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:45,808 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-10-20 08:19:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:19:45,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2020-10-20 08:19:45,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 08:19:45,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2020-10-20 08:19:45,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 08:19:45,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 08:19:45,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2020-10-20 08:19:45,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:45,817 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-20 08:19:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2020-10-20 08:19:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2020-10-20 08:19:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:19:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-10-20 08:19:45,825 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-10-20 08:19:45,825 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-10-20 08:19:45,825 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:19:45,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-10-20 08:19:45,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:19:45,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:45,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:45,827 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:45,827 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:19:45,828 INFO L794 eck$LassoCheckResult]: Stem: 236#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); 233#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; 223#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; 224#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; 234#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 235#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; 226#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 227#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; 230#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 221#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 222#L773-3 [2020-10-20 08:19:45,828 INFO L796 eck$LassoCheckResult]: Loop: 222#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; 225#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 222#L773-3 [2020-10-20 08:19:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:45,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218535, now seen corresponding path program 1 times [2020-10-20 08:19:45,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:45,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584210387] [2020-10-20 08:19:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:45,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:45,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:45,884 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 2 times [2020-10-20 08:19:45,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:45,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637737322] [2020-10-20 08:19:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:45,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:45,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:45,912 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:45,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2113388251, now seen corresponding path program 1 times [2020-10-20 08:19:45,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:45,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724654255] [2020-10-20 08:19:45,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:45,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724654255] [2020-10-20 08:19:45,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:45,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:19:45,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652246353] [2020-10-20 08:19:45,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:45,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:19:45,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:19:45,975 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-20 08:19:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:46,022 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-10-20 08:19:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:19:46,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2020-10-20 08:19:46,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:19:46,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2020-10-20 08:19:46,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 08:19:46,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-20 08:19:46,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2020-10-20 08:19:46,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:46,026 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-10-20 08:19:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2020-10-20 08:19:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2020-10-20 08:19:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:19:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-10-20 08:19:46,029 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-20 08:19:46,029 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-20 08:19:46,029 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:19:46,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2020-10-20 08:19:46,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:19:46,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:46,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:46,031 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:46,031 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:19:46,031 INFO L794 eck$LassoCheckResult]: Stem: 290#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); 287#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; 277#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; 278#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; 288#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 289#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; 282#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 283#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; 285#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); 286#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 291#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 275#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 276#L773-3 [2020-10-20 08:19:46,031 INFO L796 eck$LassoCheckResult]: Loop: 276#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; 279#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 276#L773-3 [2020-10-20 08:19:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:46,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2113443111, now seen corresponding path program 1 times [2020-10-20 08:19:46,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:46,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508513615] [2020-10-20 08:19:46,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:46,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508513615] [2020-10-20 08:19:46,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:46,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:19:46,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906477237] [2020-10-20 08:19:46,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:19:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 3 times [2020-10-20 08:19:46,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:46,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700462474] [2020-10-20 08:19:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,076 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:46,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:46,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:19:46,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:19:46,107 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-10-20 08:19:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:46,138 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-10-20 08:19:46,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:19:46,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2020-10-20 08:19:46,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:19:46,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2020-10-20 08:19:46,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-20 08:19:46,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 08:19:46,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2020-10-20 08:19:46,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:46,142 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-10-20 08:19:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2020-10-20 08:19:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-10-20 08:19:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:19:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-10-20 08:19:46,145 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-20 08:19:46,145 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-20 08:19:46,145 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:19:46,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-10-20 08:19:46,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:19:46,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:46,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:46,147 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:46,147 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:19:46,147 INFO L794 eck$LassoCheckResult]: Stem: 343#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); 340#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; 330#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; 331#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; 341#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 342#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; 335#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; 336#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; 338#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); 339#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 344#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 328#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 329#L773-3 [2020-10-20 08:19:46,148 INFO L796 eck$LassoCheckResult]: Loop: 329#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; 332#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 329#L773-3 [2020-10-20 08:19:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2056184809, now seen corresponding path program 1 times [2020-10-20 08:19:46,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:46,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085427596] [2020-10-20 08:19:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:46,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085427596] [2020-10-20 08:19:46,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960130259] [2020-10-20 08:19:46,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:19:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:46,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:19:46,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:46,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:19:46,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-20 08:19:46,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818225536] [2020-10-20 08:19:46,287 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:19:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 4 times [2020-10-20 08:19:46,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:46,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137055544] [2020-10-20 08:19:46,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,296 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:46,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 08:19:46,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-20 08:19:46,345 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-10-20 08:19:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:46,377 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-10-20 08:19:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:19:46,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2020-10-20 08:19:46,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 08:19:46,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2020-10-20 08:19:46,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 08:19:46,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 08:19:46,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2020-10-20 08:19:46,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:19:46,380 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-10-20 08:19:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2020-10-20 08:19:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2020-10-20 08:19:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 08:19:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-10-20 08:19:46,383 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-20 08:19:46,383 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-20 08:19:46,383 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:19:46,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2020-10-20 08:19:46,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:19:46,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:46,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:46,385 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:46,385 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:19:46,385 INFO L794 eck$LassoCheckResult]: Stem: 435#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); 432#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; 422#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; 423#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; 433#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 434#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; 437#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; 438#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; 430#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); 431#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 436#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; 425#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 426#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; 429#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 420#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 421#L773-3 [2020-10-20 08:19:46,386 INFO L796 eck$LassoCheckResult]: Loop: 421#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; 424#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 421#L773-3 [2020-10-20 08:19:46,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash 979558027, now seen corresponding path program 1 times [2020-10-20 08:19:46,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:46,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373423511] [2020-10-20 08:19:46,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,417 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:46,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:46,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 5 times [2020-10-20 08:19:46,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:46,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685601115] [2020-10-20 08:19:46,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,426 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash 757427661, now seen corresponding path program 1 times [2020-10-20 08:19:46,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:46,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497894651] [2020-10-20 08:19:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:46,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:46,465 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:47,099 WARN L193 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 144 [2020-10-20 08:19:47,253 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-20 08:19:47,264 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:19:47,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:19:47,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:19:47,265 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:19:47,265 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:19:47,265 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:47,265 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:19:47,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:19:47,265 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration7_Lasso [2020-10-20 08:19:47,265 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:19:47,265 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:19:47,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,526 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-10-20 08:19:47,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:47,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:19:48,082 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2020-10-20 08:19:48,136 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:19:48,136 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,145 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 [2020-10-20 08:19:48,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:48,156 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 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 [2020-10-20 08:19:48,191 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 [2020-10-20 08:19:48,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,202 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 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 [2020-10-20 08:19:48,235 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 [2020-10-20 08:19:48,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,238 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) [2020-10-20 08:19:48,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:48,271 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 [2020-10-20 08:19:48,294 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 [2020-10-20 08:19:48,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:48,300 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) [2020-10-20 08:19:48,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,327 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:19:48,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:48,362 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,390 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 [2020-10-20 08:19:48,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,393 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,419 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 [2020-10-20 08:19:48,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,424 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,447 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 [2020-10-20 08:19:48,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,451 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,485 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 [2020-10-20 08:19:48,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,489 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,511 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 [2020-10-20 08:19:48,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:48,519 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,543 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 [2020-10-20 08:19:48,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,547 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,575 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 [2020-10-20 08:19:48,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:48,582 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,605 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 [2020-10-20 08:19:48,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,609 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,631 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 [2020-10-20 08:19:48,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,635 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,659 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 [2020-10-20 08:19:48,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:48,665 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) [2020-10-20 08:19:48,699 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 [2020-10-20 08:19:48,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,707 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 [2020-10-20 08:19:48,730 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 [2020-10-20 08:19:48,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:48,741 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 [2020-10-20 08:19:48,766 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 [2020-10-20 08:19:48,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,769 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,791 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 [2020-10-20 08:19:48,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,797 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,824 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 [2020-10-20 08:19:48,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:19:48,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:19:48,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:19:48,829 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,853 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 [2020-10-20 08:19:48,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:19:48,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:19:48,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:19:48,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:19:48,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:19:48,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:19:48,880 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:19:48,924 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2020-10-20 08:19:48,924 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:19:48,933 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:48,941 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:19:48,941 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:19:48,941 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 [] [2020-10-20 08:19:48,979 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-10-20 08:19:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:49,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:19:49,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:49,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:19:49,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:19:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:19:49,032 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 [2020-10-20 08:19:49,032 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-10-20 08:19:49,041 INFO L75 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. [2020-10-20 08:19:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:19:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:19:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-10-20 08:19:49,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2020-10-20 08:19:49,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:49,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-10-20 08:19:49,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:49,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2020-10-20 08:19:49,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:19:49,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2020-10-20 08:19:49,054 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:19:49,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2020-10-20 08:19:49,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:19:49,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:19:49,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:19:49,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:49,055 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:19:49,055 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:19:49,055 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:19:49,055 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:19:49,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:19:49,056 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:19:49,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:19:49,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:19:49 BoogieIcfgContainer [2020-10-20 08:19:49,081 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:19:49,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:19:49,083 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:19:49,083 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:19:49,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:42" (3/4) ... [2020-10-20 08:19:49,090 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:19:49,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:19:49,107 INFO L168 Benchmark]: Toolchain (without parser) took 8194.63 ms. Allocated memory was 36.7 MB in the beginning and 92.3 MB in the end (delta: 55.6 MB). Free memory was 15.4 MB in the beginning and 64.9 MB in the end (delta: -49.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:49,108 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 34.1 MB. Free memory was 9.8 MB in the beginning and 9.7 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. [2020-10-20 08:19:49,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.23 ms. Allocated memory was 36.7 MB in the beginning and 46.7 MB in the end (delta: 10.0 MB). Free memory was 14.5 MB in the beginning and 15.1 MB in the end (delta: -539.9 kB). Peak memory consumption was 14.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:49,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.10 ms. Allocated memory is still 46.7 MB. Free memory was 14.8 MB in the beginning and 12.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:49,116 INFO L168 Benchmark]: Boogie Preprocessor took 36.48 ms. Allocated memory was 46.7 MB in the beginning and 47.2 MB in the end (delta: 524.3 kB). Free memory was 12.5 MB in the beginning and 28.7 MB in the end (delta: -16.2 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:49,117 INFO L168 Benchmark]: RCFGBuilder took 405.27 ms. Allocated memory was 47.2 MB in the beginning and 48.2 MB in the end (delta: 1.0 MB). Free memory was 28.7 MB in the beginning and 27.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:49,118 INFO L168 Benchmark]: BuchiAutomizer took 6938.21 ms. Allocated memory was 48.2 MB in the beginning and 92.3 MB in the end (delta: 44.0 MB). Free memory was 26.8 MB in the beginning and 65.9 MB in the end (delta: -39.1 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:49,119 INFO L168 Benchmark]: Witness Printer took 10.67 ms. Allocated memory is still 92.3 MB. Free memory is still 64.9 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:19:49,130 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 34.1 MB. Free memory was 9.8 MB in the beginning and 9.7 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 737.23 ms. Allocated memory was 36.7 MB in the beginning and 46.7 MB in the end (delta: 10.0 MB). Free memory was 14.5 MB in the beginning and 15.1 MB in the end (delta: -539.9 kB). Peak memory consumption was 14.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 56.10 ms. Allocated memory is still 46.7 MB. Free memory was 14.8 MB in the beginning and 12.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 36.48 ms. Allocated memory was 46.7 MB in the beginning and 47.2 MB in the end (delta: 524.3 kB). Free memory was 12.5 MB in the beginning and 28.7 MB in the end (delta: -16.2 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 405.27 ms. Allocated memory was 47.2 MB in the beginning and 48.2 MB in the end (delta: 1.0 MB). Free memory was 28.7 MB in the beginning and 27.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 6938.21 ms. Allocated memory was 48.2 MB in the beginning and 92.3 MB in the end (delta: 44.0 MB). Free memory was 26.8 MB in the beginning and 65.9 MB in the end (delta: -39.1 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.3 GB. * Witness Printer took 10.67 ms. Allocated memory is still 92.3 MB. Free memory is still 64.9 MB. There was no memory consumed. Max. memory is 14.3 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 -1 * i + len and consists of 4 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 6.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. 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, 146 SDslu, 108 SDs, 0 SdLazy, 92 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax111 hnf101 lsp83 ukn55 mio100 lsp52 div100 bol100 ite100 ukn100 eq188 hnf89 smp100 dnf119 smp90 tf100 neg95 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms 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...