./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/termination-memory-alloca/a.10-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:10,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:10,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:10,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:10,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:10,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:10,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:10,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:10,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:10,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:10,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:10,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:10,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:10,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:10,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:10,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:10,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:10,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:10,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:10,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:10,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:10,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:10,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:10,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:10,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:10,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:10,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:10,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:10,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:10,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:10,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:10,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:10,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:10,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:10,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:10,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:10,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:10,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:10,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:10,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:10,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:10,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:34:10,198 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:10,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:10,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:10,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:10,203 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:10,203 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:10,204 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:10,204 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:10,204 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:10,207 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:10,208 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:10,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:10,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:10,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:10,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:10,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:10,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:10,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:10,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:10,210 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:10,210 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:10,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:10,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:10,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:10,211 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:10,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:10,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:10,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:10,213 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:10,214 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:10,215 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 [2020-07-29 01:34:10,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:10,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:10,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:10,611 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:10,613 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:10,615 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i [2020-07-29 01:34:10,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cb777f8/8affc322530e4731aa2cae7e75f568f7/FLAGe85183b5b [2020-07-29 01:34:11,172 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:11,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i [2020-07-29 01:34:11,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cb777f8/8affc322530e4731aa2cae7e75f568f7/FLAGe85183b5b [2020-07-29 01:34:11,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cb777f8/8affc322530e4731aa2cae7e75f568f7 [2020-07-29 01:34:11,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:11,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:11,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:11,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:11,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:11,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:11" (1/1) ... [2020-07-29 01:34:11,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51cd7231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:11, skipping insertion in model container [2020-07-29 01:34:11,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:11" (1/1) ... [2020-07-29 01:34:11,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:11,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:12,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:12,049 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:12,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:12,200 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:12,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12 WrapperNode [2020-07-29 01:34:12,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:12,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:12,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:12,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:12,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (1/1) ... [2020-07-29 01:34:12,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (1/1) ... [2020-07-29 01:34:12,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:12,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:12,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:12,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:12,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (1/1) ... [2020-07-29 01:34:12,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (1/1) ... [2020-07-29 01:34:12,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (1/1) ... [2020-07-29 01:34:12,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (1/1) ... [2020-07-29 01:34:12,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (1/1) ... [2020-07-29 01:34:12,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (1/1) ... [2020-07-29 01:34:12,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (1/1) ... [2020-07-29 01:34:12,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:12,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:12,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:12,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:12,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (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-07-29 01:34:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:12,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:12,876 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:12,877 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:34:12,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:12 BoogieIcfgContainer [2020-07-29 01:34:12,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:12,882 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:12,882 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:12,886 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:12,888 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:12,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:11" (1/3) ... [2020-07-29 01:34:12,890 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ff964a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:12, skipping insertion in model container [2020-07-29 01:34:12,890 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:12,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:12" (2/3) ... [2020-07-29 01:34:12,891 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ff964a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:12, skipping insertion in model container [2020-07-29 01:34:12,891 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:12,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:12" (3/3) ... [2020-07-29 01:34:12,894 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.10-alloca.i [2020-07-29 01:34:12,942 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:12,942 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:12,942 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:12,943 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:12,943 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:12,943 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:12,943 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:12,944 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:12,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-29 01:34:12,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:12,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:12,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:12,986 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:12,986 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:12,986 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:12,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-29 01:34:12,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:12,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:12,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:12,990 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:12,990 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:12,997 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 11#L556-2true [2020-07-29 01:34:12,997 INFO L796 eck$LassoCheckResult]: Loop: 11#L556-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 12#L555-1true assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 11#L556-2true [2020-07-29 01:34:13,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:13,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:13,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416047483] [2020-07-29 01:34:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:13,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:13,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:13,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2020-07-29 01:34:13,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:13,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444666628] [2020-07-29 01:34:13,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:13,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:13,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:13,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2020-07-29 01:34:13,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:13,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333777726] [2020-07-29 01:34:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:13,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:13,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:13,392 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:14,048 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2020-07-29 01:34:14,242 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-07-29 01:34:14,257 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:14,258 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:14,258 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:14,259 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:14,259 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:14,259 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:14,259 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:14,260 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:14,260 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.10-alloca.i_Iteration1_Lasso [2020-07-29 01:34:14,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:14,261 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:14,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:14,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:14,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:14,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:14,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:14,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:14,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:14,883 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2020-07-29 01:34:15,020 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-07-29 01:34:15,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:15,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:15,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:15,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:15,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:15,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:15,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:15,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:15,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:16,136 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:16,140 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-07-29 01:34:16,147 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-07-29 01:34:16,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:16,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:16,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:16,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:16,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:16,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:16,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:16,157 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:16,198 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-07-29 01:34:16,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:16,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:16,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:16,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:16,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:16,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:16,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:16,204 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-07-29 01:34:16,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-07-29 01:34:16,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:16,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:16,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:16,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:16,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:16,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:16,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:16,242 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-07-29 01:34:16,265 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-07-29 01:34:16,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:16,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:16,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:16,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:16,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:16,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:16,281 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-07-29 01:34:16,307 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-07-29 01:34:16,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:16,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:16,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:16,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:16,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:16,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:16,318 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:16,345 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-07-29 01:34:16,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:16,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:16,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:16,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:16,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:16,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:16,359 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-07-29 01:34:16,396 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-07-29 01:34:16,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:16,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:16,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:16,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:16,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:16,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:16,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:16,454 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-07-29 01:34:16,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:16,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:16,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:16,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:16,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:16,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:16,489 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:16,630 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:34:16,630 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. 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-07-29 01:34:16,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:16,661 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:16,662 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:16,663 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2020-07-29 01:34:16,828 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2020-07-29 01:34:16,834 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;" [2020-07-29 01:34:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:16,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:16,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:16,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:16,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:16,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {20#unseeded} is VALID [2020-07-29 01:34:16,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {20#unseeded} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {20#unseeded} is VALID [2020-07-29 01:34:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:16,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:34:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:16,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:17,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {156#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:34:17,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {156#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {160#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0)) (<= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem7|) (not (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} is VALID [2020-07-29 01:34:17,036 INFO L280 TraceCheckUtils]: 2: Hoare triple {160#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0)) (<= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem7|) (not (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {148#(or (and (> oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:34:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:17,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:17,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:17,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:17,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,083 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:34:17,084 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2020-07-29 01:34:17,250 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 31 states and 36 transitions. Complement of second has 10 states. [2020-07-29 01:34:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:17,251 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:17,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-29 01:34:17,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:17,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:17,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:17,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:34:17,259 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:34:17,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:17,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:17,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2020-07-29 01:34:17,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:17,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:17,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:17,264 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states. [2020-07-29 01:34:17,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:17,267 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:34:17,267 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:34:17,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:34:17,270 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:17,270 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 36 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:17,271 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:34:17,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:17,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:17,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:17,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:17,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:17,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:17,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:17,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:17,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:17,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:17,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:17,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:17,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:34:17,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:34:17,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:34:17,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:17,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:17,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:17,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:34:17,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:34:17,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:34:17,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:17,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:17,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:17,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:17,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:17,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:17,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:17,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:17,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:17,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:17,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:17,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:17,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:17,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:17,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:17,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:17,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:17,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:17,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:34:17,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:34:17,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:34:17,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,288 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:34:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2020-07-29 01:34:17,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:34:17,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:17,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:34:17,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:17,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:17,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:17,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2020-07-29 01:34:17,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:34:17,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:34:17,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 01:34:17,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:17,312 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:34:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 01:34:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:34:17,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:17,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:34:17,346 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:34:17,349 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 01:34:17,353 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:17,356 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:34:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:34:17,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:17,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:17,358 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 01:34:17,358 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 01:34:17,358 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:17,363 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:34:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:34:17,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:17,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:17,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:17,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:34:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-07-29 01:34:17,369 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:34:17,372 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:34:17,373 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:17,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:34:17,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:17,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:17,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:17,374 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:17,374 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:17,374 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 209#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 210#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 216#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 212#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 213#L556-2 [2020-07-29 01:34:17,375 INFO L796 eck$LassoCheckResult]: Loop: 213#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 218#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 213#L556-2 [2020-07-29 01:34:17,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2020-07-29 01:34:17,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:17,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936211745] [2020-07-29 01:34:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:17,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:17,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:17,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:17,500 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2020-07-29 01:34:17,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:17,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254745253] [2020-07-29 01:34:17,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:17,516 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:17,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:17,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:17,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:17,539 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2020-07-29 01:34:17,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:17,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589348560] [2020-07-29 01:34:17,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:17,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {277#true} is VALID [2020-07-29 01:34:17,820 INFO L280 TraceCheckUtils]: 1: Hoare triple {277#true} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {279#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} is VALID [2020-07-29 01:34:17,821 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {279#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} is VALID [2020-07-29 01:34:17,823 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {280#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (< |ULTIMATE.start_test_fun_#t~mem7| (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1))) (or (= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) |ULTIMATE.start_test_fun_#t~mem7|)))} is VALID [2020-07-29 01:34:17,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {280#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (< |ULTIMATE.start_test_fun_#t~mem7| (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1))) (or (= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) |ULTIMATE.start_test_fun_#t~mem7|)))} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; {281#(or (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:34:17,827 INFO L280 TraceCheckUtils]: 5: Hoare triple {281#(or (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {282#(or (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| |ULTIMATE.start_test_fun_#t~mem5|))} is VALID [2020-07-29 01:34:17,828 INFO L280 TraceCheckUtils]: 6: Hoare triple {282#(or (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| |ULTIMATE.start_test_fun_#t~mem5|))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {283#(<= (+ |ULTIMATE.start_test_fun_#t~mem8| 1) |ULTIMATE.start_test_fun_#t~mem7|)} is VALID [2020-07-29 01:34:17,830 INFO L280 TraceCheckUtils]: 7: Hoare triple {283#(<= (+ |ULTIMATE.start_test_fun_#t~mem8| 1) |ULTIMATE.start_test_fun_#t~mem7|)} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {278#false} is VALID [2020-07-29 01:34:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:17,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589348560] [2020-07-29 01:34:17,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055200170] [2020-07-29 01:34:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:34:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:17,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:34:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:17,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:17,954 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-29 01:34:17,969 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:17,973 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:17,973 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:17,974 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-07-29 01:34:18,108 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2020-07-29 01:34:18,114 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:18,121 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:18,121 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:18,122 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2020-07-29 01:34:20,583 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:20,583 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|]. (let ((.cse0 (select |v_#memory_int_48| ULTIMATE.start_test_fun_~y_ref~0.base))) (let ((.cse1 (+ (select .cse0 ULTIMATE.start_test_fun_~y_ref~0.offset) 1))) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= (store |v_#memory_int_48| ULTIMATE.start_test_fun_~y_ref~0.base (store .cse0 ULTIMATE.start_test_fun_~y_ref~0.offset .cse1)) |#memory_int|) (<= .cse1 (select (select |v_#memory_int_48| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))))) [2020-07-29 01:34:20,584 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) [2020-07-29 01:34:20,731 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2020-07-29 01:34:20,772 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:20,778 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:20,797 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:20,797 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:5 [2020-07-29 01:34:20,802 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:20,802 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~y_ref~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (.cse1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= |ULTIMATE.start_test_fun_#t~mem8| .cse0) (not (= .cse1 .cse0)) (<= .cse1 |ULTIMATE.start_test_fun_#t~mem7|) (<= .cse0 .cse1))) [2020-07-29 01:34:20,802 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ |ULTIMATE.start_test_fun_#t~mem8| 1) |ULTIMATE.start_test_fun_#t~mem7|) [2020-07-29 01:34:20,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {277#true} is VALID [2020-07-29 01:34:20,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {277#true} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {279#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} is VALID [2020-07-29 01:34:20,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {279#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} is VALID [2020-07-29 01:34:20,808 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {296#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem8|) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:34:20,810 INFO L280 TraceCheckUtils]: 4: Hoare triple {296#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem8|) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; {300#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:34:20,812 INFO L280 TraceCheckUtils]: 5: Hoare triple {300#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {304#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:34:20,815 INFO L280 TraceCheckUtils]: 6: Hoare triple {304#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {283#(<= (+ |ULTIMATE.start_test_fun_#t~mem8| 1) |ULTIMATE.start_test_fun_#t~mem7|)} is VALID [2020-07-29 01:34:20,816 INFO L280 TraceCheckUtils]: 7: Hoare triple {283#(<= (+ |ULTIMATE.start_test_fun_#t~mem8| 1) |ULTIMATE.start_test_fun_#t~mem7|)} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {278#false} is VALID [2020-07-29 01:34:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:20,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:34:20,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-29 01:34:20,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320266158] [2020-07-29 01:34:20,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:34:20,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:34:20,919 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 10 states. [2020-07-29 01:34:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:21,297 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:34:21,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:34:21,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:34:21,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:21,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-07-29 01:34:21,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:21,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 01:34:21,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:34:21,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:34:21,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-07-29 01:34:21,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:21,335 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 01:34:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-07-29 01:34:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2020-07-29 01:34:21,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:21,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand 9 states. [2020-07-29 01:34:21,337 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand 9 states. [2020-07-29 01:34:21,339 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 9 states. [2020-07-29 01:34:21,340 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:21,342 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:34:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:34:21,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:21,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:21,343 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states and 13 transitions. [2020-07-29 01:34:21,343 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states and 13 transitions. [2020-07-29 01:34:21,344 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:21,345 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:34:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:34:21,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:21,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:21,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:21,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:34:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-07-29 01:34:21,347 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:34:21,347 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:34:21,347 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:21,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:34:21,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:21,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:21,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:21,348 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:21,348 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:21,349 INFO L794 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 323#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 324#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 330#L555-1 [2020-07-29 01:34:21,349 INFO L796 eck$LassoCheckResult]: Loop: 330#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 326#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 327#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 330#L555-1 [2020-07-29 01:34:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:34:21,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:21,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853428204] [2020-07-29 01:34:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:21,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:21,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:21,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 1 times [2020-07-29 01:34:21,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:21,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229596759] [2020-07-29 01:34:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:21,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:21,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:21,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:21,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:21,395 INFO L82 PathProgramCache]: Analyzing trace with hash 889571264, now seen corresponding path program 2 times [2020-07-29 01:34:21,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:21,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590293651] [2020-07-29 01:34:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:21,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:21,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:21,429 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:21,911 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2020-07-29 01:34:22,084 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-07-29 01:34:22,089 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:22,090 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:22,090 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:22,090 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:22,090 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:22,090 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:22,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:22,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:22,091 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.10-alloca.i_Iteration3_Lasso [2020-07-29 01:34:22,091 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:22,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:22,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,553 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2020-07-29 01:34:22,676 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-07-29 01:34:22,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,703 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:23,703 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:34:23,706 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-07-29 01:34:23,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:23,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:23,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:23,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,741 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-07-29 01:34:23,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:23,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:23,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:23,750 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,776 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-07-29 01:34:23,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:23,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:23,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:23,781 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 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-07-29 01:34:23,808 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-07-29 01:34:23,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:23,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:23,816 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) [2020-07-29 01:34:23,842 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:23,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:23,851 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) [2020-07-29 01:34:23,890 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-07-29 01:34:23,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:23,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:23,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,928 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-07-29 01:34:23,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:23,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:23,935 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-07-29 01:34:23,965 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-07-29 01:34:23,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:23,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:23,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:23,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,997 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-07-29 01:34:23,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:23,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:23,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:24,001 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-07-29 01:34:24,044 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-07-29 01:34:24,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:24,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:24,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:24,048 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-07-29 01:34:24,073 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-07-29 01:34:24,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:24,082 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) [2020-07-29 01:34:24,108 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-07-29 01:34:24,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:24,122 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-07-29 01:34:24,148 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-07-29 01:34:24,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:24,171 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-07-29 01:34:24,197 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-07-29 01:34:24,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:24,226 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) [2020-07-29 01:34:24,279 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-07-29 01:34:24,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,291 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) [2020-07-29 01:34:24,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:24,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,340 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-07-29 01:34:24,366 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-07-29 01:34:24,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:24,372 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-07-29 01:34:24,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:24,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:24,411 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-07-29 01:34:24,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:24,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,446 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:34:24,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,476 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:34:24,476 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:34:24,525 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:24,582 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:34:24,582 INFO L444 ModelExtractionUtils]: 28 out of 56 variables were initially zero. Simplification set additionally 25 variables to zero. 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) [2020-07-29 01:34:24,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,601 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-07-29 01:34:24,601 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:24,602 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2020-07-29 01:34:24,808 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2020-07-29 01:34:24,813 INFO L393 LassoCheck]: Loop: "assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9;" "call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" [2020-07-29 01:34:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:24,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:24,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:24,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {391#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {391#unseeded} is VALID [2020-07-29 01:34:24,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {391#unseeded} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {391#unseeded} is VALID [2020-07-29 01:34:24,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {391#unseeded} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {391#unseeded} is VALID [2020-07-29 01:34:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:34:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:25,016 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:25,016 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2020-07-29 01:34:25,056 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:25,070 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:25,094 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:25,141 INFO L624 ElimStorePlain]: treesize reduction 45, result has 58.3 percent of original size [2020-07-29 01:34:25,142 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:34:25,142 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:63 [2020-07-29 01:34:28,734 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:28,734 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_87|]. (let ((.cse3 (select |v_#memory_int_87| ULTIMATE.start_test_fun_~y_ref~0.base))) (let ((.cse1 (select .cse3 ULTIMATE.start_test_fun_~y_ref~0.offset))) (let ((.cse0 (select (select |v_#memory_int_87| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (.cse2 (+ .cse1 1))) (and (<= .cse0 (+ .cse1 oldRank0)) (<= .cse2 .cse0) (= (store |v_#memory_int_87| ULTIMATE.start_test_fun_~y_ref~0.base (store .cse3 ULTIMATE.start_test_fun_~y_ref~0.offset .cse2)) |#memory_int|))))) [2020-07-29 01:34:28,734 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (.cse2 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (let ((.cse0 (<= (+ .cse3 1) (+ .cse2 oldRank0))) (.cse1 (<= .cse2 .cse3))) (or (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) .cse0 .cse1) (and .cse0 (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset)) .cse1)))) [2020-07-29 01:34:28,775 INFO L280 TraceCheckUtils]: 0: Hoare triple {394#(>= oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {515#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem8|) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)))} is VALID [2020-07-29 01:34:28,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {515#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem8|) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)))} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; {519#(or (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))))} is VALID [2020-07-29 01:34:28,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#(or (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {504#(or (and (> oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:34:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:28,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:28,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:28,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:28,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,793 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:34:28,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 01:34:28,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 19 states and 21 transitions. Complement of second has 7 states. [2020-07-29 01:34:28,854 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-07-29 01:34:28,854 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:28,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2020-07-29 01:34:28,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:28,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:28,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:34:28,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:28,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:28,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:28,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2020-07-29 01:34:28,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:28,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:28,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:28,857 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 11 transitions. cyclomatic complexity: 4 [2020-07-29 01:34:28,858 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:34:28,859 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:34:28,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:28,859 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:28,860 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 21 transitions. cyclomatic complexity: 5 [2020-07-29 01:34:28,860 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:34:28,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:28,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:28,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:28,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:28,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:28,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:28,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:28,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:28,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:28,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:34:28,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:34:28,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:34:28,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:28,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:28,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:28,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:28,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:28,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:28,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:34:28,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:34:28,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:34:28,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:28,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:28,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:34:28,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:28,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:28,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:28,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:28,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:28,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:28,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:28,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:28,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:28,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:34:28,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:34:28,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:34:28,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:34:28,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:34:28,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:34:28,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,876 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:34:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 01:34:28,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:28,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:34:28,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:34:28,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:28,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. cyclomatic complexity: 5 [2020-07-29 01:34:28,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:28,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 12 transitions. [2020-07-29 01:34:28,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:34:28,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:34:28,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-07-29 01:34:28,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:28,882 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:34:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-07-29 01:34:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2020-07-29 01:34:28,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:28,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 12 transitions. Second operand 9 states. [2020-07-29 01:34:28,883 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 12 transitions. Second operand 9 states. [2020-07-29 01:34:28,884 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 9 states. [2020-07-29 01:34:28,884 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:28,885 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:34:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:34:28,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:28,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:28,886 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states and 12 transitions. [2020-07-29 01:34:28,886 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states and 12 transitions. [2020-07-29 01:34:28,887 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:28,888 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:34:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:34:28,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:28,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:28,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:28,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:34:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-07-29 01:34:28,890 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:34:28,890 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:34:28,891 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:34:28,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:34:28,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:28,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:28,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:28,892 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:34:28,892 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:28,892 INFO L794 eck$LassoCheckResult]: Stem: 554#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 552#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 553#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 560#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 557#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 558#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 559#L555-1 [2020-07-29 01:34:28,893 INFO L796 eck$LassoCheckResult]: Loop: 559#L555-1 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 555#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 556#L556-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 559#L555-1 [2020-07-29 01:34:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:28,893 INFO L82 PathProgramCache]: Analyzing trace with hash 889571326, now seen corresponding path program 2 times [2020-07-29 01:34:28,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:28,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277052324] [2020-07-29 01:34:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:28,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:28,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:28,924 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:28,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:28,925 INFO L82 PathProgramCache]: Analyzing trace with hash 41795, now seen corresponding path program 2 times [2020-07-29 01:34:28,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:28,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276917079] [2020-07-29 01:34:28,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:28,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:28,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:28,937 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1271168550, now seen corresponding path program 2 times [2020-07-29 01:34:28,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:28,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797231672] [2020-07-29 01:34:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:29,048 INFO L280 TraceCheckUtils]: 0: Hoare triple {632#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {632#true} is VALID [2020-07-29 01:34:29,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {632#true} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {634#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} is VALID [2020-07-29 01:34:29,051 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {635#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:34:29,053 INFO L280 TraceCheckUtils]: 3: Hoare triple {635#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {636#(and (= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} is VALID [2020-07-29 01:34:29,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {636#(and (= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {637#(<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:34:29,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {637#(<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {637#(<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:34:29,056 INFO L280 TraceCheckUtils]: 6: Hoare triple {637#(<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {638#(<= |ULTIMATE.start_test_fun_#t~mem7| |ULTIMATE.start_test_fun_#t~mem8|)} is VALID [2020-07-29 01:34:29,057 INFO L280 TraceCheckUtils]: 7: Hoare triple {638#(<= |ULTIMATE.start_test_fun_#t~mem7| |ULTIMATE.start_test_fun_#t~mem8|)} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; {633#false} is VALID [2020-07-29 01:34:29,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {633#false} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {633#false} is VALID [2020-07-29 01:34:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:29,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797231672] [2020-07-29 01:34:29,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275849717] [2020-07-29 01:34:29,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:34:29,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:34:29,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:34:29,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 01:34:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:29,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:29,138 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-29 01:34:29,141 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:29,143 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:29,143 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:29,144 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-07-29 01:34:29,312 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2020-07-29 01:34:29,318 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:29,335 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:29,335 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:29,335 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:32 [2020-07-29 01:34:31,875 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:31,876 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_88|]. (let ((.cse2 (select |v_#memory_int_88| ULTIMATE.start_test_fun_~x_ref~0.base))) (let ((.cse1 (select (select |v_#memory_int_88| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (.cse0 (select .cse2 ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= .cse0 .cse1) (not (= .cse0 .cse1)) (= (store |v_#memory_int_88| ULTIMATE.start_test_fun_~x_ref~0.base (store .cse2 ULTIMATE.start_test_fun_~x_ref~0.offset (+ .cse0 1))) |#memory_int|)))) [2020-07-29 01:34:31,876 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= .cse0 (+ .cse1 1)) (not (= .cse1 (+ .cse0 (- 1)))))) [2020-07-29 01:34:32,025 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2020-07-29 01:34:32,072 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:32,083 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:32,091 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:32,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:5 [2020-07-29 01:34:32,094 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:32,094 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (let ((.cse1 (+ .cse0 1)) (.cse2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= .cse0 |ULTIMATE.start_test_fun_#t~mem8|) (not (= .cse1 .cse2)) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= |ULTIMATE.start_test_fun_#t~mem7| .cse2) (<= .cse2 .cse1) (not (= .cse2 .cse0))))) [2020-07-29 01:34:32,095 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ |ULTIMATE.start_test_fun_#t~mem7| 1) |ULTIMATE.start_test_fun_#t~mem8|) [2020-07-29 01:34:32,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {632#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {632#true} is VALID [2020-07-29 01:34:32,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {632#true} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {634#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} is VALID [2020-07-29 01:34:32,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#(not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {635#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:34:32,155 INFO L280 TraceCheckUtils]: 3: Hoare triple {635#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {651#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem7|) (not (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} is VALID [2020-07-29 01:34:32,157 INFO L280 TraceCheckUtils]: 4: Hoare triple {651#(and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem7|) (not (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {655#(and (not (= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1)))} is VALID [2020-07-29 01:34:32,158 INFO L280 TraceCheckUtils]: 5: Hoare triple {655#(and (not (= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1)))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {659#(and (not (= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:34:32,160 INFO L280 TraceCheckUtils]: 6: Hoare triple {659#(and (not (= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (= |ULTIMATE.start_test_fun_#t~mem5| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1)) (= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {663#(<= (+ |ULTIMATE.start_test_fun_#t~mem7| 1) |ULTIMATE.start_test_fun_#t~mem8|)} is VALID [2020-07-29 01:34:32,162 INFO L280 TraceCheckUtils]: 7: Hoare triple {663#(<= (+ |ULTIMATE.start_test_fun_#t~mem7| 1) |ULTIMATE.start_test_fun_#t~mem8|)} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; {633#false} is VALID [2020-07-29 01:34:32,162 INFO L280 TraceCheckUtils]: 8: Hoare triple {633#false} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {633#false} is VALID [2020-07-29 01:34:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:32,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:34:32,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2020-07-29 01:34:32,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603308333] [2020-07-29 01:34:32,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:32,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:34:32,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:34:32,251 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 11 states. [2020-07-29 01:34:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:32,488 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-29 01:34:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:34:32,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:34:32,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:32,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 10 transitions. [2020-07-29 01:34:32,520 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:32,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2020-07-29 01:34:32,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:34:32,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:34:32,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:34:32,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:32,521 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:32,521 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:32,521 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:32,521 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:34:32,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:34:32,521 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:32,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:32,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:34:32 BoogieIcfgContainer [2020-07-29 01:34:32,529 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:34:32,529 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:34:32,529 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:34:32,529 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:34:32,530 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:12" (3/4) ... [2020-07-29 01:34:32,534 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:34:32,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:34:32,536 INFO L168 Benchmark]: Toolchain (without parser) took 21008.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.7 MB). Free memory was 957.5 MB in the beginning and 1.0 GB in the end (delta: -52.3 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:32,536 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:32,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -109.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:32,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:32,538 INFO L168 Benchmark]: Boogie Preprocessor took 70.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:32,539 INFO L168 Benchmark]: RCFGBuilder took 531.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:32,540 INFO L168 Benchmark]: BuchiAutomizer took 19646.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.2 MB). Peak memory consumption was 195.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:32,541 INFO L168 Benchmark]: Witness Printer took 4.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:32,543 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 671.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -109.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 531.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19646.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.2 MB). Peak memory consumption was 195.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 14.2s. Construction of modules took 0.3s. Büchi inclusion checks took 4.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12 SDtfs, 16 SDslu, 19 SDs, 0 SdLazy, 109 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital262 mio100 ax106 hnf99 lsp91 ukn65 mio100 lsp33 div100 bol100 ite100 ukn100 eq197 hnf87 smp100 dnf111 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 160ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...