./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test27-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/test27-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfe25ce750efb74d780ec4e5d4c6de923e91c57e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:15:55,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:15:55,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:15:55,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:15:55,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:15:55,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:15:55,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:15:55,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:15:55,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:15:55,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:15:55,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:15:55,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:15:55,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:15:55,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:15:55,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:15:55,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:15:55,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:15:55,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:15:55,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:15:55,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:15:55,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:15:55,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:15:55,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:15:55,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:15:55,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:15:55,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:15:55,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:15:55,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:15:55,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:15:55,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:15:55,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:15:55,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:15:55,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:15:55,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:15:55,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:15:55,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:15:55,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:15:55,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:15:55,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:15:55,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:15:55,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:15:55,644 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:15:55,673 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:15:55,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:15:55,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:15:55,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:15:55,677 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:15:55,677 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:15:55,678 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:15:55,678 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:15:55,678 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:15:55,678 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:15:55,679 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:15:55,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:15:55,680 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:15:55,680 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:15:55,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:15:55,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:15:55,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:15:55,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:15:55,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:15:55,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:15:55,681 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:15:55,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:15:55,682 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:15:55,682 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:15:55,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:15:55,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:15:55,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:15:55,683 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:15:55,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:15:55,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:15:55,684 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:15:55,685 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:15:55,686 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfe25ce750efb74d780ec4e5d4c6de923e91c57e [2019-11-28 03:15:56,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:15:56,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:15:56,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:15:56,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:15:56,049 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:15:56,050 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-2.c [2019-11-28 03:15:56,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2a936d0/cc13da3c3f7d4d2cbba748a21beaa18e/FLAGf346c4294 [2019-11-28 03:15:56,624 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:15:56,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2019-11-28 03:15:56,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2a936d0/cc13da3c3f7d4d2cbba748a21beaa18e/FLAGf346c4294 [2019-11-28 03:15:56,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e2a936d0/cc13da3c3f7d4d2cbba748a21beaa18e [2019-11-28 03:15:56,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:15:56,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:15:56,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:15:56,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:15:56,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:15:56,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:15:56" (1/1) ... [2019-11-28 03:15:56,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f6223b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:56, skipping insertion in model container [2019-11-28 03:15:56,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:15:56" (1/1) ... [2019-11-28 03:15:56,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:15:57,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:15:57,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:15:57,231 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:15:57,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:15:57,323 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:15:57,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57 WrapperNode [2019-11-28 03:15:57,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:15:57,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:15:57,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:15:57,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:15:57,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... [2019-11-28 03:15:57,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... [2019-11-28 03:15:57,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:15:57,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:15:57,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:15:57,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:15:57,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... [2019-11-28 03:15:57,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... [2019-11-28 03:15:57,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... [2019-11-28 03:15:57,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... [2019-11-28 03:15:57,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... [2019-11-28 03:15:57,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... [2019-11-28 03:15:57,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... [2019-11-28 03:15:57,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:15:57,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:15:57,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:15:57,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:15:57,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:15:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:15:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:15:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:15:57,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:15:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:15:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:15:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:15:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:15:57,847 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:15:57,847 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 03:15:57,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:57 BoogieIcfgContainer [2019-11-28 03:15:57,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:15:57,849 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:15:57,850 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:15:57,853 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:15:57,854 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:15:57,854 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:15:56" (1/3) ... [2019-11-28 03:15:57,855 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63865a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:15:57, skipping insertion in model container [2019-11-28 03:15:57,856 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:15:57,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:57" (2/3) ... [2019-11-28 03:15:57,856 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63865a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:15:57, skipping insertion in model container [2019-11-28 03:15:57,857 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:15:57,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:57" (3/3) ... [2019-11-28 03:15:57,858 INFO L371 chiAutomizerObserver]: Analyzing ICFG test27-2.c [2019-11-28 03:15:57,943 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:15:57,944 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:15:57,944 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:15:57,944 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:15:57,945 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:15:57,945 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:15:57,952 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:15:57,952 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:15:57,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 03:15:58,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:15:58,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:15:58,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:15:58,015 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:15:58,015 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:15:58,016 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:15:58,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 03:15:58,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:15:58,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:15:58,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:15:58,019 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:15:58,019 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:15:58,028 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 15#L27-3true [2019-11-28 03:15:58,029 INFO L796 eck$LassoCheckResult]: Loop: 15#L27-3true assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 18#L27-2true main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 15#L27-3true [2019-11-28 03:15:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:15:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:15:58,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:15:58,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024193504] [2019-11-28 03:15:58,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:15:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:15:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:15:58,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:15:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:15:58,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-28 03:15:58,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:15:58,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792389859] [2019-11-28 03:15:58,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:15:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:15:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:15:58,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:15:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:15:58,209 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-28 03:15:58,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:15:58,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663162504] [2019-11-28 03:15:58,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:15:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:15:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:15:58,300 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:15:58,411 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-28 03:15:58,464 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:15:58,558 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:15:58,572 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:15:58,683 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-28 03:15:58,684 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:15:58,687 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 03:15:58,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:178 [2019-11-28 03:15:58,790 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-28 03:15:59,023 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-28 03:15:59,133 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:15:59,135 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:15:59,135 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:15:59,135 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:15:59,135 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:15:59,136 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:15:59,136 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:15:59,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:15:59,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-2.c_Iteration1_Lasso [2019-11-28 03:15:59,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:15:59,138 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:15:59,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,380 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-28 03:15:59,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:15:59,845 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:15:59,851 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:15:59,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:15:59,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:15:59,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:15:59,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:15:59,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:15:59,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:15:59,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:15:59,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:15:59,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:15:59,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:15:59,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:15:59,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:15:59,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:15:59,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:15:59,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:15:59,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:15:59,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:15:59,922 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 [2019-11-28 03:15:59,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:15:59,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:15:59,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:15:59,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:15:59,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:15:59,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:15:59,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:15:59,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:15:59,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:15:59,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:15:59,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:15:59,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:15:59,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:15:59,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:15:59,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:15:59,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:15:59,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:15:59,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:15:59,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:15:59,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:15:59,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:15:59,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:15:59,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:15:59,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:15:59,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:15:59,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:15:59,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:00,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:00,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:00,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:00,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:00,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:00,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:00,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:00,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:00,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:00,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:00,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:00,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:00,077 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 [2019-11-28 03:16:00,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:00,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:00,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:00,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:00,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:00,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:00,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:00,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:00,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:00,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:00,145 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 [2019-11-28 03:16:00,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:00,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:16:00,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:00,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:16:00,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:16:00,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:00,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:00,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:00,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:00,198 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 [2019-11-28 03:16:00,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:16:00,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:00,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:00,212 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) [2019-11-28 03:16:00,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:16:00,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:16:00,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:16:00,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:16:00,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:00,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:16:00,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:16:00,269 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:16:00,466 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-28 03:16:00,467 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:16:00,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:16:00,477 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:16:00,478 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:16:00,479 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#dummies~0.base)_1, ULTIMATE.start_main_~j~0) = 19*v_rep(select #length ULTIMATE.start_main_~#dummies~0.base)_1 - 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-28 03:16:00,534 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-28 03:16:00,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:16:00,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:00,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:16:00,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:00,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:16:00,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:00,702 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:16:00,704 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-28 03:16:00,828 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 56 transitions. Complement of second has 8 states. [2019-11-28 03:16:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:16:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:16:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-11-28 03:16:00,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-28 03:16:00,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:00,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 03:16:00,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:00,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 03:16:00,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:16:00,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2019-11-28 03:16:00,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:00,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2019-11-28 03:16:00,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 03:16:00,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:00,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-28 03:16:00,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:00,848 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-28 03:16:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-28 03:16:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 03:16:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 03:16:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-11-28 03:16:00,877 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-28 03:16:00,877 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-28 03:16:00,877 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:16:00,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-11-28 03:16:00,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:00,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:00,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:00,879 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:16:00,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:00,879 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 139#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 140#L27-3 assume !(main_~j~0 < 10); 142#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 143#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 144#L42-3 [2019-11-28 03:16:00,880 INFO L796 eck$LassoCheckResult]: Loop: 144#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 145#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 144#L42-3 [2019-11-28 03:16:00,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2019-11-28 03:16:00,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:00,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177037062] [2019-11-28 03:16:00,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:00,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177037062] [2019-11-28 03:16:00,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:16:00,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:16:00,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194756974] [2019-11-28 03:16:00,957 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2019-11-28 03:16:00,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:00,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880478550] [2019-11-28 03:16:00,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:00,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:01,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:16:01,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:16:01,022 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-28 03:16:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:01,036 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-28 03:16:01,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:16:01,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-28 03:16:01,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:01,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 03:16:01,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:01,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:01,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-28 03:16:01,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:01,039 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 03:16:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-28 03:16:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-11-28 03:16:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 03:16:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 03:16:01,041 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 03:16:01,042 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 03:16:01,042 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:16:01,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-28 03:16:01,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:01,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:01,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:01,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:16:01,043 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:01,043 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 164#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 165#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 171#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 172#L27-3 assume !(main_~j~0 < 10); 169#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 170#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 167#L42-3 [2019-11-28 03:16:01,043 INFO L796 eck$LassoCheckResult]: Loop: 167#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 168#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 167#L42-3 [2019-11-28 03:16:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2019-11-28 03:16:01,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:01,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994726690] [2019-11-28 03:16:01,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:01,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994726690] [2019-11-28 03:16:01,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401339066] [2019-11-28 03:16:01,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:01,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 03:16:01,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:01,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:01,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 03:16:01,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055525543] [2019-11-28 03:16:01,196 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:01,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2019-11-28 03:16:01,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:01,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573532549] [2019-11-28 03:16:01,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:01,221 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:01,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:01,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:16:01,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:16:01,250 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-11-28 03:16:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:01,281 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-28 03:16:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:16:01,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-28 03:16:01,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:01,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 03:16:01,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:01,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:01,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-11-28 03:16:01,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:01,286 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 03:16:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-11-28 03:16:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-28 03:16:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 03:16:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-28 03:16:01,290 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 03:16:01,290 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 03:16:01,291 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:16:01,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-28 03:16:01,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:01,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:01,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:01,294 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 03:16:01,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:01,295 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 211#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 212#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 218#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 219#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 220#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 221#L27-3 assume !(main_~j~0 < 10); 216#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 217#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 214#L42-3 [2019-11-28 03:16:01,296 INFO L796 eck$LassoCheckResult]: Loop: 214#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 215#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 214#L42-3 [2019-11-28 03:16:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash -367607132, now seen corresponding path program 2 times [2019-11-28 03:16:01,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:01,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429466276] [2019-11-28 03:16:01,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:01,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429466276] [2019-11-28 03:16:01,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216815480] [2019-11-28 03:16:01,390 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:01,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:16:01,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:16:01,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:16:01,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:01,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:01,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 03:16:01,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712144147] [2019-11-28 03:16:01,483 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:01,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2019-11-28 03:16:01,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:01,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050444309] [2019-11-28 03:16:01,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:01,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:01,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:01,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:16:01,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:16:01,519 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-28 03:16:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:01,555 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-11-28 03:16:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:16:01,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2019-11-28 03:16:01,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:01,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 03:16:01,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:01,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:01,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2019-11-28 03:16:01,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:01,559 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 03:16:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2019-11-28 03:16:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-28 03:16:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 03:16:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-28 03:16:01,564 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 03:16:01,564 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 03:16:01,564 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:16:01,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-28 03:16:01,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:01,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:01,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:01,567 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2019-11-28 03:16:01,567 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:01,567 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~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 270#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 276#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 277#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 278#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 279#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 281#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 280#L27-3 assume !(main_~j~0 < 10); 272#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 273#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 274#L42-3 [2019-11-28 03:16:01,567 INFO L796 eck$LassoCheckResult]: Loop: 274#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 275#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 274#L42-3 [2019-11-28 03:16:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479198, now seen corresponding path program 3 times [2019-11-28 03:16:01,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:01,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463413871] [2019-11-28 03:16:01,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:01,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463413871] [2019-11-28 03:16:01,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557591350] [2019-11-28 03:16:01,662 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:01,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 03:16:01,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:16:01,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:16:01,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:01,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:01,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 03:16:01,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169309186] [2019-11-28 03:16:01,796 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2019-11-28 03:16:01,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:01,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187286126] [2019-11-28 03:16:01,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:01,805 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:01,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:16:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:16:01,827 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-28 03:16:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:01,865 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-11-28 03:16:01,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:16:01,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-11-28 03:16:01,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:01,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-11-28 03:16:01,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:01,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:01,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-11-28 03:16:01,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:01,868 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-28 03:16:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-11-28 03:16:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-28 03:16:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:16:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-28 03:16:01,870 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-28 03:16:01,870 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-28 03:16:01,870 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:16:01,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-28 03:16:01,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:01,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:01,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:01,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2019-11-28 03:16:01,873 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:01,873 INFO L794 eck$LassoCheckResult]: Stem: 340#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 338#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 339#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 345#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 346#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 347#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 348#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 352#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 351#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 350#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 349#L27-3 assume !(main_~j~0 < 10); 341#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 342#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 343#L42-3 [2019-11-28 03:16:01,873 INFO L796 eck$LassoCheckResult]: Loop: 343#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 344#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 343#L42-3 [2019-11-28 03:16:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 4 times [2019-11-28 03:16:01,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:01,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498387111] [2019-11-28 03:16:01,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:01,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498387111] [2019-11-28 03:16:01,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930999471] [2019-11-28 03:16:01,954 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:02,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 03:16:02,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:16:02,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:16:02,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:02,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:02,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 03:16:02,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969008237] [2019-11-28 03:16:02,638 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:02,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 5 times [2019-11-28 03:16:02,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:02,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863868125] [2019-11-28 03:16:02,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:02,647 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:02,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:02,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:16:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:16:02,672 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-11-28 03:16:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:02,721 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-11-28 03:16:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:16:02,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2019-11-28 03:16:02,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:02,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2019-11-28 03:16:02,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:02,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:02,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2019-11-28 03:16:02,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:02,724 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-28 03:16:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2019-11-28 03:16:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 03:16:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:16:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 03:16:02,727 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 03:16:02,727 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 03:16:02,727 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:16:02,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-28 03:16:02,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:02,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:02,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:02,728 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2019-11-28 03:16:02,728 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:02,728 INFO L794 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 418#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 419#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 425#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 426#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 427#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 428#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 434#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 433#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 432#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 431#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 430#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 429#L27-3 assume !(main_~j~0 < 10); 423#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 424#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 421#L42-3 [2019-11-28 03:16:02,729 INFO L796 eck$LassoCheckResult]: Loop: 421#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 422#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 421#L42-3 [2019-11-28 03:16:02,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904350, now seen corresponding path program 5 times [2019-11-28 03:16:02,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:02,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935867052] [2019-11-28 03:16:02,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:02,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935867052] [2019-11-28 03:16:02,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829621030] [2019-11-28 03:16:02,809 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:03,899 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 03:16:03,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:16:03,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:16:03,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:03,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:03,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-28 03:16:03,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391674689] [2019-11-28 03:16:03,923 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 6 times [2019-11-28 03:16:03,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:03,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890233988] [2019-11-28 03:16:03,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:03,930 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:03,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:03,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 03:16:03,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 03:16:03,960 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-11-28 03:16:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:04,006 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-11-28 03:16:04,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 03:16:04,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2019-11-28 03:16:04,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:04,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 03:16:04,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:04,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:04,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-11-28 03:16:04,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:04,011 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 03:16:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-11-28 03:16:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-28 03:16:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:16:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-28 03:16:04,014 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-28 03:16:04,014 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-28 03:16:04,014 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:16:04,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-11-28 03:16:04,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:04,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:04,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:04,016 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2019-11-28 03:16:04,016 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:04,016 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 509#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 510#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 516#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 517#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 518#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 519#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 527#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 526#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 525#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 524#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 523#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 522#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 521#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 520#L27-3 assume !(main_~j~0 < 10); 512#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 513#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 514#L42-3 [2019-11-28 03:16:04,017 INFO L796 eck$LassoCheckResult]: Loop: 514#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 515#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 514#L42-3 [2019-11-28 03:16:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295068, now seen corresponding path program 6 times [2019-11-28 03:16:04,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:04,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857253094] [2019-11-28 03:16:04,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:04,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857253094] [2019-11-28 03:16:04,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630671130] [2019-11-28 03:16:04,111 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-11-28 03:16:05,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 03:16:05,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:16:05,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:16:05,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:05,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:05,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-28 03:16:05,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342424187] [2019-11-28 03:16:05,350 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:05,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 7 times [2019-11-28 03:16:05,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:05,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001312671] [2019-11-28 03:16:05,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:05,358 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:05,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 03:16:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:16:05,391 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-11-28 03:16:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:05,443 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-28 03:16:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:16:05,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-11-28 03:16:05,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:05,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2019-11-28 03:16:05,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:05,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:05,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2019-11-28 03:16:05,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:05,451 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-28 03:16:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2019-11-28 03:16:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-28 03:16:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 03:16:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-28 03:16:05,453 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-28 03:16:05,453 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-28 03:16:05,453 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:16:05,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-11-28 03:16:05,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:05,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:05,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:05,455 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2019-11-28 03:16:05,455 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:05,455 INFO L794 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 611#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 612#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 618#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 619#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 620#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 621#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 631#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 630#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 629#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 628#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 627#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 626#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 625#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 624#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 623#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 622#L27-3 assume !(main_~j~0 < 10); 616#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 617#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 614#L42-3 [2019-11-28 03:16:05,456 INFO L796 eck$LassoCheckResult]: Loop: 614#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 615#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 614#L42-3 [2019-11-28 03:16:05,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:05,456 INFO L82 PathProgramCache]: Analyzing trace with hash 72219098, now seen corresponding path program 7 times [2019-11-28 03:16:05,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:05,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23117195] [2019-11-28 03:16:05,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:05,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23117195] [2019-11-28 03:16:05,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795719] [2019-11-28 03:16:05,572 INFO L92 rtionOrderModulation]: Changing assertion order to 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 [2019-11-28 03:16:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:05,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:16:05,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:05,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:05,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-28 03:16:05,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448602598] [2019-11-28 03:16:05,672 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:05,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:05,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 8 times [2019-11-28 03:16:05,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:05,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504254849] [2019-11-28 03:16:05,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:05,683 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:05,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 03:16:05,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 03:16:05,721 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-11-28 03:16:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:05,779 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 03:16:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:16:05,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2019-11-28 03:16:05,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:05,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2019-11-28 03:16:05,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:05,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:05,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2019-11-28 03:16:05,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:05,782 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-28 03:16:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2019-11-28 03:16:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-28 03:16:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:16:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 03:16:05,787 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 03:16:05,787 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 03:16:05,787 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:16:05,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-11-28 03:16:05,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:05,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:05,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:05,790 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2019-11-28 03:16:05,790 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:05,791 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 724#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 725#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 731#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 732#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 733#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 734#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 746#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 745#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 744#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 743#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 742#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 741#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 740#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 739#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 738#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 737#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 736#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 735#L27-3 assume !(main_~j~0 < 10); 727#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 728#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 729#L42-3 [2019-11-28 03:16:05,791 INFO L796 eck$LassoCheckResult]: Loop: 729#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 730#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 729#L42-3 [2019-11-28 03:16:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash 684732824, now seen corresponding path program 8 times [2019-11-28 03:16:05,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:05,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431540918] [2019-11-28 03:16:05,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:05,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431540918] [2019-11-28 03:16:05,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119989741] [2019-11-28 03:16:05,901 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-28 03:16:05,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:16:05,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:16:05,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:16:05,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:06,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:06,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-28 03:16:06,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518123355] [2019-11-28 03:16:06,013 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 9 times [2019-11-28 03:16:06,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:06,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244089675] [2019-11-28 03:16:06,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:06,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:06,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 03:16:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 03:16:06,046 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-11-28 03:16:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:06,105 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-11-28 03:16:06,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 03:16:06,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2019-11-28 03:16:06,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:06,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 03:16:06,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:06,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:06,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2019-11-28 03:16:06,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:06,109 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 03:16:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2019-11-28 03:16:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-28 03:16:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 03:16:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-28 03:16:06,112 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-28 03:16:06,112 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-28 03:16:06,112 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:16:06,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-11-28 03:16:06,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:06,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:06,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:06,116 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1] [2019-11-28 03:16:06,116 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:06,117 INFO L794 eck$LassoCheckResult]: Stem: 850#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 848#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 849#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 855#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 856#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 857#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 858#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 872#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 871#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 870#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 869#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 868#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 867#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 866#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 865#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 864#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 863#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 862#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 861#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 860#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 859#L27-3 assume !(main_~j~0 < 10); 851#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 852#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 853#L42-3 [2019-11-28 03:16:06,117 INFO L796 eck$LassoCheckResult]: Loop: 853#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 854#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 853#L42-3 [2019-11-28 03:16:06,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:06,118 INFO L82 PathProgramCache]: Analyzing trace with hash 899903958, now seen corresponding path program 9 times [2019-11-28 03:16:06,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:06,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864432200] [2019-11-28 03:16:06,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:06,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864432200] [2019-11-28 03:16:06,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643733367] [2019-11-28 03:16:06,248 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-11-28 03:16:08,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 03:16:08,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:16:08,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:16:08,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:08,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:08,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-28 03:16:08,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473774123] [2019-11-28 03:16:08,613 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:08,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 10 times [2019-11-28 03:16:08,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:08,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570172713] [2019-11-28 03:16:08,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:08,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:08,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:08,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 03:16:08,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-28 03:16:08,678 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-11-28 03:16:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:08,745 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 03:16:08,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 03:16:08,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2019-11-28 03:16:08,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:08,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 03:16:08,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 03:16:08,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 03:16:08,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2019-11-28 03:16:08,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:08,749 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 03:16:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2019-11-28 03:16:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 03:16:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 03:16:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 03:16:08,752 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 03:16:08,752 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 03:16:08,752 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:16:08,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-11-28 03:16:08,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:16:08,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:16:08,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:16:08,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2019-11-28 03:16:08,755 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:16:08,755 INFO L794 eck$LassoCheckResult]: Stem: 984#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 982#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~post5, main_~j~0, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13, main_#t~pre15, main_#t~mem14, main_#t~ret16, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 983#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 989#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 990#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 991#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 992#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1008#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1007#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1006#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1005#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1004#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1003#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1002#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1001#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1000#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 999#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 998#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 997#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 996#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 995#L27-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet6;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 994#L27-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 993#L27-3 assume !(main_~j~0 < 10); 985#L27-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_#t~mem7.base, main_#t~mem7.offset + 4 * main_~i~0, 4);call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem9.base, main_#t~mem9.offset + 4 * main_~i~0;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem9.base, main_#t~mem9.offset;call main_#t~mem10 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 986#L40 assume main_#t~mem10 > 0;havoc main_#t~mem10;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_#t~mem11.base, main_#t~mem11.offset, 4);call main_#t~mem13 := read~int(main_#t~mem12.base, main_#t~mem12.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem13 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13;havoc main_#t~mem11.base, main_#t~mem11.offset; 987#L42-3 [2019-11-28 03:16:08,755 INFO L796 eck$LassoCheckResult]: Loop: 987#L42-3 call main_#t~mem14 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 988#L42-1 assume !!(main_~i~0 < main_#t~mem14);havoc main_#t~mem14;main_#t~pre15 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre15; 987#L42-3 [2019-11-28 03:16:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 10 times [2019-11-28 03:16:08,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:08,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022155648] [2019-11-28 03:16:08,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:16:09,851 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2019-11-28 03:16:10,137 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-28 03:16:10,646 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 73 [2019-11-28 03:16:11,103 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 77 [2019-11-28 03:16:11,882 WARN L192 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 81 [2019-11-28 03:16:12,563 WARN L192 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 86 [2019-11-28 03:16:13,368 WARN L192 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 77 [2019-11-28 03:16:14,141 WARN L192 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 73 [2019-11-28 03:16:14,709 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 73 [2019-11-28 03:16:15,401 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 74 [2019-11-28 03:16:16,060 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 77 [2019-11-28 03:16:16,776 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 75 [2019-11-28 03:16:17,364 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 79 [2019-11-28 03:16:17,776 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 59 [2019-11-28 03:16:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 56 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:17,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022155648] [2019-11-28 03:16:17,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861333607] [2019-11-28 03:16:17,851 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:16:21,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 03:16:21,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:16:21,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-28 03:16:21,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:16:21,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-28 03:16:21,878 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:21,881 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:21,881 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:21,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 03:16:21,893 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_56|], 28=[|v_#valid_81|]} [2019-11-28 03:16:21,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-11-28 03:16:21,912 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:21,958 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:21,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:21,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:22,008 INFO L343 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2019-11-28 03:16:22,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 54 [2019-11-28 03:16:22,010 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:22,085 INFO L588 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-11-28 03:16:22,086 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:22,086 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:66 [2019-11-28 03:16:22,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-28 03:16:22,248 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:22,285 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:22,286 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:22,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:77 [2019-11-28 03:16:22,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-28 03:16:22,491 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:22,537 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:22,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:22,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 03:16:22,548 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:22,586 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:22,586 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:22,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:86 [2019-11-28 03:16:22,855 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_32|], 6=[|v_#memory_$Pointer$.base_41|]} [2019-11-28 03:16:22,857 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:22,914 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:22,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:22,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:22,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:22,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2019-11-28 03:16:22,926 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:22,975 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:22,976 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:22,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:95 [2019-11-28 03:16:23,250 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_33|], 12=[|v_#memory_$Pointer$.base_42|]} [2019-11-28 03:16:23,253 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:23,310 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:23,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2019-11-28 03:16:23,328 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:23,394 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:23,396 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:23,396 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:104 [2019-11-28 03:16:23,671 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_34|], 20=[|v_#memory_$Pointer$.base_43|]} [2019-11-28 03:16:23,674 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:23,740 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:23,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:23,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2019-11-28 03:16:23,764 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:23,844 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:23,845 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:23,845 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:143, output treesize:116 [2019-11-28 03:16:24,143 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_35|], 30=[|v_#memory_$Pointer$.base_44|]} [2019-11-28 03:16:24,146 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:24,240 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:24,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2019-11-28 03:16:24,265 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:24,323 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:24,324 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:24,324 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:149, output treesize:122 [2019-11-28 03:16:24,646 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_36|], 42=[|v_#memory_$Pointer$.base_45|]} [2019-11-28 03:16:24,648 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:24,726 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:24,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:24,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 98 [2019-11-28 03:16:24,764 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:24,824 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:24,825 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:24,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:161, output treesize:134 [2019-11-28 03:16:25,183 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_37|], 56=[|v_#memory_$Pointer$.base_46|]} [2019-11-28 03:16:25,191 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:25,278 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:25,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:25,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 107 [2019-11-28 03:16:25,323 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:25,400 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:25,401 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:25,402 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:167, output treesize:140 [2019-11-28 03:16:25,815 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_38|], 72=[|v_#memory_$Pointer$.base_47|]} [2019-11-28 03:16:25,819 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:25,990 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 03:16:25,991 INFO L588 ElimStorePlain]: treesize reduction 3, result has 98.4 percent of original size [2019-11-28 03:16:25,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 122 [2019-11-28 03:16:26,044 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:26,121 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:26,121 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:16:26,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:182, output treesize:152 [2019-11-28 03:16:26,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:26,895 INFO L237 Elim1Store]: Index analysis took 192 ms [2019-11-28 03:16:26,951 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:26,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 171 [2019-11-28 03:16:26,953 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:27,743 WARN L192 SmtUtils]: Spent 788.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-11-28 03:16:27,743 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:27,748 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|, |v_#memory_$Pointer$.offset_30|], 2=[|v_#memory_int_40|, |v_#memory_int_41|, |#memory_int|], 6=[|v_#memory_$Pointer$.base_39|], 90=[|v_#memory_$Pointer$.base_48|]} [2019-11-28 03:16:27,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:27,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2019-11-28 03:16:27,820 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:28,542 WARN L192 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-11-28 03:16:28,542 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:28,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:28,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:28,571 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:16:28,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 29 [2019-11-28 03:16:28,596 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:29,065 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-28 03:16:29,065 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:29,075 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:29,614 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-28 03:16:29,614 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:29,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:29,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:29,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 25 [2019-11-28 03:16:29,652 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:29,990 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-28 03:16:29,991 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:30,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 10 [2019-11-28 03:16:30,010 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:30,346 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-28 03:16:30,347 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:30,350 INFO L508 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:30,694 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-28 03:16:30,694 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:30,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:16:30,971 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-28 03:16:30,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:16:30,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 432 [2019-11-28 03:16:30,975 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-28 03:16:31,326 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 108 [2019-11-28 03:16:31,327 INFO L588 ElimStorePlain]: treesize reduction 277, result has 45.9 percent of original size [2019-11-28 03:16:31,329 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 03:16:31,329 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:417, output treesize:324 [2019-11-28 03:16:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:16:31,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:16:31,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 40 [2019-11-28 03:16:31,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732840464] [2019-11-28 03:16:31,603 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:16:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:16:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 11 times [2019-11-28 03:16:31,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:16:31,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84905393] [2019-11-28 03:16:31,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:16:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:16:31,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:16:31,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:16:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-28 03:16:31,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2019-11-28 03:16:31,633 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 42 states. [2019-11-28 03:16:32,721 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 82 [2019-11-28 03:16:33,785 WARN L192 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-28 03:16:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:16:33,788 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-28 03:16:33,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 03:16:33,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 25 transitions. [2019-11-28 03:16:33,789 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:16:33,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-11-28 03:16:33,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:16:33,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:16:33,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:16:33,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:16:33,791 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:16:33,791 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:16:33,791 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:16:33,791 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 03:16:33,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:16:33,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:16:33,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:16:33,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:16:33 BoogieIcfgContainer [2019-11-28 03:16:33,799 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:16:33,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:16:33,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:16:33,800 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:16:33,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:57" (3/4) ... [2019-11-28 03:16:33,804 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:16:33,804 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:16:33,806 INFO L168 Benchmark]: Toolchain (without parser) took 36839.71 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 437.8 MB). Free memory was 955.0 MB in the beginning and 949.0 MB in the end (delta: 6.0 MB). Peak memory consumption was 443.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:33,806 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:33,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:33,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:33,807 INFO L168 Benchmark]: Boogie Preprocessor took 46.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:33,808 INFO L168 Benchmark]: RCFGBuilder took 417.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:33,808 INFO L168 Benchmark]: BuchiAutomizer took 35949.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.5 MB). Free memory was 1.1 GB in the beginning and 949.0 MB in the end (delta: 150.3 MB). Peak memory consumption was 452.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:16:33,808 INFO L168 Benchmark]: Witness Printer took 4.83 ms. Allocated memory is still 1.5 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:16:33,810 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 417.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 35949.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.5 MB). Free memory was 1.1 GB in the beginning and 949.0 MB in the end (delta: 150.3 MB). Peak memory consumption was 452.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 ms. Allocated memory is still 1.5 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 * unknown-#length-unknown[dummies] + -8 * j and consists of 5 locations. 11 modules have a trivial ranking function, the largest among these consists of 42 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 35.8s and 13 iterations. TraceHistogramMax:10. Analysis of lassos took 32.7s. Construction of modules took 1.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 77 SDslu, 221 SDs, 0 SdLazy, 521 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital298 mio100 ax100 hnf100 lsp95 ukn38 mio100 lsp61 div100 bol100 ite100 ukn100 eq168 hnf65 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...