./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -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 0233d496bfaf5cb1311bfa260a57f41458184795 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:28:34,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:28:34,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:28:34,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:28:34,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:28:34,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:28:34,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:28:34,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:28:34,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:28:34,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:28:34,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:28:34,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:28:34,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:28:34,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:28:34,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:28:34,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:28:34,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:28:34,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:28:34,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:28:34,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:28:34,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:28:34,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:28:34,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:28:34,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:28:34,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:28:34,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:28:34,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:28:34,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:28:34,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:28:34,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:28:34,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:28:34,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:28:34,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:28:34,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:28:34,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:28:34,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:28:34,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:28:34,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:28:34,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:28:34,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:28:34,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:28:34,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:28:34,756 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:28:34,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:28:34,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:28:34,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:28:34,760 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:28:34,760 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:28:34,761 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:28:34,761 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:28:34,761 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:28:34,761 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:28:34,763 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:28:34,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:28:34,763 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:28:34,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:28:34,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:28:34,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:28:34,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:28:34,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:28:34,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:28:34,766 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:28:34,766 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:28:34,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:28:34,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:28:34,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:28:34,767 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:28:34,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:28:34,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:28:34,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:28:34,768 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:28:34,769 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:28:34,770 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 -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-11-28 20:28:35,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:28:35,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:28:35,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:28:35,140 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:28:35,142 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:28:35,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-28 20:28:35,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273a312a0/5e835e3bf87640a7803d580a0e70c114/FLAG9e6c80c9a [2019-11-28 20:28:35,664 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:28:35,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-28 20:28:35,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273a312a0/5e835e3bf87640a7803d580a0e70c114/FLAG9e6c80c9a [2019-11-28 20:28:36,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273a312a0/5e835e3bf87640a7803d580a0e70c114 [2019-11-28 20:28:36,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:28:36,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:28:36,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:28:36,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:28:36,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:28:36,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286e58b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36, skipping insertion in model container [2019-11-28 20:28:36,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:28:36,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:28:36,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:28:36,304 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:28:36,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:28:36,332 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:28:36,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36 WrapperNode [2019-11-28 20:28:36,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:28:36,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:28:36,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:28:36,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:28:36,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:28:36,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:28:36,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:28:36,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:28:36,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... [2019-11-28 20:28:36,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:28:36,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:28:36,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:28:36,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:28:36,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:36,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:28:36,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:28:36,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:28:36,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:28:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:28:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:28:36,786 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:28:36,786 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:28:36,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:36 BoogieIcfgContainer [2019-11-28 20:28:36,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:28:36,797 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:28:36,799 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:28:36,806 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:28:36,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:28:36,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:28:36" (1/3) ... [2019-11-28 20:28:36,815 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18054c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:28:36, skipping insertion in model container [2019-11-28 20:28:36,818 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:28:36,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:36" (2/3) ... [2019-11-28 20:28:36,819 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18054c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:28:36, skipping insertion in model container [2019-11-28 20:28:36,819 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:28:36,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:36" (3/3) ... [2019-11-28 20:28:36,826 INFO L371 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-11-28 20:28:36,891 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:28:36,892 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:28:36,892 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:28:36,892 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:28:36,893 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:28:36,893 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:28:36,893 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:28:36,893 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:28:36,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-28 20:28:36,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:28:36,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:36,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:36,940 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:28:36,941 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:28:36,941 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:28:36,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-28 20:28:36,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:28:36,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:36,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:36,944 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:28:36,944 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:28:36,952 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~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2019-11-28 20:28:36,953 INFO L796 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2019-11-28 20:28:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:36,959 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:28:36,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:36,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895361663] [2019-11-28 20:28:36,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:37,300 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:37,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:37,302 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-11-28 20:28:37,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:37,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086775557] [2019-11-28 20:28:37,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:37,350 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:37,354 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-11-28 20:28:37,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:37,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625264462] [2019-11-28 20:28:37,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:37,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:37,591 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-28 20:28:38,391 WARN L192 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-11-28 20:28:38,677 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-28 20:28:38,694 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:28:38,695 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:28:38,695 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:28:38,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:28:38,696 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:28:38,696 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:38,697 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:28:38,697 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:28:38,697 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2019-11-28 20:28:38,698 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:28:38,698 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:28:38,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:38,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:38,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:38,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:38,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:39,439 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-11-28 20:28:39,661 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-28 20:28:39,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:39,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:39,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:39,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:39,855 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-11-28 20:28:40,333 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:28:40,339 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 [2019-11-28 20:28:40,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:28:40,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:28:40,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:28:40,364 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 [2019-11-28 20:28:40,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:40,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:40,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:28:40,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:28:40,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,467 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 [2019-11-28 20:28:40,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:40,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:40,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:40,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:40,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,638 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) [2019-11-28 20:28:40,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:40,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:40,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:40,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:40,725 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:40,735 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) [2019-11-28 20:28:40,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,758 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) [2019-11-28 20:28:40,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 [2019-11-28 20:28:40,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,793 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) [2019-11-28 20:28:40,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:40,858 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) [2019-11-28 20:28:40,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,886 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) [2019-11-28 20:28:40,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:40,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:40,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:40,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:40,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:40,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:40,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:40,913 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:28:40,954 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 20:28:40,954 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. 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) [2019-11-28 20:28:41,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:41,016 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:28:41,016 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:28:41,017 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2019-11-28 20:28:41,179 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-11-28 20:28:41,190 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:28:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:41,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:28:41,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:28:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:41,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:28:41,268 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:28:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:28:41,308 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:28:41,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-11-28 20:28:41,377 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2019-11-28 20:28:41,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:28:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:28:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-11-28 20:28:41,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-28 20:28:41,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:28:41,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 20:28:41,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:28:41,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-28 20:28:41,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:28:41,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-11-28 20:28:41,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:28:41,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2019-11-28 20:28:41,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:28:41,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:28:41,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-28 20:28:41,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:28:41,408 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-28 20:28:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-28 20:28:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-28 20:28:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:28:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-28 20:28:41,446 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-28 20:28:41,446 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-28 20:28:41,446 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:28:41,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-28 20:28:41,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:28:41,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:41,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:41,450 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:28:41,450 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:28:41,451 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 243#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 244#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 253#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 246#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-11-28 20:28:41,451 INFO L796 eck$LassoCheckResult]: Loop: 247#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 250#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 251#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 255#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-11-28 20:28:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-11-28 20:28:41,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:41,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666820854] [2019-11-28 20:28:41,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:28:41,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666820854] [2019-11-28 20:28:41,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:41,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:28:41,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762486460] [2019-11-28 20:28:41,657 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:28:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2019-11-28 20:28:41,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:41,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844072874] [2019-11-28 20:28:41,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:41,683 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:41,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:41,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:28:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:28:41,790 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-28 20:28:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:41,883 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-28 20:28:41,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:28:41,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-28 20:28:41,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:28:41,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2019-11-28 20:28:41,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:28:41,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:28:41,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2019-11-28 20:28:41,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:28:41,887 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-28 20:28:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2019-11-28 20:28:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-28 20:28:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:28:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-28 20:28:41,891 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-28 20:28:41,891 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-28 20:28:41,891 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:28:41,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-28 20:28:41,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:28:41,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:41,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:41,893 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-28 20:28:41,893 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:28:41,893 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 288#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 289#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 296#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 293#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 294#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 297#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 300#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 301#L20 [2019-11-28 20:28:41,894 INFO L796 eck$LassoCheckResult]: Loop: 301#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 292#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 295#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 303#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 301#L20 [2019-11-28 20:28:41,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:41,894 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2019-11-28 20:28:41,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:41,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848197553] [2019-11-28 20:28:41,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:41,931 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2019-11-28 20:28:41,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:41,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472983069] [2019-11-28 20:28:41,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:41,951 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:41,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2019-11-28 20:28:41,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:41,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730214271] [2019-11-28 20:28:41,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:28:42,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730214271] [2019-11-28 20:28:42,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613425106] [2019-11-28 20:28:42,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:28:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:42,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:28:42,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:28:42,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:42,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-28 20:28:42,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:42,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:42,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:42,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-11-28 20:28:42,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:28:42,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:42,229 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:42,229 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:42,230 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-28 20:28:42,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 20:28:42,264 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:42,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:42,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:42,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-28 20:28:42,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:28:42,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 20:28:42,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:42,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:42,292 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:28:42,292 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2019-11-28 20:28:42,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:28:42,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:42,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:42,324 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:42,324 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-28 20:28:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:28:42,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:28:42,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-28 20:28:42,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330617257] [2019-11-28 20:28:42,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:42,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:28:42,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:28:42,429 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-11-28 20:28:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:42,664 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-28 20:28:42,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:28:42,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2019-11-28 20:28:42,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 20:28:42,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. [2019-11-28 20:28:42,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 20:28:42,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 20:28:42,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-11-28 20:28:42,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:28:42,668 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 20:28:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-11-28 20:28:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 13. [2019-11-28 20:28:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:28:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-28 20:28:42,679 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-28 20:28:42,679 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-28 20:28:42,679 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:28:42,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-11-28 20:28:42,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:28:42,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:42,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:42,683 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:28:42,683 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-11-28 20:28:42,683 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 383#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 384#L24-2 [2019-11-28 20:28:42,684 INFO L796 eck$LassoCheckResult]: Loop: 384#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 388#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 386#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 387#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 393#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 392#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 391#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 384#L24-2 [2019-11-28 20:28:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:42,684 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 20:28:42,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:42,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325701837] [2019-11-28 20:28:42,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:42,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:42,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2019-11-28 20:28:42,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:42,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034766896] [2019-11-28 20:28:42,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:42,782 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:42,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:42,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2019-11-28 20:28:42,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:42,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492484697] [2019-11-28 20:28:42,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:42,853 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:43,070 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-28 20:28:43,702 WARN L192 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-11-28 20:28:43,951 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-28 20:28:43,956 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:28:43,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:28:43,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:28:43,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:28:43,957 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:28:43,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:43,957 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:28:43,957 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:28:43,957 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2019-11-28 20:28:43,957 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:28:43,957 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:28:43,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:43,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:44,610 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-11-28 20:28:44,794 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-11-28 20:28:44,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:44,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:44,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:44,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:44,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:44,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:44,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:44,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:45,025 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-11-28 20:28:45,448 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:28:45,448 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:45,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:45,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:45,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:45,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:45,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:45,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:45,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:45,480 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 [2019-11-28 20:28:45,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:45,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:45,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:45,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:45,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:45,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:45,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:45,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:45,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:45,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:45,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:45,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:45,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:45,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:45,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:45,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:45,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:45,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:45,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:45,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:45,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:45,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:45,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:45,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:45,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:45,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:45,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:45,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:45,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:45,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:45,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:45,560 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:28:45,567 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:28:45,567 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:45,577 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:45,590 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:28:45,590 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:28:45,590 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2019-11-28 20:28:45,779 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-28 20:28:45,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:28:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:45,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:28:45,837 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:28:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:45,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 20:28:45,859 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:28:45,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:45,896 INFO L377 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 30 treesize of output 61 [2019-11-28 20:28:45,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:45,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:28:45,902 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:45,953 INFO L614 ElimStorePlain]: treesize reduction 32, result has 55.6 percent of original size [2019-11-28 20:28:45,954 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:45,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:40 [2019-11-28 20:28:45,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:45,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:46,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-28 20:28:46,010 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:46,034 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:46,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2019-11-28 20:28:46,036 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:46,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-11-28 20:28:46,044 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:46,078 INFO L614 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-11-28 20:28:46,079 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 20:28:46,079 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:45 [2019-11-28 20:28:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:28:46,117 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 20:28:46,117 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-11-28 20:28:46,244 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 13 states. [2019-11-28 20:28:46,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 20:28:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:28:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-28 20:28:46,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2019-11-28 20:28:46,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:28:46,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2019-11-28 20:28:46,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:28:46,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2019-11-28 20:28:46,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:28:46,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-11-28 20:28:46,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:28:46,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-11-28 20:28:46,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 20:28:46,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 20:28:46,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-11-28 20:28:46,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:28:46,249 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-28 20:28:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-11-28 20:28:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 20:28:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:28:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-28 20:28:46,253 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-28 20:28:46,253 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-28 20:28:46,253 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:28:46,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-11-28 20:28:46,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:28:46,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:46,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:46,255 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:28:46,255 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:28:46,256 INFO L794 eck$LassoCheckResult]: Stem: 656#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 650#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 651#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 662#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 663#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 675#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 674#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 673#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 665#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 660#L24 [2019-11-28 20:28:46,256 INFO L796 eck$LassoCheckResult]: Loop: 660#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 657#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 658#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 671#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 670#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 660#L24 [2019-11-28 20:28:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:46,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2019-11-28 20:28:46,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:46,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852481122] [2019-11-28 20:28:46,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:28:46,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852481122] [2019-11-28 20:28:46,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661177846] [2019-11-28 20:28:46,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:28:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:46,472 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 20:28:46,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:28:46,527 INFO L343 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2019-11-28 20:28:46,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 29 [2019-11-28 20:28:46,528 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:46,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:46,541 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:28:46,542 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:133, output treesize:38 [2019-11-28 20:28:46,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:46,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 20:28:46,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:46,666 INFO L614 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-28 20:28:46,667 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:46,667 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 [2019-11-28 20:28:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:46,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:46,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:46,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2019-11-28 20:28:46,899 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:46,907 INFO L614 ElimStorePlain]: treesize reduction 22, result has 12.0 percent of original size [2019-11-28 20:28:46,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:46,908 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-11-28 20:28:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:28:46,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:28:46,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-28 20:28:46,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318142007] [2019-11-28 20:28:46,914 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:28:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2019-11-28 20:28:46,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:46,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922343048] [2019-11-28 20:28:46,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:46,934 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:47,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:47,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:28:47,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:28:47,098 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-11-28 20:28:47,453 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-11-28 20:28:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:47,685 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-11-28 20:28:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:28:47,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2019-11-28 20:28:47,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:28:47,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-11-28 20:28:47,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 20:28:47,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 20:28:47,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-11-28 20:28:47,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:28:47,689 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-28 20:28:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-11-28 20:28:47,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-11-28 20:28:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:28:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-28 20:28:47,692 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 20:28:47,692 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 20:28:47,692 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:28:47,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-11-28 20:28:47,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:28:47,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:47,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:47,694 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-28 20:28:47,695 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:28:47,695 INFO L794 eck$LassoCheckResult]: Stem: 775#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 769#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 770#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 780#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 773#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 774#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 789#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 786#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 785#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 778#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 779#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 790#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 794#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 793#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 792#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 784#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 781#L24 [2019-11-28 20:28:47,695 INFO L796 eck$LassoCheckResult]: Loop: 781#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 776#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 777#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 783#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 788#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 781#L24 [2019-11-28 20:28:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2019-11-28 20:28:47,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:47,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753258015] [2019-11-28 20:28:47,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:47,738 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2019-11-28 20:28:47,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:47,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122109838] [2019-11-28 20:28:47,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:47,750 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:47,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:47,751 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2019-11-28 20:28:47,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:47,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373944720] [2019-11-28 20:28:47,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 20:28:47,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373944720] [2019-11-28 20:28:47,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238756418] [2019-11-28 20:28:47,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:28:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:47,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 20:28:47,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:28:47,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:47,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-28 20:28:47,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:47,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:47,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:47,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-11-28 20:28:48,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:28:48,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:48,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:48,030 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:48,031 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 20:28:48,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 20:28:48,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:48,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:48,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:48,058 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-11-28 20:28:48,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:28:48,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:48,088 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:48,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:48,089 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 20:28:48,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 20:28:48,111 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:48,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:48,122 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:28:48,123 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-11-28 20:28:48,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:28:48,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:28:48,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:48,158 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:48,158 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:48,159 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2019-11-28 20:28:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 20:28:48,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:28:48,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-11-28 20:28:48,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114082628] [2019-11-28 20:28:48,369 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-28 20:28:48,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:48,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:28:48,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:28:48,370 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 14 states. [2019-11-28 20:28:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:48,843 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-11-28 20:28:48,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 20:28:48,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 43 transitions. [2019-11-28 20:28:48,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-28 20:28:48,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 43 transitions. [2019-11-28 20:28:48,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 20:28:48,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 20:28:48,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 43 transitions. [2019-11-28 20:28:48,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:28:48,849 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-11-28 20:28:48,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 43 transitions. [2019-11-28 20:28:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-11-28 20:28:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 20:28:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-28 20:28:48,852 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-28 20:28:48,852 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-28 20:28:48,853 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:28:48,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 34 transitions. [2019-11-28 20:28:48,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-28 20:28:48,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:48,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:48,854 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-28 20:28:48,854 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-11-28 20:28:48,855 INFO L794 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 941#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 942#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 948#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 945#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 946#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 966#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 958#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 956#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 949#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 950#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 971#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 970#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 969#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 968#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 957#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 951#L24 [2019-11-28 20:28:48,855 INFO L796 eck$LassoCheckResult]: Loop: 951#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 953#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 954#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 943#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 944#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 967#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 964#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 965#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 951#L24 [2019-11-28 20:28:48,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:48,856 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2019-11-28 20:28:48,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:48,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994622090] [2019-11-28 20:28:48,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:48,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:48,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash 278966042, now seen corresponding path program 1 times [2019-11-28 20:28:48,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:48,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161227592] [2019-11-28 20:28:48,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:28:48,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161227592] [2019-11-28 20:28:48,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:48,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:28:48,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742682463] [2019-11-28 20:28:48,914 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:28:48,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:48,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:28:48,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:28:48,915 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 20:28:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:48,946 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-28 20:28:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:28:48,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2019-11-28 20:28:48,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-28 20:28:48,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2019-11-28 20:28:48,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 20:28:48,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 20:28:48,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-11-28 20:28:48,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:28:48,948 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-28 20:28:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-11-28 20:28:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-28 20:28:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 20:28:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-28 20:28:48,952 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-28 20:28:48,952 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-28 20:28:48,952 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:28:48,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2019-11-28 20:28:48,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-28 20:28:48,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:48,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:48,954 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-28 20:28:48,954 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2019-11-28 20:28:48,954 INFO L794 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1014#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1015#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1031#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1019#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1020#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1023#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1026#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1028#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1029#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1032#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1044#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1043#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1042#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1041#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1030#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1024#L24 [2019-11-28 20:28:48,955 INFO L796 eck$LassoCheckResult]: Loop: 1024#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1025#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1037#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1036#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1035#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1034#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1033#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1027#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1021#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1022#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1017#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1018#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1040#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1038#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1039#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1024#L24 [2019-11-28 20:28:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2019-11-28 20:28:48,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:48,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346551601] [2019-11-28 20:28:48,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:48,988 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2019-11-28 20:28:48,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:48,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401954130] [2019-11-28 20:28:48,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:49,012 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2019-11-28 20:28:49,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:49,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584512430] [2019-11-28 20:28:49,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:49,058 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:49,682 WARN L192 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 118 [2019-11-28 20:28:49,852 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-28 20:28:52,530 WARN L192 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 195 DAG size of output: 158 [2019-11-28 20:28:53,259 WARN L192 SmtUtils]: Spent 726.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-28 20:28:53,264 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:28:53,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:28:53,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:28:53,264 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:28:53,264 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:28:53,265 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:53,265 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:28:53,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:28:53,265 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration8_Lasso [2019-11-28 20:28:53,265 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:28:53,265 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:28:53,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:53,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:53,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:53,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:53,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:53,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:53,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:53,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:53,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:28:54,055 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-11-28 20:28:54,294 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-11-28 20:28:54,531 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-11-28 20:28:54,983 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:28:54,983 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 20:28:54,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:54,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:54,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:28:54,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:54,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:54,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:54,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:28:54,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:28:54,997 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 [2019-11-28 20:28:55,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:28:55,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:28:55,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:28:55,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:55,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:55,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:55,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:28:55,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:28:55,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:55,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:55,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:28:55,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:28:55,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:55,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:55,120 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:55,150 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:55,166 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:55,206 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:55,224 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:55,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 [2019-11-28 20:28:55,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,247 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:28:55,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,261 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:28:55,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:28:55,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:28:55,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:28:55,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:28:55,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:28:55,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:28:55,288 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:28:55,297 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 20:28:55,297 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:28:55,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:28:55,304 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:28:55,305 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:28:55,305 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2019-11-28 20:28:55,525 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2019-11-28 20:28:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:55,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:28:55,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:28:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:55,580 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 20:28:55,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:28:55,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:28:55,587 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:55,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:55,595 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:55,595 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-28 20:28:55,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:55,648 INFO L377 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 26 treesize of output 57 [2019-11-28 20:28:55,649 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:55,680 INFO L614 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2019-11-28 20:28:55,680 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:55,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-11-28 20:28:55,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:55,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 20:28:55,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:55,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 20:28:55,733 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:55,768 INFO L614 ElimStorePlain]: treesize reduction 38, result has 43.3 percent of original size [2019-11-28 20:28:55,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:55,769 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:29 [2019-11-28 20:28:55,904 INFO L343 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-28 20:28:55,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2019-11-28 20:28:55,906 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:55,954 INFO L614 ElimStorePlain]: treesize reduction 40, result has 53.5 percent of original size [2019-11-28 20:28:55,955 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:28:55,955 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:46 [2019-11-28 20:28:55,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:56,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:56,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2019-11-28 20:28:56,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:56,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:56,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 20:28:56,090 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:56,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:56,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 103 [2019-11-28 20:28:56,169 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:56,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 20:28:56,188 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:56,384 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-11-28 20:28:56,385 INFO L614 ElimStorePlain]: treesize reduction 178, result has 32.3 percent of original size [2019-11-28 20:28:56,385 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 20:28:56,385 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:175, output treesize:85 [2019-11-28 20:28:56,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:56,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:56,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:56,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 67 [2019-11-28 20:28:56,530 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:56,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:56,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 67 [2019-11-28 20:28:56,577 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:56,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:56,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 67 [2019-11-28 20:28:56,626 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:56,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:28:56,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 67 [2019-11-28 20:28:56,667 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 20:28:56,767 INFO L614 ElimStorePlain]: treesize reduction 162, result has 33.9 percent of original size [2019-11-28 20:28:56,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:56,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-28 20:28:56,769 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:83 [2019-11-28 20:28:56,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:56,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:28:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:28:56,822 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-11-28 20:28:56,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-11-28 20:28:57,311 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 46 states and 50 transitions. Complement of second has 22 states. [2019-11-28 20:28:57,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2019-11-28 20:28:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:28:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2019-11-28 20:28:57,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 15 letters. [2019-11-28 20:28:57,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:28:57,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 31 letters. Loop has 15 letters. [2019-11-28 20:28:57,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:28:57,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 30 letters. [2019-11-28 20:28:57,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:28:57,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2019-11-28 20:28:57,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:28:57,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2019-11-28 20:28:57,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-28 20:28:57,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 20:28:57,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2019-11-28 20:28:57,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:28:57,320 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-28 20:28:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2019-11-28 20:28:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-11-28 20:28:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:28:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 20:28:57,324 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 20:28:57,324 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 20:28:57,325 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:28:57,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2019-11-28 20:28:57,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:28:57,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:28:57,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:28:57,326 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:28:57,327 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-11-28 20:28:57,327 INFO L794 eck$LassoCheckResult]: Stem: 1415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1409#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1410#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1422#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1413#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1414#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1443#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1441#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1424#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1425#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1438#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1436#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1434#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1432#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1430#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1428#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1420#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1416#L24-2 [2019-11-28 20:28:57,327 INFO L796 eck$LassoCheckResult]: Loop: 1416#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1417#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1411#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1412#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1447#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1446#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1423#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1416#L24-2 [2019-11-28 20:28:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2019-11-28 20:28:57,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:57,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034321395] [2019-11-28 20:28:57,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:57,361 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2019-11-28 20:28:57,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:57,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722667973] [2019-11-28 20:28:57,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:57,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:57,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2019-11-28 20:28:57,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:57,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852540761] [2019-11-28 20:28:57,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:28:57,409 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:28:57,582 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-28 20:29:00,607 WARN L192 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 200 DAG size of output: 149 [2019-11-28 20:29:01,120 WARN L192 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-28 20:29:01,123 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:01,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:01,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:01,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:01,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:29:01,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:01,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:01,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:01,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration9_Lasso [2019-11-28 20:29:01,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:01,124 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:01,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:01,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:01,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:01,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:01,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:01,781 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-11-28 20:29:01,948 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-28 20:29:01,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:01,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:01,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:02,457 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:02,457 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:02,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:02,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:02,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:02,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:02,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:02,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:29:02,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:29:02,477 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:02,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:02,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:02,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:29:02,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:02,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:02,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:02,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:29:02,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:29:02,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:02,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:02,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:02,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:29:02,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:02,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:02,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:02,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:29:02,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:29:02,503 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:02,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:02,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:02,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:02,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:02,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:02,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:29:02,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:29:02,517 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:02,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:02,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:02,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:02,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:02,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:02,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:29:02,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:29:02,532 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:29:02,536 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:29:02,536 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:02,541 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:29:02,543 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:29:02,543 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:29:02,543 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2019-11-28 20:29:02,705 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-11-28 20:29:02,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:29:02,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:02,746 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:02,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:02,763 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 20:29:02,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:02,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:02,803 INFO L377 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 30 treesize of output 61 [2019-11-28 20:29:02,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:29:02,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:29:02,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:02,854 INFO L614 ElimStorePlain]: treesize reduction 32, result has 55.6 percent of original size [2019-11-28 20:29:02,854 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:29:02,855 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:40 [2019-11-28 20:29:02,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:29:02,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:29:02,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-28 20:29:02,906 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:02,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:02,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2019-11-28 20:29:02,927 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:02,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-11-28 20:29:02,939 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:02,978 INFO L614 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-11-28 20:29:02,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 20:29:02,979 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:45 [2019-11-28 20:29:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:03,012 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 20:29:03,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-28 20:29:03,126 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 79 states and 85 transitions. Complement of second has 13 states. [2019-11-28 20:29:03,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:29:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-11-28 20:29:03,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2019-11-28 20:29:03,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:03,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2019-11-28 20:29:03,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:03,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2019-11-28 20:29:03,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:03,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2019-11-28 20:29:03,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:29:03,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 63 transitions. [2019-11-28 20:29:03,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 20:29:03,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 20:29:03,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2019-11-28 20:29:03,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:29:03,133 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-28 20:29:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2019-11-28 20:29:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-11-28 20:29:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:29:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-28 20:29:03,137 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-28 20:29:03,137 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-28 20:29:03,137 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:29:03,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2019-11-28 20:29:03,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:29:03,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:29:03,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:29:03,139 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2019-11-28 20:29:03,139 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-11-28 20:29:03,139 INFO L794 eck$LassoCheckResult]: Stem: 1785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1783#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1784#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1790#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1815#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1814#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1813#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1812#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1811#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1810#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1797#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1786#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1787#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1806#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1804#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1802#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1793#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1791#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1792#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1788#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1789#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1835#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1834#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1828#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1827#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1826#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1825#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1824#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1823#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1822#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1801#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1794#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1795#L24-2 [2019-11-28 20:29:03,140 INFO L796 eck$LassoCheckResult]: Loop: 1795#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1809#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1808#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1807#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1805#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1803#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1798#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1795#L24-2 [2019-11-28 20:29:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2019-11-28 20:29:03,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:03,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116801686] [2019-11-28 20:29:03,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:03,321 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-11-28 20:29:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 20:29:03,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116801686] [2019-11-28 20:29:03,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712915241] [2019-11-28 20:29:03,597 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:29:03,695 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 20:29:03,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:29:03,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 20:29:03,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:03,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:29:03,731 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:03,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:03,744 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:29:03,745 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-28 20:29:03,777 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:03,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-28 20:29:03,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-28 20:29:03,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:03,790 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:29:03,790 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-11-28 20:29:03,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:29:03,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:03,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:03,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:29:03,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-28 20:29:03,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:03,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 20:29:03,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:03,952 INFO L614 ElimStorePlain]: treesize reduction 16, result has 66.7 percent of original size [2019-11-28 20:29:03,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:29:03,953 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:32 [2019-11-28 20:29:04,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 20:29:04,038 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:04,062 INFO L614 ElimStorePlain]: treesize reduction 4, result has 89.7 percent of original size [2019-11-28 20:29:04,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:29:04,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2019-11-28 20:29:04,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:04,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 63 [2019-11-28 20:29:04,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:04,173 INFO L614 ElimStorePlain]: treesize reduction 32, result has 52.2 percent of original size [2019-11-28 20:29:04,173 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:29:04,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:35 [2019-11-28 20:29:04,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:04,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2019-11-28 20:29:04,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:04,297 INFO L614 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-11-28 20:29:04,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:29:04,297 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:43 [2019-11-28 20:29:04,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-28 20:29:04,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:04,376 INFO L614 ElimStorePlain]: treesize reduction 8, result has 80.0 percent of original size [2019-11-28 20:29:04,377 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:29:04,378 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:32 [2019-11-28 20:29:04,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:29:04,445 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:29:04,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-28 20:29:04,446 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:29:04,459 INFO L614 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-28 20:29:04,459 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:29:04,460 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-11-28 20:29:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:29:04,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:29:04,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2019-11-28 20:29:04,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182381576] [2019-11-28 20:29:04,484 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:29:04,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:04,484 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2019-11-28 20:29:04,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:04,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042939869] [2019-11-28 20:29:04,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:04,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:04,628 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-28 20:29:04,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:29:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 20:29:04,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-11-28 20:29:04,670 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 8 Second operand 22 states. [2019-11-28 20:29:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:29:05,779 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-11-28 20:29:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:29:05,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 44 transitions. [2019-11-28 20:29:05,781 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:29:05,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2019-11-28 20:29:05,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:29:05,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:29:05,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:29:05,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:29:05,782 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:29:05,782 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:29:05,782 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:29:05,783 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:29:05,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:29:05,783 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:29:05,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:29:05,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:29:05 BoogieIcfgContainer [2019-11-28 20:29:05,790 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:29:05,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:29:05,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:29:05,790 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:29:05,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:36" (3/4) ... [2019-11-28 20:29:05,794 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:29:05,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:29:05,796 INFO L168 Benchmark]: Toolchain (without parser) took 29728.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 218.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:05,796 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:29:05,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.77 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:05,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:05,797 INFO L168 Benchmark]: Boogie Preprocessor took 23.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:29:05,797 INFO L168 Benchmark]: RCFGBuilder took 343.46 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:05,798 INFO L168 Benchmark]: BuchiAutomizer took 28992.83 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 308.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -74.1 MB). Peak memory consumption was 234.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:05,798 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:29:05,800 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.77 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 343.46 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28992.83 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 308.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -74.1 MB). Peak memory consumption was 234.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.9s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 23.2s. Construction of modules took 1.0s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/25 HoareTripleCheckerStatistics: 47 SDtfs, 99 SDslu, 49 SDs, 0 SdLazy, 766 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1981 mio100 ax100 hnf100 lsp98 ukn30 mio100 lsp39 div100 bol100 ite100 ukn100 eq190 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...