./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-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-8bd4bc6 [2020-07-29 01:26:34,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:26:34,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:26:34,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:26:34,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:26:34,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:26:34,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:26:34,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:26:34,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:26:34,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:26:34,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:26:34,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:26:34,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:26:34,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:26:34,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:26:34,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:26:34,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:26:34,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:26:34,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:26:34,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:26:34,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:26:34,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:26:34,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:26:34,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:26:34,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:26:34,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:26:34,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:26:34,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:26:34,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:26:34,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:26:34,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:26:34,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:26:34,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:26:34,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:26:34,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:26:34,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:26:34,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:26:34,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:26:34,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:26:34,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:26:34,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:26:34,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:26:34,821 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:26:34,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:26:34,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:26:34,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:26:34,825 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:26:34,825 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:26:34,825 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:26:34,826 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:26:34,826 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:26:34,826 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:26:34,827 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:26:34,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:26:34,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:26:34,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:26:34,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:26:34,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:26:34,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:26:34,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:26:34,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:26:34,830 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:26:34,831 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:26:34,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:26:34,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:26:34,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:26:34,832 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:26:34,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:26:34,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:26:34,833 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:26:34,833 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:26:34,835 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:26:34,835 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 [2020-07-29 01:26:35,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:26:35,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:26:35,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:26:35,255 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:26:35,256 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:26:35,257 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-07-29 01:26:35,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70708f6d3/1533006bff604d46a54065236b94ede2/FLAGa26554c96 [2020-07-29 01:26:35,731 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:26:35,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-07-29 01:26:35,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70708f6d3/1533006bff604d46a54065236b94ede2/FLAGa26554c96 [2020-07-29 01:26:36,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70708f6d3/1533006bff604d46a54065236b94ede2 [2020-07-29 01:26:36,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:26:36,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:26:36,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:26:36,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:26:36,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:26:36,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d88eed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36, skipping insertion in model container [2020-07-29 01:26:36,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:26:36,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:26:36,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:26:36,346 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:26:36,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:26:36,380 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:26:36,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36 WrapperNode [2020-07-29 01:26:36,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:26:36,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:26:36,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:26:36,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:26:36,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:26:36,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:26:36,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:26:36,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:26:36,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (1/1) ... [2020-07-29 01:26:36,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:26:36,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:26:36,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:26:36,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:26:36,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26: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 [2020-07-29 01:26:36,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:26:36,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:26:36,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:26:36,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:26:36,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:26:36,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:26:37,135 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:26:37,135 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:26:37,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:26:37 BoogieIcfgContainer [2020-07-29 01:26:37,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:26:37,140 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:26:37,140 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:26:37,144 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:26:37,145 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:26:37,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:26:36" (1/3) ... [2020-07-29 01:26:37,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1720f4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:26:37, skipping insertion in model container [2020-07-29 01:26:37,147 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:26:37,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:26:36" (2/3) ... [2020-07-29 01:26:37,148 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1720f4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:26:37, skipping insertion in model container [2020-07-29 01:26:37,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:26:37,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:26:37" (3/3) ... [2020-07-29 01:26:37,150 INFO L371 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2020-07-29 01:26:37,203 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:26:37,203 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:26:37,204 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:26:37,204 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:26:37,204 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:26:37,204 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:26:37,204 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:26:37,205 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:26:37,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:26:37,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:26:37,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:37,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:37,257 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:26:37,258 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:26:37,258 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:26:37,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:26:37,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:26:37,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:37,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:37,263 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:26:37,263 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:26:37,273 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 [2020-07-29 01:26:37,273 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 [2020-07-29 01:26:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:37,281 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:26:37,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:37,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301696190] [2020-07-29 01:26:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:37,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:37,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:37,579 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2020-07-29 01:26:37,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:37,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011315026] [2020-07-29 01:26:37,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:37,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:37,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:37,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:37,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2020-07-29 01:26:37,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:37,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886177315] [2020-07-29 01:26:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:37,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:37,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:37,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:38,708 WARN L193 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2020-07-29 01:26:39,070 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-07-29 01:26:39,088 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:26:39,089 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:26:39,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:26:39,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:26:39,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:26:39,090 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:39,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:26:39,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:26:39,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2020-07-29 01:26:39,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:26:39,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:26:39,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:39,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:39,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:39,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:39,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:39,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:39,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:39,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:39,884 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2020-07-29 01:26:40,026 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-07-29 01:26:40,969 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:26:40,975 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) [2020-07-29 01:26:40,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:40,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:40,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:26:40,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:40,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:40,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:26:41,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:26:41,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:26:41,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:26:41,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:26:41,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:26:41,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:26:41,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:26:41,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:26:41,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:26:41,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:26:41,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:26:41,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:26:41,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,356 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) [2020-07-29 01:26:41,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,435 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) [2020-07-29 01:26:41,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,502 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) [2020-07-29 01:26:41,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,566 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 [2020-07-29 01:26:41,572 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) [2020-07-29 01:26:41,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,635 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 [2020-07-29 01:26:41,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:26:41,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:41,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:41,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:41,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:41,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:41,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:41,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:41,935 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:26:41,954 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:26:41,955 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:41,971 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:26:41,977 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:26:41,979 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:26:41,980 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 [] [2020-07-29 01:26:42,277 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2020-07-29 01:26:42,281 INFO L393 LassoCheck]: Loop: "call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4);" "assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4);" "assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4);" [2020-07-29 01:26:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:42,295 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:26:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:42,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:26:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:42,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:26:42,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2020-07-29 01:26:42,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#unseeded} 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); {21#unseeded} is VALID [2020-07-29 01:26:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:42,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:26:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:42,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:26:42,419 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) 1))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {24#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) 1))} is VALID [2020-07-29 01:26:42,420 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) 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); {225#(and (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset) |ULTIMATE.start_main_#t~mem5|))} is VALID [2020-07-29 01:26:42,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#(and (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset) |ULTIMATE.start_main_#t~mem5|))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {214#(or (and (> oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:26:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:26:42,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:26:42,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:26:42,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:26:42,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,460 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:26:42,462 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2020-07-29 01:26:42,566 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2020-07-29 01:26:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:26:42,566 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:26:42,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:26:42,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:26:42,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:42,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:42,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:26:42,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:26:42,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:42,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:42,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-07-29 01:26:42,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:26:42,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:42,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:42,578 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:26:42,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:26:42,582 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:26:42,583 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:26:42,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:26:42,585 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:26:42,585 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2020-07-29 01:26:42,587 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:26:42,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:26:42,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:26:42,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:26:42,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:26:42,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:26:42,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:26:42,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:26:42,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:26:42,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:26:42,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:26:42,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:26:42,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:26:42,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:26:42,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:26:42,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:26:42,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:26:42,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:26:42,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:26:42,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:26:42,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:26:42,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:26:42,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:26:42,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:26:42,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:26:42,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:26:42,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:26:42,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:26:42,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:26:42,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:26:42,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:26:42,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:26:42,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:26:42,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:26:42,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:26:42,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:26:42,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:26:42,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:26:42,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:26:42,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:26:42,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:26:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:26:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:26:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:26:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:26:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:26:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:26:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:26:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:26:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:26:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:26:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:26:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:26:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:26:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:26:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,613 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:26:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:26:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-29 01:26:42,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:26:42,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:26:42,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:26:42,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:26:42,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2020-07-29 01:26:42,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:26:42,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2020-07-29 01:26:42,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:26:42,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:26:42,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-07-29 01:26:42,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:26:42,631 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:26:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-07-29 01:26:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:26:42,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:26:42,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand 13 states. [2020-07-29 01:26:42,663 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand 13 states. [2020-07-29 01:26:42,665 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 13 states. [2020-07-29 01:26:42,669 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:26:42,672 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-07-29 01:26:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:26:42,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:42,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:42,675 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 18 transitions. [2020-07-29 01:26:42,675 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 18 transitions. [2020-07-29 01:26:42,675 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:26:42,677 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-07-29 01:26:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:26:42,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:42,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:42,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:26:42,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:26:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:26:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-07-29 01:26:42,682 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:26:42,682 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:26:42,683 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:26:42,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:26:42,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:26:42,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:42,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:42,685 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:26:42,685 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:26:42,686 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 269#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); 270#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 279#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); 272#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); 273#L20 [2020-07-29 01:26:42,686 INFO L796 eck$LassoCheckResult]: Loop: 273#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 276#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 277#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); 281#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); 273#L20 [2020-07-29 01:26:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:42,686 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2020-07-29 01:26:42,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:42,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994770670] [2020-07-29 01:26:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:42,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {343#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {343#true} is VALID [2020-07-29 01:26:42,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {343#true} 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); {345#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} is VALID [2020-07-29 01:26:42,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {345#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {345#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} is VALID [2020-07-29 01:26:42,904 INFO L280 TraceCheckUtils]: 3: Hoare triple {345#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {346#(= 0 |ULTIMATE.start_main_#t~mem5|)} is VALID [2020-07-29 01:26:42,905 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#(= 0 |ULTIMATE.start_main_#t~mem5|)} 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); {344#false} is VALID [2020-07-29 01:26:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:26:42,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994770670] [2020-07-29 01:26:42,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:26:42,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:26:42,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408626027] [2020-07-29 01:26:42,912 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:26:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:42,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2020-07-29 01:26:42,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:42,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080679156] [2020-07-29 01:26:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:42,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:42,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:42,930 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:43,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:26:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:26:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:26:43,062 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:26:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:26:43,194 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-07-29 01:26:43,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:26:43,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:26:43,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:26:43,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2020-07-29 01:26:43,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:26:43,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2020-07-29 01:26:43,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:26:43,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:26:43,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-07-29 01:26:43,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:26:43,213 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 01:26:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-07-29 01:26:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-07-29 01:26:43,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:26:43,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second operand 13 states. [2020-07-29 01:26:43,215 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second operand 13 states. [2020-07-29 01:26:43,215 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 13 states. [2020-07-29 01:26:43,216 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:26:43,217 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 01:26:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:26:43,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:43,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:43,218 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 15 states and 19 transitions. [2020-07-29 01:26:43,219 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 15 states and 19 transitions. [2020-07-29 01:26:43,219 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:26:43,221 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 01:26:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:26:43,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:43,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:43,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:26:43,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:26:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:26:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-29 01:26:43,224 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:26:43,224 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:26:43,224 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:26:43,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:26:43,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:26:43,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:43,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:43,225 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 01:26:43,226 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:26:43,226 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 368#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); 369#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 375#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); 372#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 373#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 376#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); 370#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); 371#L20 [2020-07-29 01:26:43,226 INFO L796 eck$LassoCheckResult]: Loop: 371#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 378#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 379#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); 380#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); 371#L20 [2020-07-29 01:26:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2020-07-29 01:26:43,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:43,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917025764] [2020-07-29 01:26:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:43,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:43,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:43,277 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2020-07-29 01:26:43,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:43,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31897666] [2020-07-29 01:26:43,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:43,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:43,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:43,301 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:43,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2020-07-29 01:26:43,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:43,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532481249] [2020-07-29 01:26:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:43,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {460#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {460#true} is VALID [2020-07-29 01:26:43,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {460#true} 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); {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:43,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:43,498 INFO L280 TraceCheckUtils]: 3: Hoare triple {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:43,499 INFO L280 TraceCheckUtils]: 4: Hoare triple {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {463#(or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:43,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {463#(or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {463#(or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:43,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {463#(or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {464#(or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 |ULTIMATE.start_main_#t~mem5|))} is VALID [2020-07-29 01:26:43,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {464#(or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 |ULTIMATE.start_main_#t~mem5|))} 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); {465#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:43,506 INFO L280 TraceCheckUtils]: 8: Hoare triple {465#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {466#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} is VALID [2020-07-29 01:26:43,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {466#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {466#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} is VALID [2020-07-29 01:26:43,508 INFO L280 TraceCheckUtils]: 10: Hoare triple {466#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {467#(= 0 |ULTIMATE.start_main_#t~mem5|)} is VALID [2020-07-29 01:26:43,510 INFO L280 TraceCheckUtils]: 11: Hoare triple {467#(= 0 |ULTIMATE.start_main_#t~mem5|)} 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); {461#false} is VALID [2020-07-29 01:26:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:26:43,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532481249] [2020-07-29 01:26:43,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180460225] [2020-07-29 01:26:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:26:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:43,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:26:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:43,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:26:43,705 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-29 01:26:43,707 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:43,712 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:43,712 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:43,712 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-07-29 01:26:43,715 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:43,715 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_83|]. (= 0 (select (store |v_#valid_83| ULTIMATE.start_main_~x0~0.base 1) ULTIMATE.start_main_~x1~0.base)) [2020-07-29 01:26:43,716 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) [2020-07-29 01:26:43,752 INFO L384 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 [2020-07-29 01:26:43,753 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:43,758 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:43,759 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:43,759 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-07-29 01:26:43,805 INFO L384 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 [2020-07-29 01:26:43,806 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:43,814 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:43,823 INFO L544 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. [2020-07-29 01:26:43,824 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-07-29 01:26:43,829 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:43,829 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_74|, ULTIMATE.start_main_~x1~0.base, ULTIMATE.start_main_~x1~0.offset]. (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |v_#memory_int_74| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (= |#memory_int| (store |v_#memory_int_74| ULTIMATE.start_main_~x1~0.base (store (select |v_#memory_int_74| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset 1)))) [2020-07-29 01:26:43,829 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~x1~0.base, ULTIMATE.start_main_~x1~0.offset]. (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) [2020-07-29 01:26:43,980 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-29 01:26:43,981 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:43,989 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:44,002 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:44,002 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-29 01:26:44,006 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:44,007 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_main_~x0~0.base, ULTIMATE.start_main_~x0~0.offset, ULTIMATE.start_main_~x1~0.base, ULTIMATE.start_main_~x1~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 .cse0) (= .cse0 |ULTIMATE.start_main_#t~mem5|))) [2020-07-29 01:26:44,007 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |ULTIMATE.start_main_#t~mem5|) [2020-07-29 01:26:44,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {460#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {460#true} is VALID [2020-07-29 01:26:44,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {460#true} 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); {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:44,014 INFO L280 TraceCheckUtils]: 2: Hoare triple {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:44,016 INFO L280 TraceCheckUtils]: 3: Hoare triple {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:44,017 INFO L280 TraceCheckUtils]: 4: Hoare triple {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:44,018 INFO L280 TraceCheckUtils]: 5: Hoare triple {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:44,018 INFO L280 TraceCheckUtils]: 6: Hoare triple {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:44,020 INFO L280 TraceCheckUtils]: 7: Hoare triple {462#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} 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); {465#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:44,022 INFO L280 TraceCheckUtils]: 8: Hoare triple {465#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {495#(and (exists ((ULTIMATE.start_main_~x1~0.offset Int) (ULTIMATE.start_main_~x1~0.base Int)) (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:44,024 INFO L280 TraceCheckUtils]: 9: Hoare triple {495#(and (exists ((ULTIMATE.start_main_~x1~0.offset Int) (ULTIMATE.start_main_~x1~0.base Int)) (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {495#(and (exists ((ULTIMATE.start_main_~x1~0.offset Int) (ULTIMATE.start_main_~x1~0.base Int)) (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:44,025 INFO L280 TraceCheckUtils]: 10: Hoare triple {495#(and (exists ((ULTIMATE.start_main_~x1~0.offset Int) (ULTIMATE.start_main_~x1~0.base Int)) (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {467#(= 0 |ULTIMATE.start_main_#t~mem5|)} is VALID [2020-07-29 01:26:44,026 INFO L280 TraceCheckUtils]: 11: Hoare triple {467#(= 0 |ULTIMATE.start_main_#t~mem5|)} 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); {461#false} is VALID [2020-07-29 01:26:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:26:44,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:26:44,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-07-29 01:26:44,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922204811] [2020-07-29 01:26:44,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:26:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:26:44,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:26:44,143 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 9 states. [2020-07-29 01:26:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:26:44,434 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-29 01:26:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:26:44,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:26:44,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:26:44,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2020-07-29 01:26:44,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:26:44,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2020-07-29 01:26:44,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:26:44,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:26:44,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2020-07-29 01:26:44,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:26:44,472 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-07-29 01:26:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2020-07-29 01:26:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-07-29 01:26:44,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:26:44,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 22 transitions. Second operand 16 states. [2020-07-29 01:26:44,473 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 22 transitions. Second operand 16 states. [2020-07-29 01:26:44,474 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 16 states. [2020-07-29 01:26:44,474 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:26:44,475 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-29 01:26:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-07-29 01:26:44,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:44,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:44,476 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 18 states and 22 transitions. [2020-07-29 01:26:44,476 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 18 states and 22 transitions. [2020-07-29 01:26:44,477 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:26:44,479 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-29 01:26:44,479 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-07-29 01:26:44,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:44,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:44,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:26:44,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:26:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:26:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-07-29 01:26:44,481 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:26:44,481 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:26:44,481 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:26:44,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:26:44,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:26:44,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:44,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:44,482 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 01:26:44,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:26:44,483 INFO L794 eck$LassoCheckResult]: Stem: 532#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 526#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); 527#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 534#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); 530#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 531#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 535#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); 537#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); 538#L20 [2020-07-29 01:26:44,483 INFO L796 eck$LassoCheckResult]: Loop: 538#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); 536#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 529#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 533#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); 541#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); 538#L20 [2020-07-29 01:26:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 2 times [2020-07-29 01:26:44,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:44,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355509291] [2020-07-29 01:26:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:44,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:44,538 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:44,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash 49698504, now seen corresponding path program 1 times [2020-07-29 01:26:44,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:44,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865912035] [2020-07-29 01:26:44,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:44,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:44,572 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:44,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1758681084, now seen corresponding path program 1 times [2020-07-29 01:26:44,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:44,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340223356] [2020-07-29 01:26:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:44,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {633#true} is VALID [2020-07-29 01:26:44,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {633#true} 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); {635#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:26:44,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {635#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {635#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:26:44,752 INFO L280 TraceCheckUtils]: 3: Hoare triple {635#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {635#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:26:44,753 INFO L280 TraceCheckUtils]: 4: Hoare triple {635#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {636#(or (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:44,754 INFO L280 TraceCheckUtils]: 5: Hoare triple {636#(or (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {636#(or (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:44,755 INFO L280 TraceCheckUtils]: 6: Hoare triple {636#(or (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {637#(or (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (= 0 |ULTIMATE.start_main_#t~mem5|))} is VALID [2020-07-29 01:26:44,757 INFO L280 TraceCheckUtils]: 7: Hoare triple {637#(or (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (= 0 |ULTIMATE.start_main_#t~mem5|))} 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); {638#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:26:44,758 INFO L280 TraceCheckUtils]: 8: Hoare triple {638#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} 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); {639#(and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:26:44,760 INFO L280 TraceCheckUtils]: 9: Hoare triple {639#(and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); {640#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} is VALID [2020-07-29 01:26:44,761 INFO L280 TraceCheckUtils]: 10: Hoare triple {640#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {640#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} is VALID [2020-07-29 01:26:44,762 INFO L280 TraceCheckUtils]: 11: Hoare triple {640#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {641#(= 0 |ULTIMATE.start_main_#t~mem5|)} is VALID [2020-07-29 01:26:44,762 INFO L280 TraceCheckUtils]: 12: Hoare triple {641#(= 0 |ULTIMATE.start_main_#t~mem5|)} 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); {634#false} is VALID [2020-07-29 01:26:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:26:44,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340223356] [2020-07-29 01:26:44,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297552336] [2020-07-29 01:26:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:26:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:44,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-29 01:26:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:44,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:26:44,865 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:44,865 INFO L384 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 [2020-07-29 01:26:44,880 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:44,886 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:44,902 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:44,951 INFO L350 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2020-07-29 01:26:44,952 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2020-07-29 01:26:44,952 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:44,966 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:44,984 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-29 01:26:44,984 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:143, output treesize:41 [2020-07-29 01:26:44,998 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:44,998 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_78|, |ULTIMATE.start_main_#t~malloc2.base|, ULTIMATE.start_main_~x2~0.offset, |ULTIMATE.start_main_#t~malloc3.base|, ULTIMATE.start_main_~x3~0.offset, |v_#valid_85|]. (let ((.cse3 (store |v_#valid_85| ULTIMATE.start_main_~x0~0.base 1))) (and (= |#memory_int| (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |v_#memory_int_78| ULTIMATE.start_main_~x0~0.base (store (select |v_#memory_int_78| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 0)))) (store .cse2 ULTIMATE.start_main_~x1~0.base (store (select .cse2 ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset 0))))) (store .cse1 |ULTIMATE.start_main_#t~malloc2.base| (store (select .cse1 |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset 0))))) (store .cse0 |ULTIMATE.start_main_#t~malloc3.base| (store (select .cse0 |ULTIMATE.start_main_#t~malloc3.base|) ULTIMATE.start_main_~x3~0.offset 0)))) (= 0 (select .cse3 ULTIMATE.start_main_~x1~0.base)) (<= (select (store .cse3 ULTIMATE.start_main_~x1~0.base 1) |ULTIMATE.start_main_#t~malloc2.base|) 0))) [2020-07-29 01:26:44,998 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|ULTIMATE.start_main_#t~malloc2.base|, |ULTIMATE.start_main_#t~malloc3.base|, ULTIMATE.start_main_~x3~0.offset, ULTIMATE.start_main_~x2~0.offset]. (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc3.base|) ULTIMATE.start_main_~x3~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset))) [2020-07-29 01:26:45,293 INFO L384 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 [2020-07-29 01:26:45,295 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:45,308 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:45,329 INFO L544 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. [2020-07-29 01:26:45,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2020-07-29 01:26:45,335 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:45,336 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_79|, |ULTIMATE.start_main_#t~malloc2.base|, ULTIMATE.start_main_~x2~0.offset]. (let ((.cse0 (select |v_#memory_int_79| ULTIMATE.start_main_~x0~0.base))) (and (= 0 (select (select |v_#memory_int_79| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)) (= (store |v_#memory_int_79| ULTIMATE.start_main_~x0~0.base (store .cse0 ULTIMATE.start_main_~x0~0.offset 1)) |#memory_int|) (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (= 0 (select .cse0 ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |v_#memory_int_79| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))) [2020-07-29 01:26:45,336 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|ULTIMATE.start_main_#t~malloc2.base|, ULTIMATE.start_main_~x2~0.offset]. (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset))) [2020-07-29 01:26:45,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:26:45,808 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2020-07-29 01:26:45,810 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:45,817 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:45,839 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:45,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-07-29 01:26:45,842 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:45,842 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_80|, ULTIMATE.start_main_~x0~0.base, ULTIMATE.start_main_~x0~0.offset, ULTIMATE.start_main_~x1~0.base, ULTIMATE.start_main_~x1~0.offset, |ULTIMATE.start_main_#t~malloc2.base|, ULTIMATE.start_main_~x2~0.offset]. (let ((.cse0 (select |v_#memory_int_80| ULTIMATE.start_main_~x0~0.base))) (and (= 0 (select (select |v_#memory_int_80| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (= (select (select (store |v_#memory_int_80| ULTIMATE.start_main_~x0~0.base (store .cse0 ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset) |ULTIMATE.start_main_#t~mem6|) (= 0 (select (select |v_#memory_int_80| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 1 (select .cse0 ULTIMATE.start_main_~x0~0.offset)))) [2020-07-29 01:26:45,842 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |ULTIMATE.start_main_#t~mem6|) [2020-07-29 01:26:45,855 INFO L280 TraceCheckUtils]: 0: Hoare triple {633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {633#true} is VALID [2020-07-29 01:26:45,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {633#true} 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); {648#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:45,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {648#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {648#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:45,861 INFO L280 TraceCheckUtils]: 3: Hoare triple {648#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {648#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:45,864 INFO L280 TraceCheckUtils]: 4: Hoare triple {648#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {658#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:45,865 INFO L280 TraceCheckUtils]: 5: Hoare triple {658#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {658#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:45,867 INFO L280 TraceCheckUtils]: 6: Hoare triple {658#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {658#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:45,868 INFO L280 TraceCheckUtils]: 7: Hoare triple {658#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((|ULTIMATE.start_main_#t~malloc2.base| Int) (ULTIMATE.start_main_~x2~0.offset Int)) (and (not (= |ULTIMATE.start_main_#t~malloc2.base| ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x0~0.base |ULTIMATE.start_main_#t~malloc2.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~malloc2.base|) ULTIMATE.start_main_~x2~0.offset)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} 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); {668#(= 0 |ULTIMATE.start_main_#t~mem6|)} is VALID [2020-07-29 01:26:45,869 INFO L280 TraceCheckUtils]: 8: Hoare triple {668#(= 0 |ULTIMATE.start_main_#t~mem6|)} 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); {634#false} is VALID [2020-07-29 01:26:45,869 INFO L280 TraceCheckUtils]: 9: Hoare triple {634#false} assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); {634#false} is VALID [2020-07-29 01:26:45,869 INFO L280 TraceCheckUtils]: 10: Hoare triple {634#false} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {634#false} is VALID [2020-07-29 01:26:45,869 INFO L280 TraceCheckUtils]: 11: Hoare triple {634#false} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {634#false} is VALID [2020-07-29 01:26:45,870 INFO L280 TraceCheckUtils]: 12: Hoare triple {634#false} 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); {634#false} is VALID [2020-07-29 01:26:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:26:45,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:26:45,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2020-07-29 01:26:45,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300207670] [2020-07-29 01:26:46,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:26:46,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:26:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:26:46,065 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 12 states. [2020-07-29 01:26:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:26:46,545 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-29 01:26:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:26:46,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:26:46,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:26:46,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2020-07-29 01:26:46,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:26:46,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2020-07-29 01:26:46,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:26:46,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:26:46,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2020-07-29 01:26:46,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:26:46,607 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-29 01:26:46,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2020-07-29 01:26:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2020-07-29 01:26:46,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:26:46,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 26 transitions. Second operand 17 states. [2020-07-29 01:26:46,609 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 26 transitions. Second operand 17 states. [2020-07-29 01:26:46,609 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 17 states. [2020-07-29 01:26:46,610 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:26:46,611 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-29 01:26:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-29 01:26:46,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:46,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:46,612 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 22 states and 26 transitions. [2020-07-29 01:26:46,612 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 22 states and 26 transitions. [2020-07-29 01:26:46,613 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:26:46,615 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-29 01:26:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-29 01:26:46,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:46,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:46,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:26:46,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:26:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:26:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-07-29 01:26:46,617 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-29 01:26:46,617 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-29 01:26:46,618 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:26:46,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2020-07-29 01:26:46,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:26:46,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:46,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:46,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-07-29 01:26:46,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-07-29 01:26:46,619 INFO L794 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 713#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); 714#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 720#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); 717#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 718#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 721#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); 728#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); 725#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 723#L24-2 [2020-07-29 01:26:46,620 INFO L796 eck$LassoCheckResult]: Loop: 723#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 724#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); 715#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 716#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 729#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); 727#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); 726#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 723#L24-2 [2020-07-29 01:26:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2020-07-29 01:26:46,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:46,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047285370] [2020-07-29 01:26:46,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:46,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:46,653 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:46,657 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2020-07-29 01:26:46,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:46,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635753627] [2020-07-29 01:26:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:46,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:46,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:46,672 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash -697316797, now seen corresponding path program 3 times [2020-07-29 01:26:46,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:46,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963381658] [2020-07-29 01:26:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:46,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {834#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {834#true} is VALID [2020-07-29 01:26:46,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {834#true} 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); {836#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:46,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {836#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {836#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:46,827 INFO L280 TraceCheckUtils]: 3: Hoare triple {836#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {836#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:46,828 INFO L280 TraceCheckUtils]: 4: Hoare triple {836#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {837#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:46,830 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {837#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:46,831 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {838#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 |ULTIMATE.start_main_#t~mem5|))} is VALID [2020-07-29 01:26:46,832 INFO L280 TraceCheckUtils]: 7: Hoare triple {838#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 |ULTIMATE.start_main_#t~mem5|))} 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); {836#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} is VALID [2020-07-29 01:26:46,834 INFO L280 TraceCheckUtils]: 8: Hoare triple {836#(not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base))} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} is VALID [2020-07-29 01:26:46,835 INFO L280 TraceCheckUtils]: 9: Hoare triple {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} is VALID [2020-07-29 01:26:46,836 INFO L280 TraceCheckUtils]: 10: Hoare triple {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} is VALID [2020-07-29 01:26:46,839 INFO L280 TraceCheckUtils]: 11: Hoare triple {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} is VALID [2020-07-29 01:26:46,840 INFO L280 TraceCheckUtils]: 12: Hoare triple {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} is VALID [2020-07-29 01:26:46,842 INFO L280 TraceCheckUtils]: 13: Hoare triple {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} is VALID [2020-07-29 01:26:46,844 INFO L280 TraceCheckUtils]: 14: Hoare triple {839#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))))} 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); {840#(not (= 0 |ULTIMATE.start_main_#t~mem6|))} is VALID [2020-07-29 01:26:46,845 INFO L280 TraceCheckUtils]: 15: Hoare triple {840#(not (= 0 |ULTIMATE.start_main_#t~mem6|))} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {835#false} is VALID [2020-07-29 01:26:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:26:46,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963381658] [2020-07-29 01:26:46,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186794952] [2020-07-29 01:26:46,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:26:46,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 01:26:46,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:26:46,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 01:26:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:46,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:26:47,154 INFO L384 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 [2020-07-29 01:26:47,155 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:47,166 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:47,166 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:47,166 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-07-29 01:26:47,301 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-29 01:26:47,320 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:47,321 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2020-07-29 01:26:47,332 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:47,337 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:47,373 INFO L624 ElimStorePlain]: treesize reduction 16, result has 66.0 percent of original size [2020-07-29 01:26:47,373 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:47,374 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2020-07-29 01:26:47,379 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:47,380 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_86|]. (let ((.cse0 (select |v_#memory_int_86| ULTIMATE.start_main_~x0~0.base))) (and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= (select .cse0 ULTIMATE.start_main_~x0~0.offset) 0) (= (select (select |v_#memory_int_86| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset) 1) (<= 0 ULTIMATE.start_main_~x1~0.offset) (= |#memory_int| (store |v_#memory_int_86| ULTIMATE.start_main_~x0~0.base (store .cse0 ULTIMATE.start_main_~x0~0.offset 1))) (<= ULTIMATE.start_main_~x1~0.offset 0))) [2020-07-29 01:26:47,380 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~x0~0.offset 0) (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) [2020-07-29 01:26:47,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:26:47,596 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-29 01:26:47,598 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:47,608 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:47,630 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:47,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:3 [2020-07-29 01:26:47,634 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:47,635 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_87|, ULTIMATE.start_main_~x0~0.base, ULTIMATE.start_main_~x0~0.offset, ULTIMATE.start_main_~x1~0.base, ULTIMATE.start_main_~x1~0.offset]. (let ((.cse0 (select |v_#memory_int_87| ULTIMATE.start_main_~x0~0.base))) (and (= 1 (select (select |v_#memory_int_87| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (<= ULTIMATE.start_main_~x0~0.offset 0) (<= (select (select (store |v_#memory_int_87| ULTIMATE.start_main_~x0~0.base (store .cse0 ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset) |ULTIMATE.start_main_#t~mem6|) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select .cse0 ULTIMATE.start_main_~x0~0.offset)))) [2020-07-29 01:26:47,635 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 1 |ULTIMATE.start_main_#t~mem6|) [2020-07-29 01:26:47,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {834#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {834#true} is VALID [2020-07-29 01:26:47,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {834#true} 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); {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} is VALID [2020-07-29 01:26:47,650 INFO L280 TraceCheckUtils]: 2: Hoare triple {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} is VALID [2020-07-29 01:26:47,651 INFO L280 TraceCheckUtils]: 3: Hoare triple {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} is VALID [2020-07-29 01:26:47,652 INFO L280 TraceCheckUtils]: 4: Hoare triple {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} is VALID [2020-07-29 01:26:47,653 INFO L280 TraceCheckUtils]: 5: Hoare triple {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} is VALID [2020-07-29 01:26:47,654 INFO L280 TraceCheckUtils]: 6: Hoare triple {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} is VALID [2020-07-29 01:26:47,655 INFO L280 TraceCheckUtils]: 7: Hoare triple {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} 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); {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} is VALID [2020-07-29 01:26:47,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {847#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {869#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} is VALID [2020-07-29 01:26:47,665 INFO L280 TraceCheckUtils]: 9: Hoare triple {869#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {869#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} is VALID [2020-07-29 01:26:47,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {869#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {876#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (<= (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset) |ULTIMATE.start_main_#t~mem5|))} is VALID [2020-07-29 01:26:47,668 INFO L280 TraceCheckUtils]: 11: Hoare triple {876#(and (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (<= (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset) |ULTIMATE.start_main_#t~mem5|))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {880#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:47,669 INFO L280 TraceCheckUtils]: 12: Hoare triple {880#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {880#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:47,671 INFO L280 TraceCheckUtils]: 13: Hoare triple {880#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {880#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:26:47,672 INFO L280 TraceCheckUtils]: 14: Hoare triple {880#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (<= ULTIMATE.start_main_~x0~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (<= 0 ULTIMATE.start_main_~x0~0.offset) (<= 0 ULTIMATE.start_main_~x1~0.offset) (<= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} 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); {890#(<= 1 |ULTIMATE.start_main_#t~mem6|)} is VALID [2020-07-29 01:26:47,673 INFO L280 TraceCheckUtils]: 15: Hoare triple {890#(<= 1 |ULTIMATE.start_main_#t~mem6|)} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {835#false} is VALID [2020-07-29 01:26:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:26:47,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:26:47,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-07-29 01:26:47,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402779832] [2020-07-29 01:26:47,831 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2020-07-29 01:26:47,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:26:47,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:26:47,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:26:47,884 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 12 states. [2020-07-29 01:26:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:26:48,509 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-29 01:26:48,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:26:48,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:26:48,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:26:48,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2020-07-29 01:26:48,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-07-29 01:26:48,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 30 transitions. [2020-07-29 01:26:48,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 01:26:48,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-29 01:26:48,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2020-07-29 01:26:48,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:26:48,564 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-29 01:26:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2020-07-29 01:26:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-29 01:26:48,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:26:48,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 30 transitions. Second operand 27 states. [2020-07-29 01:26:48,567 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 30 transitions. Second operand 27 states. [2020-07-29 01:26:48,567 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 27 states. [2020-07-29 01:26:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:26:48,568 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-29 01:26:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-29 01:26:48,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:48,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:48,569 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states and 30 transitions. [2020-07-29 01:26:48,569 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states and 30 transitions. [2020-07-29 01:26:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:26:48,570 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-29 01:26:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-29 01:26:48,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:48,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:48,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:26:48,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:26:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:26:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-07-29 01:26:48,572 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-29 01:26:48,572 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-29 01:26:48,572 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:26:48,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2020-07-29 01:26:48,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-07-29 01:26:48,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:48,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:48,574 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-07-29 01:26:48,574 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1, 1, 1] [2020-07-29 01:26:48,574 INFO L794 eck$LassoCheckResult]: Stem: 938#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 934#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); 935#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 952#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); 951#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 950#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 949#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); 948#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); 945#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 946#L24-2 [2020-07-29 01:26:48,574 INFO L796 eck$LassoCheckResult]: Loop: 946#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 943#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); 944#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 959#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 958#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); 957#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); 947#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); 941#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); 939#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 940#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); 955#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); 954#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 946#L24-2 [2020-07-29 01:26:48,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 4 times [2020-07-29 01:26:48,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:48,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359974093] [2020-07-29 01:26:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:48,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:48,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:48,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:48,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash 103159504, now seen corresponding path program 1 times [2020-07-29 01:26:48,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:48,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599435866] [2020-07-29 01:26:48,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:48,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {1020#true} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1020#true} is VALID [2020-07-29 01:26:48,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {1020#true} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1020#true} is VALID [2020-07-29 01:26:48,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {1020#true} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1022#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} is VALID [2020-07-29 01:26:48,686 INFO L280 TraceCheckUtils]: 3: Hoare triple {1022#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1022#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} is VALID [2020-07-29 01:26:48,687 INFO L280 TraceCheckUtils]: 4: Hoare triple {1022#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1023#(= 1 |ULTIMATE.start_main_#t~mem5|)} is VALID [2020-07-29 01:26:48,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {1023#(= 1 |ULTIMATE.start_main_#t~mem5|)} 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); {1020#true} is VALID [2020-07-29 01:26:48,688 INFO L280 TraceCheckUtils]: 6: Hoare triple {1020#true} 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); {1020#true} is VALID [2020-07-29 01:26:48,689 INFO L280 TraceCheckUtils]: 7: Hoare triple {1020#true} 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); {1024#(not (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x3~0.base) ULTIMATE.start_main_~x3~0.offset)))} is VALID [2020-07-29 01:26:48,690 INFO L280 TraceCheckUtils]: 8: Hoare triple {1024#(not (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x3~0.base) ULTIMATE.start_main_~x3~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1025#(not (= 0 |ULTIMATE.start_main_#t~mem4|))} is VALID [2020-07-29 01:26:48,690 INFO L280 TraceCheckUtils]: 9: Hoare triple {1025#(not (= 0 |ULTIMATE.start_main_#t~mem4|))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1021#false} is VALID [2020-07-29 01:26:48,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {1021#false} 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); {1021#false} is VALID [2020-07-29 01:26:48,691 INFO L280 TraceCheckUtils]: 11: Hoare triple {1021#false} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {1021#false} is VALID [2020-07-29 01:26:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:26:48,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599435866] [2020-07-29 01:26:48,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073999433] [2020-07-29 01:26:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:26:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:48,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:26:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:48,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:26:48,768 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:48,768 INFO L384 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 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-29 01:26:48,769 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:48,788 INFO L624 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-07-29 01:26:48,791 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:48,791 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2020-07-29 01:26:48,795 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:48,795 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_92|, ULTIMATE.start_main_~x2~0.base, ULTIMATE.start_main_~x2~0.offset]. (= |#memory_int| (let ((.cse0 (store |v_#memory_int_92| ULTIMATE.start_main_~x2~0.base (store (select |v_#memory_int_92| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset 0)))) (store .cse0 ULTIMATE.start_main_~x3~0.base (store (select .cse0 ULTIMATE.start_main_~x3~0.base) ULTIMATE.start_main_~x3~0.offset 1)))) [2020-07-29 01:26:48,795 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x3~0.base) ULTIMATE.start_main_~x3~0.offset)) [2020-07-29 01:26:48,815 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:26:48,816 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:48,818 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:48,818 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:48,819 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-29 01:26:48,821 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:48,821 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_main_~x3~0.base, ULTIMATE.start_main_~x3~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~x3~0.base) ULTIMATE.start_main_~x3~0.offset))) (and (= 1 .cse0) (<= .cse0 |ULTIMATE.start_main_#t~mem4|))) [2020-07-29 01:26:48,821 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 1 |ULTIMATE.start_main_#t~mem4|) [2020-07-29 01:26:48,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {1020#true} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1020#true} is VALID [2020-07-29 01:26:48,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {1020#true} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1020#true} is VALID [2020-07-29 01:26:48,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {1020#true} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1020#true} is VALID [2020-07-29 01:26:48,855 INFO L280 TraceCheckUtils]: 3: Hoare triple {1020#true} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1020#true} is VALID [2020-07-29 01:26:48,856 INFO L280 TraceCheckUtils]: 4: Hoare triple {1020#true} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1020#true} is VALID [2020-07-29 01:26:48,856 INFO L280 TraceCheckUtils]: 5: Hoare triple {1020#true} 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); {1020#true} is VALID [2020-07-29 01:26:48,856 INFO L280 TraceCheckUtils]: 6: Hoare triple {1020#true} 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); {1020#true} is VALID [2020-07-29 01:26:48,857 INFO L280 TraceCheckUtils]: 7: Hoare triple {1020#true} 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); {1050#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~x3~0.base) ULTIMATE.start_main_~x3~0.offset))} is VALID [2020-07-29 01:26:48,860 INFO L280 TraceCheckUtils]: 8: Hoare triple {1050#(= 1 (select (select |#memory_int| ULTIMATE.start_main_~x3~0.base) ULTIMATE.start_main_~x3~0.offset))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1054#(<= 1 |ULTIMATE.start_main_#t~mem4|)} is VALID [2020-07-29 01:26:48,861 INFO L280 TraceCheckUtils]: 9: Hoare triple {1054#(<= 1 |ULTIMATE.start_main_#t~mem4|)} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1021#false} is VALID [2020-07-29 01:26:48,861 INFO L280 TraceCheckUtils]: 10: Hoare triple {1021#false} 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); {1021#false} is VALID [2020-07-29 01:26:48,862 INFO L280 TraceCheckUtils]: 11: Hoare triple {1021#false} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {1021#false} is VALID [2020-07-29 01:26:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:26:48,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:26:48,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2020-07-29 01:26:48,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758295397] [2020-07-29 01:26:48,863 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:26:48,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:26:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:26:48,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:26:48,864 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 01:26:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:26:48,933 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-29 01:26:48,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:26:48,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:26:48,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:26:48,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2020-07-29 01:26:48,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-29 01:26:48,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 25 transitions. [2020-07-29 01:26:48,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 01:26:48,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 01:26:48,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2020-07-29 01:26:48,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:26:48,959 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-29 01:26:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2020-07-29 01:26:48,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-29 01:26:48,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:26:48,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 25 transitions. Second operand 24 states. [2020-07-29 01:26:48,961 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 25 transitions. Second operand 24 states. [2020-07-29 01:26:48,961 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 24 states. [2020-07-29 01:26:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:26:48,962 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-29 01:26:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:26:48,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:48,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:48,963 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states and 25 transitions. [2020-07-29 01:26:48,963 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states and 25 transitions. [2020-07-29 01:26:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:26:48,964 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-29 01:26:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:26:48,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:26:48,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:26:48,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:26:48,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:26:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:26:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-29 01:26:48,966 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-29 01:26:48,966 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-29 01:26:48,966 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:26:48,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:26:48,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-29 01:26:48,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:26:48,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:26:48,967 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-07-29 01:26:48,967 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2020-07-29 01:26:48,968 INFO L794 eck$LassoCheckResult]: Stem: 1091#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1089#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); 1090#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1104#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); 1103#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1102#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1101#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); 1100#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); 1097#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1098#L24-2 [2020-07-29 01:26:48,968 INFO L796 eck$LassoCheckResult]: Loop: 1098#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1112#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); 1111#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1110#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1109#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); 1108#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); 1099#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); 1096#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1094#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1095#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); 1092#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1093#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1107#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); 1105#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); 1106#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1098#L24-2 [2020-07-29 01:26:48,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:48,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 5 times [2020-07-29 01:26:48,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:48,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809398337] [2020-07-29 01:26:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:48,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:48,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:48,995 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1164675892, now seen corresponding path program 1 times [2020-07-29 01:26:48,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:48,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776728129] [2020-07-29 01:26:48,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:49,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:49,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:49,023 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:49,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 1 times [2020-07-29 01:26:49,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:26:49,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227410308] [2020-07-29 01:26:49,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:26:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:49,043 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:26:49,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:26:49,074 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:26:49,707 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 117 [2020-07-29 01:26:49,896 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-07-29 01:26:50,888 WARN L193 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 119 [2020-07-29 01:26:51,223 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-07-29 01:26:51,230 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:26:51,230 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:26:51,231 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:26:51,231 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:26:51,231 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:26:51,231 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:51,231 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:26:51,231 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:26:51,231 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2020-07-29 01:26:51,231 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:26:51,231 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:26:51,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:51,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:51,896 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-07-29 01:26:52,151 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-07-29 01:26:52,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:52,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:52,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:52,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:52,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:52,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:52,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:26:52,731 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-07-29 01:26:53,350 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:26:53,353 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:53,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:53,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:53,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:53,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:53,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:53,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:53,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:53,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:26:53,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:53,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:53,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:53,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:53,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:53,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:53,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:53,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:26:53,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:53,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:53,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:53,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:53,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:53,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:53,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:53,508 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) [2020-07-29 01:26:53,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:53,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:53,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:53,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:53,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:53,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:53,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:53,583 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) [2020-07-29 01:26:53,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:53,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:53,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:53,654 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:26:53,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:53,667 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:26:53,667 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:53,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:26:53,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:53,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:53,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:53,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:53,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:53,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:53,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:53,738 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) [2020-07-29 01:26:53,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:53,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:53,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:53,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:53,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:53,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:53,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:53,789 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) [2020-07-29 01:26:53,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:53,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:53,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:53,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:53,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:53,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:53,835 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 [2020-07-29 01:26:53,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:53,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:26:53,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:26:53,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:26:53,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:26:53,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:26:53,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:26:53,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:26:53,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:26:53,894 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:26:53,895 INFO L444 ModelExtractionUtils]: 1 out of 7 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:26:53,898 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:26:53,900 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:26:53,901 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:26:53,901 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)_2 + 1 Supporting invariants [] [2020-07-29 01:26:54,180 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2020-07-29 01:26:54,187 INFO L393 LassoCheck]: Loop: "call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4);" "assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4);" "assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4);" "call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4);" "assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4);" "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);" "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);" "assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4);" "call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4);" "assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4);" "assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4);" "call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4);" "assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4);" "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);" "assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4);" [2020-07-29 01:26:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:54,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:26:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:26:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:54,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:26:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:54,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:26:54,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {1170#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1170#unseeded} is VALID [2020-07-29 01:26:54,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {1170#unseeded} 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); {1170#unseeded} is VALID [2020-07-29 01:26:54,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {1170#unseeded} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1170#unseeded} is VALID [2020-07-29 01:26:54,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {1170#unseeded} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1170#unseeded} is VALID [2020-07-29 01:26:54,280 INFO L280 TraceCheckUtils]: 4: Hoare triple {1170#unseeded} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1170#unseeded} is VALID [2020-07-29 01:26:54,281 INFO L280 TraceCheckUtils]: 5: Hoare triple {1170#unseeded} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1170#unseeded} is VALID [2020-07-29 01:26:54,282 INFO L280 TraceCheckUtils]: 6: Hoare triple {1170#unseeded} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1170#unseeded} is VALID [2020-07-29 01:26:54,283 INFO L280 TraceCheckUtils]: 7: Hoare triple {1170#unseeded} 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); {1170#unseeded} is VALID [2020-07-29 01:26:54,284 INFO L280 TraceCheckUtils]: 8: Hoare triple {1170#unseeded} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {1170#unseeded} is VALID [2020-07-29 01:26:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:54,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-29 01:26:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:26:54,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:26:54,376 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:54,377 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 [2020-07-29 01:26:54,393 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:54,402 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:54,430 INFO L624 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2020-07-29 01:26:54,430 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:26:54,430 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:27 [2020-07-29 01:26:54,435 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:54,435 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_158|]. (and (= |#memory_int| (store |v_#memory_int_158| ULTIMATE.start_main_~x0~0.base (store (select |v_#memory_int_158| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1))) (<= 1 (+ oldRank0 (* 2 (select (select |v_#memory_int_158| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset))))) [2020-07-29 01:26:54,435 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0)))) [2020-07-29 01:26:54,471 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:26:54,492 INFO L384 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 [2020-07-29 01:26:54,494 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:54,536 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:54,537 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 61 [2020-07-29 01:26:54,563 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-29 01:26:54,577 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:54,587 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:54,648 INFO L624 ElimStorePlain]: treesize reduction 75, result has 31.2 percent of original size [2020-07-29 01:26:54,649 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:26:54,649 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:34 [2020-07-29 01:26:54,653 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:54,654 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_159|]. (let ((.cse2 (select |v_#memory_int_159| ULTIMATE.start_main_~x0~0.base))) (let ((.cse0 (= 1 (select .cse2 ULTIMATE.start_main_~x0~0.offset))) (.cse1 (= |#memory_int| (store |v_#memory_int_159| ULTIMATE.start_main_~x0~0.base (store .cse2 ULTIMATE.start_main_~x0~0.offset 0))))) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) .cse0 .cse1) (and .cse0 .cse1 (<= 1 (+ (* 2 (select (select |v_#memory_int_159| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0)))))) [2020-07-29 01:26:54,654 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))) (or (and (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0)) .cse0) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) .cse0))) [2020-07-29 01:26:54,699 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:54,783 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:54,784 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 92 [2020-07-29 01:26:54,833 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-29 01:26:54,847 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:54,854 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:54,887 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:54,887 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2020-07-29 01:26:54,888 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:54,998 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2020-07-29 01:26:55,000 INFO L624 ElimStorePlain]: treesize reduction 113, result has 38.3 percent of original size [2020-07-29 01:26:55,001 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:26:55,001 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:70 [2020-07-29 01:26:55,006 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:55,006 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_160|]. (let ((.cse0 (= 0 (select (select |v_#memory_int_160| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (.cse1 (<= (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset) |ULTIMATE.start_main_#t~mem7|)) (.cse2 (= (store |v_#memory_int_160| ULTIMATE.start_main_~x1~0.base (store (select |v_#memory_int_160| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset 0)) |#memory_int|))) (or (and (<= 1 (+ oldRank0 (* 2 (select (select |v_#memory_int_160| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)))) .cse0 .cse1 .cse2) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) .cse0 .cse1 .cse2))) [2020-07-29 01:26:55,006 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset))) (let ((.cse0 (<= .cse3 |ULTIMATE.start_main_#t~mem7|)) (.cse1 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))) (.cse2 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) .cse0 .cse1 .cse2) (and (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset)) (<= 1 (+ (* 2 .cse3) oldRank0))) .cse0 .cse1 .cse2)))) [2020-07-29 01:26:55,081 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:55,082 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:26:55,221 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:55,221 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 57 [2020-07-29 01:26:55,223 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:55,275 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:55,275 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 57 [2020-07-29 01:26:55,276 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:55,396 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-07-29 01:26:55,396 INFO L350 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2020-07-29 01:26:55,397 INFO L384 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 44 treesize of output 110 [2020-07-29 01:26:55,424 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:26:55,434 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-29 01:26:55,454 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:55,576 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2020-07-29 01:26:55,577 INFO L624 ElimStorePlain]: treesize reduction 155, result has 32.9 percent of original size [2020-07-29 01:26:55,578 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-07-29 01:26:55,578 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:109, output treesize:76 [2020-07-29 01:26:55,583 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:55,583 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_161|]. (let ((.cse4 (select |v_#memory_int_161| ULTIMATE.start_main_~x2~0.base))) (let ((.cse0 (= 0 (select (select |v_#memory_int_161| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))) (.cse1 (= (store |v_#memory_int_161| ULTIMATE.start_main_~x2~0.base (store .cse4 ULTIMATE.start_main_~x2~0.offset 1)) |#memory_int|)) (.cse2 (= 0 (select (select |v_#memory_int_161| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))) (or (and .cse0 (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) .cse1 .cse2) (and .cse0 (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) .cse1 .cse2) (let ((.cse3 (select .cse4 ULTIMATE.start_main_~x2~0.offset))) (and .cse0 (<= 1 (+ (* 2 .cse3) oldRank0)) .cse1 (<= .cse3 0) .cse2))))) [2020-07-29 01:26:55,584 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (.cse3 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))) (let ((.cse0 (= 0 .cse3)) (.cse1 (= 0 .cse2))) (or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) .cse0 .cse1) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (or .cse0 (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (= 1 .cse2)) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 .cse3) .cse1)))) [2020-07-29 01:26:55,874 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:55,930 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:55,930 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 57 [2020-07-29 01:26:55,932 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:56,055 INFO L350 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2020-07-29 01:26:56,056 INFO L384 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 [2020-07-29 01:26:56,057 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:56,161 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-07-29 01:26:56,162 INFO L624 ElimStorePlain]: treesize reduction 64, result has 53.3 percent of original size [2020-07-29 01:26:56,163 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:26:56,163 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:73 [2020-07-29 01:26:56,170 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:26:56,170 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_162|]. (let ((.cse3 (select |v_#memory_int_162| ULTIMATE.start_main_~x0~0.base))) (let ((.cse0 (= 0 (select .cse3 ULTIMATE.start_main_~x0~0.offset))) (.cse1 (select (select |v_#memory_int_162| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (.cse2 (= (store |v_#memory_int_162| ULTIMATE.start_main_~x0~0.base (store .cse3 ULTIMATE.start_main_~x0~0.offset 1)) |#memory_int|))) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) .cse0 (= 1 .cse1) .cse2) (and .cse0 (<= 1 oldRank0) (= 0 .cse1) (= 1 (select (select |v_#memory_int_162| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) .cse2)))) [2020-07-29 01:26:56,170 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (.cse2 (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (.cse3 (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset)) (.cse1 (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 .cse0) .cse1 (or (not .cse2) (not .cse3))) (and (or (not (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (or (= 0 .cse0) (and .cse2 .cse3)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) .cse1))) [2020-07-29 01:26:56,280 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:56,288 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:26:56,313 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:26:56,320 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:26:56,328 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:26:56,430 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:56,431 INFO L384 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 [2020-07-29 01:26:56,432 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:56,465 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:56,466 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2020-07-29 01:26:56,473 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:56,504 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-07-29 01:26:56,506 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:56,537 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:56,538 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2020-07-29 01:26:56,540 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:56,566 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-07-29 01:26:56,567 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:56,627 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:26:56,627 INFO L384 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 79 [2020-07-29 01:26:56,629 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-29 01:26:56,738 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2020-07-29 01:26:56,740 INFO L624 ElimStorePlain]: treesize reduction 239, result has 18.4 percent of original size [2020-07-29 01:26:56,742 INFO L544 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. [2020-07-29 01:26:56,742 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:261, output treesize:54 [2020-07-29 01:27:08,958 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:27:08,959 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_163|, ULTIMATE.start_main_~x0~0.base, ULTIMATE.start_main_~x0~0.offset]. (let ((.cse12 (select |v_#memory_int_163| ULTIMATE.start_main_~x1~0.base))) (let ((.cse11 (select |v_#memory_int_163| ULTIMATE.start_main_~x0~0.base)) (.cse10 (select .cse12 ULTIMATE.start_main_~x1~0.offset))) (let ((.cse8 (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset)) (.cse6 (= 1 .cse10)) (.cse7 (= |#memory_int| (store |v_#memory_int_163| ULTIMATE.start_main_~x1~0.base (store .cse12 ULTIMATE.start_main_~x1~0.offset 0)))) (.cse9 (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (.cse0 (<= (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset) |ULTIMATE.start_main_#t~mem6|)) (.cse1 (= 1 (select (select |v_#memory_int_163| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset))) (.cse2 (<= 1 oldRank0)) (.cse3 (= (store |v_#memory_int_163| ULTIMATE.start_main_~x0~0.base (store .cse11 ULTIMATE.start_main_~x0~0.offset 0)) |#memory_int|)) (.cse4 (= 1 (select .cse11 ULTIMATE.start_main_~x0~0.offset))) (.cse5 (= 0 .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse7 (not .cse8)) (and .cse0 .cse9 .cse8 (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) .cse6 .cse3 .cse4) (and .cse0 .cse9 .cse8 .cse6 .cse3 .cse4 (not (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (and .cse0 .cse1 .cse2 .cse6 .cse7 (not .cse9)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)) .cse5))))) [2020-07-29 01:27:08,959 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~x0~0.base, ULTIMATE.start_main_~x0~0.offset]. (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))) (let ((.cse0 (<= .cse1 |ULTIMATE.start_main_#t~mem6|))) (or (and .cse0 (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 0 .cse1)) (and .cse0 (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 .cse1) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))))) [2020-07-29 01:27:09,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {1173#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) 1))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1173#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) 1))} is VALID [2020-07-29 01:27:09,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {1173#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) 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); {1173#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) 1))} is VALID [2020-07-29 01:27:09,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {1173#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) 1))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1428#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0))))} is VALID [2020-07-29 01:27:09,103 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0))))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1428#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0))))} is VALID [2020-07-29 01:27:09,104 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0))))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1428#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0))))} is VALID [2020-07-29 01:27:09,106 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#(and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0))))} 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); {1438#(or (and (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} is VALID [2020-07-29 01:27:09,109 INFO L280 TraceCheckUtils]: 6: Hoare triple {1438#(or (and (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} 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); {1442#(or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (<= (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset) |ULTIMATE.start_main_#t~mem7|) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset)) (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset) |ULTIMATE.start_main_#t~mem7|) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} is VALID [2020-07-29 01:27:09,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {1442#(or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (<= (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset) |ULTIMATE.start_main_#t~mem7|) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset)) (<= 1 (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) oldRank0))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset) |ULTIMATE.start_main_#t~mem7|) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); {1446#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} is VALID [2020-07-29 01:27:09,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {1446#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1446#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} is VALID [2020-07-29 01:27:09,114 INFO L280 TraceCheckUtils]: 9: Hoare triple {1446#(or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1453#(and (or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset) |ULTIMATE.start_main_#t~mem5|))} is VALID [2020-07-29 01:27:09,117 INFO L280 TraceCheckUtils]: 10: Hoare triple {1453#(and (or (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset) |ULTIMATE.start_main_#t~mem5|))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1457#(or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset)))) (and (or (not (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} is VALID [2020-07-29 01:27:09,118 INFO L280 TraceCheckUtils]: 11: Hoare triple {1457#(or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset)))) (and (or (not (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1457#(or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset)))) (and (or (not (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} is VALID [2020-07-29 01:27:09,118 INFO L280 TraceCheckUtils]: 12: Hoare triple {1457#(or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset)))) (and (or (not (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1457#(or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset)))) (and (or (not (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} is VALID [2020-07-29 01:27:09,123 INFO L280 TraceCheckUtils]: 13: Hoare triple {1457#(or (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset)))) (and (or (not (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (and (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base) (= ULTIMATE.start_main_~x1~0.offset ULTIMATE.start_main_~x0~0.offset))) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} 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); {1467#(or (and (<= (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset) |ULTIMATE.start_main_#t~mem6|) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (<= (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset) |ULTIMATE.start_main_#t~mem6|) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (exists ((ULTIMATE.start_main_~x0~0.base Int) (ULTIMATE.start_main_~x0~0.offset Int)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))))} is VALID [2020-07-29 01:27:09,125 INFO L280 TraceCheckUtils]: 14: Hoare triple {1467#(or (and (<= (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset) |ULTIMATE.start_main_#t~mem6|) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (<= 1 oldRank0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset))) (and (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base) (<= (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset) |ULTIMATE.start_main_#t~mem6|) (= ULTIMATE.start_main_~x2~0.offset ULTIMATE.start_main_~x1~0.offset) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (exists ((ULTIMATE.start_main_~x0~0.base Int) (ULTIMATE.start_main_~x0~0.offset Int)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))))} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {1393#(or (and (> oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:09,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:27:09,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:09,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 9 letters. Loop has 15 letters. [2020-07-29 01:27:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,177 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 [2020-07-29 01:27:09,177 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 25 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-07-29 01:27:09,888 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-07-29 01:27:09,966 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 25 transitions. cyclomatic complexity: 2. Second operand 10 states. Result 54 states and 57 transitions. Complement of second has 19 states. [2020-07-29 01:27:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:09,966 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:09,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions. cyclomatic complexity: 2 [2020-07-29 01:27:09,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:09,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:09,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-07-29 01:27:09,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:27:09,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:09,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:09,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 57 transitions. [2020-07-29 01:27:09,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-29 01:27:09,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:09,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:09,971 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 25 transitions. cyclomatic complexity: 2 [2020-07-29 01:27:09,976 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2020-07-29 01:27:09,977 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states. [2020-07-29 01:27:09,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:27:09,978 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:09,978 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 57 transitions. cyclomatic complexity: 5 [2020-07-29 01:27:09,988 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2020-07-29 01:27:09,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 15 letters. [2020-07-29 01:27:09,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 9 letters. Loop has 15 letters. [2020-07-29 01:27:09,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 15 letters. [2020-07-29 01:27:09,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:09,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:09,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:09,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 24 letters. Loop has 8 letters. [2020-07-29 01:27:09,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 24 letters. Loop has 8 letters. [2020-07-29 01:27:09,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 8 letters. [2020-07-29 01:27:09,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 54 letters. Loop has 54 letters. [2020-07-29 01:27:09,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 54 letters. Loop has 54 letters. [2020-07-29 01:27:09,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 54 letters. Loop has 54 letters. [2020-07-29 01:27:09,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:27:09,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:27:09,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:27:09,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:27:09,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:27:09,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:27:09,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 19 letters. Loop has 8 letters. [2020-07-29 01:27:09,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 19 letters. Loop has 8 letters. [2020-07-29 01:27:09,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 8 letters. [2020-07-29 01:27:09,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 20 letters. Loop has 8 letters. [2020-07-29 01:27:09,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 01:27:09,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 8 letters. [2020-07-29 01:27:09,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:27:09,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:09,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:27:10,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:27:10,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:27:10,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:27:10,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:27:10,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 16 letters. Loop has 8 letters. [2020-07-29 01:27:10,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 01:27:10,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 8 letters. [2020-07-29 01:27:10,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 15 letters. [2020-07-29 01:27:10,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 9 letters. Loop has 15 letters. [2020-07-29 01:27:10,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 15 letters. [2020-07-29 01:27:10,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:27:10,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:27:10,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:27:10,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 22 letters. Loop has 8 letters. [2020-07-29 01:27:10,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 22 letters. Loop has 8 letters. [2020-07-29 01:27:10,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 22 letters. Loop has 8 letters. [2020-07-29 01:27:10,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 23 letters. Loop has 8 letters. [2020-07-29 01:27:10,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 23 letters. Loop has 8 letters. [2020-07-29 01:27:10,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 23 letters. Loop has 8 letters. [2020-07-29 01:27:10,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 21 letters. Loop has 8 letters. [2020-07-29 01:27:10,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 01:27:10,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 8 letters. [2020-07-29 01:27:10,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 14 letters. Loop has 15 letters. [2020-07-29 01:27:10,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 14 letters. Loop has 15 letters. [2020-07-29 01:27:10,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 15 letters. [2020-07-29 01:27:10,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 15 letters. [2020-07-29 01:27:10,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 13 letters. Loop has 15 letters. [2020-07-29 01:27:10,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 15 letters. [2020-07-29 01:27:10,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 15 letters. [2020-07-29 01:27:10,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 12 letters. Loop has 15 letters. [2020-07-29 01:27:10,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 15 letters. [2020-07-29 01:27:10,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 15 letters. [2020-07-29 01:27:10,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 11 letters. Loop has 15 letters. [2020-07-29 01:27:10,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 15 letters. [2020-07-29 01:27:10,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 15 letters. [2020-07-29 01:27:10,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 10 letters. Loop has 15 letters. [2020-07-29 01:27:10,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 15 letters. [2020-07-29 01:27:10,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:10,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:10,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:10,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 24 letters. Loop has 8 letters. [2020-07-29 01:27:10,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 24 letters. Loop has 8 letters. [2020-07-29 01:27:10,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 8 letters. [2020-07-29 01:27:10,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 25 letters. Loop has 8 letters. [2020-07-29 01:27:10,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 25 letters. Loop has 8 letters. [2020-07-29 01:27:10,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 8 letters. [2020-07-29 01:27:10,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 26 letters. Loop has 8 letters. [2020-07-29 01:27:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 26 letters. Loop has 8 letters. [2020-07-29 01:27:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 26 letters. Loop has 8 letters. [2020-07-29 01:27:10,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 27 letters. Loop has 8 letters. [2020-07-29 01:27:10,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 27 letters. Loop has 8 letters. [2020-07-29 01:27:10,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 27 letters. Loop has 8 letters. [2020-07-29 01:27:10,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 28 letters. Loop has 8 letters. [2020-07-29 01:27:10,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 28 letters. Loop has 8 letters. [2020-07-29 01:27:10,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 28 letters. Loop has 8 letters. [2020-07-29 01:27:10,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 29 letters. Loop has 8 letters. [2020-07-29 01:27:10,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 29 letters. Loop has 8 letters. [2020-07-29 01:27:10,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 29 letters. Loop has 8 letters. [2020-07-29 01:27:10,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 30 letters. Loop has 8 letters. [2020-07-29 01:27:10,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 30 letters. Loop has 8 letters. [2020-07-29 01:27:10,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 30 letters. Loop has 8 letters. [2020-07-29 01:27:10,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 31 letters. Loop has 8 letters. [2020-07-29 01:27:10,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 31 letters. Loop has 8 letters. [2020-07-29 01:27:10,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 31 letters. Loop has 8 letters. [2020-07-29 01:27:10,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 32 letters. Loop has 15 letters. [2020-07-29 01:27:10,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 32 letters. Loop has 15 letters. [2020-07-29 01:27:10,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 15 letters. [2020-07-29 01:27:10,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 33 letters. Loop has 15 letters. [2020-07-29 01:27:10,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 33 letters. Loop has 15 letters. [2020-07-29 01:27:10,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 33 letters. Loop has 15 letters. [2020-07-29 01:27:10,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 34 letters. Loop has 15 letters. [2020-07-29 01:27:10,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 34 letters. Loop has 15 letters. [2020-07-29 01:27:10,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 34 letters. Loop has 15 letters. [2020-07-29 01:27:10,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 35 letters. Loop has 15 letters. [2020-07-29 01:27:10,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 35 letters. Loop has 15 letters. [2020-07-29 01:27:10,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 35 letters. Loop has 15 letters. [2020-07-29 01:27:10,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 36 letters. Loop has 15 letters. [2020-07-29 01:27:10,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 36 letters. Loop has 15 letters. [2020-07-29 01:27:10,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 36 letters. Loop has 15 letters. [2020-07-29 01:27:10,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 37 letters. Loop has 15 letters. [2020-07-29 01:27:10,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 37 letters. Loop has 15 letters. [2020-07-29 01:27:10,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 37 letters. Loop has 15 letters. [2020-07-29 01:27:10,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 25 transitions. cyclomatic complexity: 2 Stem has 38 letters. Loop has 15 letters. [2020-07-29 01:27:10,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states. Stem has 38 letters. Loop has 15 letters. [2020-07-29 01:27:10,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 57 transitions. cyclomatic complexity: 5 Stem has 38 letters. Loop has 15 letters. [2020-07-29 01:27:10,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,040 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:27:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2020-07-29 01:27:10,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 22 transitions. Stem has 9 letters. Loop has 15 letters. [2020-07-29 01:27:10,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 22 transitions. Stem has 24 letters. Loop has 15 letters. [2020-07-29 01:27:10,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 22 transitions. Stem has 9 letters. Loop has 30 letters. [2020-07-29 01:27:10,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:10,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 57 transitions. cyclomatic complexity: 5 [2020-07-29 01:27:10,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-29 01:27:10,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 57 transitions. [2020-07-29 01:27:10,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2020-07-29 01:27:10,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-07-29 01:27:10,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 57 transitions. [2020-07-29 01:27:10,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:10,049 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-07-29 01:27:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 57 transitions. [2020-07-29 01:27:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2020-07-29 01:27:10,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:10,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 57 transitions. Second operand 47 states. [2020-07-29 01:27:10,053 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 57 transitions. Second operand 47 states. [2020-07-29 01:27:10,053 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 47 states. [2020-07-29 01:27:10,054 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:10,056 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-07-29 01:27:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-07-29 01:27:10,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:10,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:10,057 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states and 57 transitions. [2020-07-29 01:27:10,058 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states and 57 transitions. [2020-07-29 01:27:10,058 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:10,060 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-07-29 01:27:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-07-29 01:27:10,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:10,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:10,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:10,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-29 01:27:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-07-29 01:27:10,063 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-29 01:27:10,063 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-07-29 01:27:10,064 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:27:10,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2020-07-29 01:27:10,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-29 01:27:10,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:10,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:10,066 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2020-07-29 01:27:10,066 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2020-07-29 01:27:10,066 INFO L794 eck$LassoCheckResult]: Stem: 1560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1554#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); 1555#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1586#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); 1585#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1584#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1583#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); 1582#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); 1581#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1580#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1579#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); 1600#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1599#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1598#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); 1597#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); 1596#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); 1565#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1561#L24-2 [2020-07-29 01:27:10,066 INFO L796 eck$LassoCheckResult]: Loop: 1561#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1562#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); 1556#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1557#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1588#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); 1587#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); 1567#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); 1568#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1595#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1594#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); 1593#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1592#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1591#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); 1590#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); 1589#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1561#L24-2 [2020-07-29 01:27:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 2 times [2020-07-29 01:27:10,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:10,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055904981] [2020-07-29 01:27:10,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:10,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:10,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:10,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:10,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1164675892, now seen corresponding path program 2 times [2020-07-29 01:27:10,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:10,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311628022] [2020-07-29 01:27:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:10,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:10,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:10,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1079647751, now seen corresponding path program 3 times [2020-07-29 01:27:10,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:10,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532492690] [2020-07-29 01:27:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:10,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {1820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1820#true} is VALID [2020-07-29 01:27:10,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {1820#true} 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); {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,335 INFO L280 TraceCheckUtils]: 2: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,336 INFO L280 TraceCheckUtils]: 3: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} 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#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1823#(and (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base))) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} is VALID [2020-07-29 01:27:10,338 INFO L280 TraceCheckUtils]: 5: Hoare triple {1823#(and (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base))) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1823#(and (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base))) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} is VALID [2020-07-29 01:27:10,339 INFO L280 TraceCheckUtils]: 6: Hoare triple {1823#(and (or (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base))) (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset))))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1824#(and (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 |ULTIMATE.start_main_#t~mem5|)) (or (= 0 |ULTIMATE.start_main_#t~mem5|) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base))))} is VALID [2020-07-29 01:27:10,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {1824#(and (or (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 |ULTIMATE.start_main_#t~mem5|)) (or (= 0 |ULTIMATE.start_main_#t~mem5|) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base))))} 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); {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,344 INFO L280 TraceCheckUtils]: 8: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,345 INFO L280 TraceCheckUtils]: 9: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,346 INFO L280 TraceCheckUtils]: 10: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} 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#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,346 INFO L280 TraceCheckUtils]: 11: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,352 INFO L280 TraceCheckUtils]: 12: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} 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#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,354 INFO L280 TraceCheckUtils]: 14: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} 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); {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,355 INFO L280 TraceCheckUtils]: 15: Hoare triple {1822#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} 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); {1825#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} is VALID [2020-07-29 01:27:10,357 INFO L280 TraceCheckUtils]: 16: Hoare triple {1825#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)))} assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} is VALID [2020-07-29 01:27:10,358 INFO L280 TraceCheckUtils]: 17: Hoare triple {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} is VALID [2020-07-29 01:27:10,358 INFO L280 TraceCheckUtils]: 18: Hoare triple {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} is VALID [2020-07-29 01:27:10,359 INFO L280 TraceCheckUtils]: 19: Hoare triple {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} is VALID [2020-07-29 01:27:10,360 INFO L280 TraceCheckUtils]: 20: Hoare triple {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} is VALID [2020-07-29 01:27:10,361 INFO L280 TraceCheckUtils]: 21: Hoare triple {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} is VALID [2020-07-29 01:27:10,363 INFO L280 TraceCheckUtils]: 22: Hoare triple {1826#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x0~0.base (store (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset 1)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} 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); {1827#(= 0 |ULTIMATE.start_main_#t~mem6|)} is VALID [2020-07-29 01:27:10,363 INFO L280 TraceCheckUtils]: 23: Hoare triple {1827#(= 0 |ULTIMATE.start_main_#t~mem6|)} 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); {1821#false} is VALID [2020-07-29 01:27:10,364 INFO L280 TraceCheckUtils]: 24: Hoare triple {1821#false} assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:10,364 INFO L280 TraceCheckUtils]: 25: Hoare triple {1821#false} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:10,364 INFO L280 TraceCheckUtils]: 26: Hoare triple {1821#false} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:10,365 INFO L280 TraceCheckUtils]: 27: Hoare triple {1821#false} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:10,365 INFO L280 TraceCheckUtils]: 28: Hoare triple {1821#false} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:10,365 INFO L280 TraceCheckUtils]: 29: Hoare triple {1821#false} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:10,365 INFO L280 TraceCheckUtils]: 30: Hoare triple {1821#false} 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); {1821#false} is VALID [2020-07-29 01:27:10,365 INFO L280 TraceCheckUtils]: 31: Hoare triple {1821#false} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 46 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-29 01:27:10,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532492690] [2020-07-29 01:27:10,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025907720] [2020-07-29 01:27:10,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:10,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-07-29 01:27:10,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:10,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:27:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:10,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:10,513 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:27:10,513 INFO L384 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 [2020-07-29 01:27:10,523 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:10,527 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:27:10,533 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:27:10,534 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:27:10,534 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-07-29 01:27:10,545 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:27:10,545 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_163|]. (let ((.cse0 (store |v_#valid_163| ULTIMATE.start_main_~x0~0.base 1))) (and (<= (select (store .cse0 ULTIMATE.start_main_~x1~0.base 1) ULTIMATE.start_main_~x2~0.base) 0) (= 0 (select .cse0 ULTIMATE.start_main_~x1~0.base)))) [2020-07-29 01:27:10,545 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) [2020-07-29 01:27:10,619 INFO L384 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 [2020-07-29 01:27:10,619 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:27:10,626 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:27:10,627 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:27:10,627 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-07-29 01:27:10,695 INFO L384 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 [2020-07-29 01:27:10,696 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:27:10,708 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:27:10,720 INFO L544 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. [2020-07-29 01:27:10,721 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-29 01:27:10,726 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:27:10,727 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_166|, ULTIMATE.start_main_~x2~0.base, ULTIMATE.start_main_~x2~0.offset]. (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= (store |v_#memory_int_166| ULTIMATE.start_main_~x2~0.base (store (select |v_#memory_int_166| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset 1)) |#memory_int|) (= 0 (select (select |v_#memory_int_166| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) [2020-07-29 01:27:10,727 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~x2~0.base, ULTIMATE.start_main_~x2~0.offset]. (and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base))) [2020-07-29 01:27:10,994 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 26 treesize of output 28 [2020-07-29 01:27:10,995 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:27:11,006 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:27:11,018 INFO L544 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. [2020-07-29 01:27:11,018 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2020-07-29 01:27:11,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:27:11,358 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2020-07-29 01:27:11,359 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:27:11,367 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:27:11,388 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:27:11,388 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-07-29 01:27:11,392 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:27:11,392 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_168|, ULTIMATE.start_main_~x0~0.base, ULTIMATE.start_main_~x0~0.offset, ULTIMATE.start_main_~x1~0.base, ULTIMATE.start_main_~x1~0.offset, ULTIMATE.start_main_~x2~0.base, ULTIMATE.start_main_~x2~0.offset]. (let ((.cse0 (select |v_#memory_int_168| ULTIMATE.start_main_~x0~0.base))) (and (= 0 (select (select |v_#memory_int_168| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= |ULTIMATE.start_main_#t~mem6| (select (select (store |v_#memory_int_168| ULTIMATE.start_main_~x0~0.base (store .cse0 ULTIMATE.start_main_~x0~0.offset 0)) ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select .cse0 ULTIMATE.start_main_~x0~0.offset)) (= 1 (select (select |v_#memory_int_168| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) [2020-07-29 01:27:11,392 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |ULTIMATE.start_main_#t~mem6|) [2020-07-29 01:27:11,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {1820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1820#true} is VALID [2020-07-29 01:27:11,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {1820#true} 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); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,404 INFO L280 TraceCheckUtils]: 3: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} 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#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,405 INFO L280 TraceCheckUtils]: 4: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,407 INFO L280 TraceCheckUtils]: 6: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} 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#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,408 INFO L280 TraceCheckUtils]: 7: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} 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); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,409 INFO L280 TraceCheckUtils]: 8: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,410 INFO L280 TraceCheckUtils]: 9: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,410 INFO L280 TraceCheckUtils]: 10: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} 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#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,411 INFO L280 TraceCheckUtils]: 11: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,412 INFO L280 TraceCheckUtils]: 12: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,413 INFO L280 TraceCheckUtils]: 13: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} 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#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} 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); {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,416 INFO L280 TraceCheckUtils]: 15: Hoare triple {1834#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} 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); {1877#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} is VALID [2020-07-29 01:27:11,417 INFO L280 TraceCheckUtils]: 16: Hoare triple {1877#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))} assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); {1881#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} is VALID [2020-07-29 01:27:11,418 INFO L280 TraceCheckUtils]: 17: Hoare triple {1881#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1881#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} is VALID [2020-07-29 01:27:11,419 INFO L280 TraceCheckUtils]: 18: Hoare triple {1881#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1881#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} is VALID [2020-07-29 01:27:11,422 INFO L280 TraceCheckUtils]: 19: Hoare triple {1881#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)))} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1891#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:27:11,424 INFO L280 TraceCheckUtils]: 20: Hoare triple {1891#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1891#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:27:11,425 INFO L280 TraceCheckUtils]: 21: Hoare triple {1891#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1891#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} is VALID [2020-07-29 01:27:11,427 INFO L280 TraceCheckUtils]: 22: Hoare triple {1891#(and (not (= ULTIMATE.start_main_~x0~0.base ULTIMATE.start_main_~x1~0.base)) (exists ((ULTIMATE.start_main_~x2~0.offset Int) (ULTIMATE.start_main_~x2~0.base Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x1~0.base)) (not (= ULTIMATE.start_main_~x2~0.base ULTIMATE.start_main_~x0~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)))} 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); {1827#(= 0 |ULTIMATE.start_main_#t~mem6|)} is VALID [2020-07-29 01:27:11,428 INFO L280 TraceCheckUtils]: 23: Hoare triple {1827#(= 0 |ULTIMATE.start_main_#t~mem6|)} 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); {1821#false} is VALID [2020-07-29 01:27:11,428 INFO L280 TraceCheckUtils]: 24: Hoare triple {1821#false} assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:11,428 INFO L280 TraceCheckUtils]: 25: Hoare triple {1821#false} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:11,428 INFO L280 TraceCheckUtils]: 26: Hoare triple {1821#false} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:11,428 INFO L280 TraceCheckUtils]: 27: Hoare triple {1821#false} assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:11,428 INFO L280 TraceCheckUtils]: 28: Hoare triple {1821#false} call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:11,429 INFO L280 TraceCheckUtils]: 29: Hoare triple {1821#false} assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:11,429 INFO L280 TraceCheckUtils]: 30: Hoare triple {1821#false} 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); {1821#false} is VALID [2020-07-29 01:27:11,429 INFO L280 TraceCheckUtils]: 31: Hoare triple {1821#false} assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); {1821#false} is VALID [2020-07-29 01:27:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 43 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-29 01:27:11,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:11,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-29 01:27:11,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196506600] [2020-07-29 01:27:12,195 WARN L193 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 117 [2020-07-29 01:27:12,384 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-07-29 01:27:12,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:12,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:27:12,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:27:12,385 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. cyclomatic complexity: 5 Second operand 12 states. [2020-07-29 01:27:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:12,813 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-29 01:27:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:27:12,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:27:12,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:12,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2020-07-29 01:27:12,898 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:12,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2020-07-29 01:27:12,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:27:12,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:27:12,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:27:12,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:12,898 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:12,898 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:12,899 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:12,899 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:27:12,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:27:12,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:12,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:12,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:27:12 BoogieIcfgContainer [2020-07-29 01:27:12,906 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:27:12,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:27:12,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:27:12,907 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:27:12,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:26:37" (3/4) ... [2020-07-29 01:27:12,911 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:27:12,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:27:12,912 INFO L168 Benchmark]: Toolchain (without parser) took 36764.25 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 435.2 MB). Free memory was 952.2 MB in the beginning and 1.2 GB in the end (delta: -235.4 MB). Peak memory consumption was 199.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:12,912 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:12,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.13 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:12,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:12,913 INFO L168 Benchmark]: Boogie Preprocessor took 25.60 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:12,914 INFO L168 Benchmark]: RCFGBuilder took 635.82 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:12,914 INFO L168 Benchmark]: BuchiAutomizer took 35765.99 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 340.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.8 MB). Peak memory consumption was 192.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:12,914 INFO L168 Benchmark]: Witness Printer took 4.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:12,916 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 230.13 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 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 96.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.60 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 635.82 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 35765.99 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 340.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -148.8 MB). Peak memory consumption was 192.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (6 trivial, 2 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[x2][x2] + 1 and consists of 10 locations. 6 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 35.7s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 16.9s. Construction of modules took 1.0s. Büchi inclusion checks took 17.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/19 HoareTripleCheckerStatistics: 37 SDtfs, 70 SDslu, 43 SDs, 0 SdLazy, 405 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc4 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital850 mio100 ax100 hnf100 lsp98 ukn34 mio100 lsp39 div100 bol100 ite100 ukn100 eq194 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...