./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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.25-f470102 [2019-11-28 20:48:24,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:48:24,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:48:24,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:48:24,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:48:24,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:48:24,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:48:24,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:48:24,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:48:24,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:48:24,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:48:24,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:48:24,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:48:24,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:48:24,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:48:24,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:48:24,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:48:24,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:48:24,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:48:24,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:48:24,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:48:24,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:48:24,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:48:24,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:48:24,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:48:24,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:48:24,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:48:24,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:48:24,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:48:24,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:48:24,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:48:24,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:48:24,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:48:24,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:48:24,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:48:24,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:48:24,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:48:24,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:48:24,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:48:24,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:48:24,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:48:24,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:48:24,926 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:48:24,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:48:24,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:48:24,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:48:24,928 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:48:24,929 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:48:24,929 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:48:24,929 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:48:24,929 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:48:24,929 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:48:24,931 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:48:24,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:48:24,931 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:48:24,932 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:48:24,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:48:24,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:48:24,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:48:24,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:48:24,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:48:24,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:48:24,933 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:48:24,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:48:24,934 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:48:24,934 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:48:24,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:48:24,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:48:24,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:48:24,935 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:48:24,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:48:24,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:48:24,935 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:48:24,937 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:48:24,938 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:48:24,938 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 20:48:25,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:48:25,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:48:25,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:48:25,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:48:25,297 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:48:25,298 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 20:48:25,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8ad7c94/8c58de2504ee4199a1504bce749b3478/FLAG04689f09c [2019-11-28 20:48:25,849 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:48:25,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2019-11-28 20:48:25,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8ad7c94/8c58de2504ee4199a1504bce749b3478/FLAG04689f09c [2019-11-28 20:48:26,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8ad7c94/8c58de2504ee4199a1504bce749b3478 [2019-11-28 20:48:26,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:48:26,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:48:26,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:26,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:48:26,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:48:26,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245e5474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26, skipping insertion in model container [2019-11-28 20:48:26,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:48:26,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:48:26,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:26,456 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:48:26,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:48:26,490 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:48:26,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26 WrapperNode [2019-11-28 20:48:26,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:48:26,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:26,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:48:26,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:48:26,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:48:26,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:48:26,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:48:26,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:48:26,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... [2019-11-28 20:48:26,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:48:26,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:48:26,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:48:26,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:48:26,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:26,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:48:26,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:48:26,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:48:26,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:48:26,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:48:26,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:48:26,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:48:26,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:48:27,132 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:48:27,133 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:48:27,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:27 BoogieIcfgContainer [2019-11-28 20:48:27,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:48:27,135 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:48:27,135 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:48:27,139 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:48:27,140 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:27,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:48:26" (1/3) ... [2019-11-28 20:48:27,142 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a724271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:27, skipping insertion in model container [2019-11-28 20:48:27,142 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:27,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:48:26" (2/3) ... [2019-11-28 20:48:27,144 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a724271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:48:27, skipping insertion in model container [2019-11-28 20:48:27,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:48:27,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:27" (3/3) ... [2019-11-28 20:48:27,146 INFO L371 chiAutomizerObserver]: Analyzing ICFG test27-2.c [2019-11-28 20:48:27,201 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:48:27,202 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:48:27,202 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:48:27,202 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:48:27,202 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:48:27,202 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:48:27,202 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:48:27,202 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:48:27,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 20:48:27,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 20:48:27,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:27,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:27,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:27,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:27,239 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:48:27,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 20:48:27,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 20:48:27,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:27,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:27,242 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:48:27,242 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:27,249 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 20:48:27,249 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 20:48:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:48:27,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:27,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012553616] [2019-11-28 20:48:27,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:27,398 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-28 20:48:27,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:27,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819352730] [2019-11-28 20:48:27,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:27,448 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-28 20:48:27,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:27,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482304551] [2019-11-28 20:48:27,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:27,538 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:27,657 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-28 20:48:27,712 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:27,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:27,817 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:27,906 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:27,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:27,909 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:178 [2019-11-28 20:48:28,229 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-28 20:48:28,337 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:48:28,338 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:48:28,338 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:48:28,338 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:48:28,339 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:48:28,339 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:28,339 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:48:28,339 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:48:28,340 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-2.c_Iteration1_Lasso [2019-11-28 20:48:28,340 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:48:28,340 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:48:28,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,571 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-28 20:48:28,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:28,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:48:29,047 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:48:29,054 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 20:48:29,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:29,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,079 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 20:48:29,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:29,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:29,086 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 20:48:29,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:29,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:29,109 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 20:48:29,116 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 20:48:29,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:29,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:29,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:29,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:29,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:29,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:29,164 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 20:48:29,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:29,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:29,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:29,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:29,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:29,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:29,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:29,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:29,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:29,228 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 20:48:29,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:29,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:29,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe 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 20:48:29,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:29,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:29,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:29,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:29,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:29,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:29,328 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 20:48:29,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:48:29,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:48:29,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:48:29,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:29,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:29,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:29,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:48:29,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:48:29,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:29,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,386 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 20:48:29,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:48:29,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:48:29,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:48:29,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:48:29,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:48:29,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:48:29,426 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:48:29,635 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-28 20:48:29,635 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 20:48:29,643 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:48:29,665 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:48:29,666 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:48:29,666 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 [] Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:48:29,720 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-28 20:48:29,729 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:48:29,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:29,783 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:48:29,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:29,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:48:29,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:29,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:48:29,838 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-28 20:48:29,969 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 20:48:29,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:48:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:48:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-11-28 20:48:29,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-28 20:48:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:48:29,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 20:48:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:48:29,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 20:48:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:48:29,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2019-11-28 20:48:29,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:29,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2019-11-28 20:48:29,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 20:48:29,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:29,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-28 20:48:29,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:29,987 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-28 20:48:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-28 20:48:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 20:48:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:48:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-11-28 20:48:30,012 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-28 20:48:30,012 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-28 20:48:30,013 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:48:30,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-11-28 20:48:30,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:30,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:30,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:30,014 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:48:30,014 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:30,015 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 144#L42-3 [2019-11-28 20:48:30,015 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 20:48:30,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:30,015 INFO L82 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2019-11-28 20:48:30,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:30,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208804536] [2019-11-28 20:48:30,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:48:30,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208804536] [2019-11-28 20:48:30,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:48:30,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:48:30,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707714309] [2019-11-28 20:48:30,083 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2019-11-28 20:48:30,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:30,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754792505] [2019-11-28 20:48:30,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:30,093 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:30,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:30,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:48:30,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:48:30,130 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-28 20:48:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:30,151 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-28 20:48:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:48:30,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-28 20:48:30,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:30,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 20:48:30,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:30,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:30,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-28 20:48:30,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:30,154 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 20:48:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-28 20:48:30,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-11-28 20:48:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:48:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 20:48:30,156 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:48:30,156 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:48:30,156 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:48:30,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-28 20:48:30,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:30,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:30,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:30,157 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:48:30,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:30,158 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 167#L42-3 [2019-11-28 20:48:30,158 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 20:48:30,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:30,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2019-11-28 20:48:30,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:30,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010194180] [2019-11-28 20:48:30,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:30,241 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 20:48:30,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010194180] [2019-11-28 20:48:30,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527658342] [2019-11-28 20:48:30,242 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 20:48:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:30,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:48:30,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:30,310 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 20:48:30,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:30,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 20:48:30,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709964261] [2019-11-28 20:48:30,312 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:30,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:30,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2019-11-28 20:48:30,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:30,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837253350] [2019-11-28 20:48:30,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:30,322 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:30,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:30,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:48:30,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:48:30,353 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-11-28 20:48:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:30,386 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-28 20:48:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:48:30,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-28 20:48:30,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:30,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 20:48:30,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:30,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:30,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-11-28 20:48:30,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:30,392 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 20:48:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-11-28 20:48:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-28 20:48:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 20:48:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-28 20:48:30,396 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 20:48:30,397 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 20:48:30,397 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:48:30,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-28 20:48:30,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:30,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:30,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:30,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:48:30,401 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:30,401 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 214#L42-3 [2019-11-28 20:48:30,402 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 20:48:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash -367607132, now seen corresponding path program 2 times [2019-11-28 20:48:30,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:30,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535191364] [2019-11-28 20:48:30,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:30,517 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 20:48:30,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535191364] [2019-11-28 20:48:30,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581051778] [2019-11-28 20:48:30,519 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 20:48:30,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:48:30,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:48:30,605 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:48:30,606 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:30,618 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 20:48:30,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:30,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 20:48:30,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194509624] [2019-11-28 20:48:30,619 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:30,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:30,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2019-11-28 20:48:30,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:30,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974626415] [2019-11-28 20:48:30,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:30,634 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:30,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:30,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:48:30,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:48:30,673 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-28 20:48:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:30,712 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-11-28 20:48:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:48:30,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2019-11-28 20:48:30,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:30,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 20:48:30,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:30,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:30,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2019-11-28 20:48:30,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:30,718 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 20:48:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2019-11-28 20:48:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-28 20:48:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:48:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-28 20:48:30,721 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 20:48:30,721 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 20:48:30,722 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:48:30,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-28 20:48:30,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:30,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:30,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:30,723 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2019-11-28 20:48:30,723 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:30,724 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 274#L42-3 [2019-11-28 20:48:30,724 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 20:48:30,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479198, now seen corresponding path program 3 times [2019-11-28 20:48:30,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:30,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229676138] [2019-11-28 20:48:30,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:30,837 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 20:48:30,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229676138] [2019-11-28 20:48:30,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15420326] [2019-11-28 20:48:30,838 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 20:48:30,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 20:48:30,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:48:30,982 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:48:30,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:30,995 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 20:48:30,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:30,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 20:48:30,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860304455] [2019-11-28 20:48:31,000 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:31,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:31,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2019-11-28 20:48:31,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:31,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323908463] [2019-11-28 20:48:31,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:31,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:31,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:31,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:48:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:48:31,044 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-28 20:48:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:31,075 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-11-28 20:48:31,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:48:31,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-11-28 20:48:31,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:31,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-11-28 20:48:31,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:31,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:31,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-11-28 20:48:31,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:31,078 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-28 20:48:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-11-28 20:48:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-28 20:48:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:48:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-28 20:48:31,080 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-28 20:48:31,080 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-28 20:48:31,080 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:48:31,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-28 20:48:31,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:31,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:31,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:31,081 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2019-11-28 20:48:31,081 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:31,082 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 343#L42-3 [2019-11-28 20:48:31,082 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 20:48:31,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:31,082 INFO L82 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 4 times [2019-11-28 20:48:31,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:31,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624643046] [2019-11-28 20:48:31,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:31,140 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 20:48:31,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624643046] [2019-11-28 20:48:31,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35665614] [2019-11-28 20:48:31,141 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 20:48:31,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:48:31,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:48:31,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:48:31,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:31,835 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 20:48:31,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:31,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-28 20:48:31,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929288518] [2019-11-28 20:48:31,837 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:31,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:31,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 5 times [2019-11-28 20:48:31,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:31,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526030501] [2019-11-28 20:48:31,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:31,846 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:31,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:31,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:48:31,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:48:31,872 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-11-28 20:48:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:31,916 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-11-28 20:48:31,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:48:31,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2019-11-28 20:48:31,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:31,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2019-11-28 20:48:31,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:31,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:31,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2019-11-28 20:48:31,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:31,920 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-28 20:48:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2019-11-28 20:48:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 20:48:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:48:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 20:48:31,923 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 20:48:31,923 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 20:48:31,923 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:48:31,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-28 20:48:31,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:31,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:31,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:31,926 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2019-11-28 20:48:31,926 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:31,926 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 421#L42-3 [2019-11-28 20:48:31,926 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 20:48:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:31,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904350, now seen corresponding path program 5 times [2019-11-28 20:48:31,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:31,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047794708] [2019-11-28 20:48:31,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:32,018 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 20:48:32,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047794708] [2019-11-28 20:48:32,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273684252] [2019-11-28 20:48:32,019 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 20:48:33,417 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 20:48:33,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:48:33,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:48:33,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:33,432 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 20:48:33,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:33,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-28 20:48:33,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511281236] [2019-11-28 20:48:33,433 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:33,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 6 times [2019-11-28 20:48:33,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:33,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539785098] [2019-11-28 20:48:33,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:33,443 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:33,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:48:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:48:33,473 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-11-28 20:48:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:33,522 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-11-28 20:48:33,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:48:33,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2019-11-28 20:48:33,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:33,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 20:48:33,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:33,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:33,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-11-28 20:48:33,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:33,529 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 20:48:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-11-28 20:48:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-28 20:48:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:48:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-28 20:48:33,533 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-28 20:48:33,533 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-28 20:48:33,534 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:48:33,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-11-28 20:48:33,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:33,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:33,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:33,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2019-11-28 20:48:33,538 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:33,538 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 514#L42-3 [2019-11-28 20:48:33,538 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 20:48:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295068, now seen corresponding path program 6 times [2019-11-28 20:48:33,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:33,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565565463] [2019-11-28 20:48:33,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:33,654 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 20:48:33,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565565463] [2019-11-28 20:48:33,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130398178] [2019-11-28 20:48:33,655 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 20:48:34,716 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 20:48:34,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:48:34,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:48:34,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:34,735 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 20:48:34,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:34,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-28 20:48:34,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38878223] [2019-11-28 20:48:34,737 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:34,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 7 times [2019-11-28 20:48:34,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:34,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944727712] [2019-11-28 20:48:34,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:34,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:34,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:34,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:48:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:48:34,782 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-11-28 20:48:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:34,836 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-28 20:48:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:48:34,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-11-28 20:48:34,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:34,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2019-11-28 20:48:34,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:34,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:34,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2019-11-28 20:48:34,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:34,840 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-28 20:48:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2019-11-28 20:48:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-28 20:48:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:48:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-28 20:48:34,842 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-28 20:48:34,842 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-28 20:48:34,843 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:48:34,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-11-28 20:48:34,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:34,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:34,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:34,845 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2019-11-28 20:48:34,845 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:34,845 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 614#L42-3 [2019-11-28 20:48:34,846 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 20:48:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:34,846 INFO L82 PathProgramCache]: Analyzing trace with hash 72219098, now seen corresponding path program 7 times [2019-11-28 20:48:34,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:34,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591725940] [2019-11-28 20:48:34,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:34,949 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 20:48:34,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591725940] [2019-11-28 20:48:34,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399279740] [2019-11-28 20:48:34,950 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 20:48:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:35,022 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:48:35,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:35,036 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 20:48:35,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:35,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-28 20:48:35,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904135685] [2019-11-28 20:48:35,037 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:35,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:35,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 8 times [2019-11-28 20:48:35,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:35,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085396163] [2019-11-28 20:48:35,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:35,045 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:35,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:35,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:48:35,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:48:35,070 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-11-28 20:48:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:35,126 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 20:48:35,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:48:35,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2019-11-28 20:48:35,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:35,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2019-11-28 20:48:35,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:35,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:35,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2019-11-28 20:48:35,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:35,130 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-28 20:48:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2019-11-28 20:48:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-28 20:48:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 20:48:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 20:48:35,133 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 20:48:35,133 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 20:48:35,133 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:48:35,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-11-28 20:48:35,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:35,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:35,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:35,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2019-11-28 20:48:35,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:35,136 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 729#L42-3 [2019-11-28 20:48:35,136 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 20:48:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash 684732824, now seen corresponding path program 8 times [2019-11-28 20:48:35,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:35,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671641652] [2019-11-28 20:48:35,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:35,250 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 20:48:35,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671641652] [2019-11-28 20:48:35,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894506207] [2019-11-28 20:48:35,251 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 20:48:35,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:48:35,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:48:35,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:48:35,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:35,377 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 20:48:35,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:35,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-28 20:48:35,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893424183] [2019-11-28 20:48:35,379 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 9 times [2019-11-28 20:48:35,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:35,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916951] [2019-11-28 20:48:35,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:35,388 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:35,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:35,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:48:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:48:35,423 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-11-28 20:48:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:35,508 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-11-28 20:48:35,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:48:35,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2019-11-28 20:48:35,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:35,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 20:48:35,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:35,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:35,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2019-11-28 20:48:35,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:35,513 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 20:48:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2019-11-28 20:48:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-28 20:48:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:48:35,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-28 20:48:35,516 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-28 20:48:35,516 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-28 20:48:35,517 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:48:35,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-11-28 20:48:35,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:35,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:35,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:35,519 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1] [2019-11-28 20:48:35,519 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:35,520 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 853#L42-3 [2019-11-28 20:48:35,520 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 20:48:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:35,521 INFO L82 PathProgramCache]: Analyzing trace with hash 899903958, now seen corresponding path program 9 times [2019-11-28 20:48:35,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:35,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176322420] [2019-11-28 20:48:35,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:35,654 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 20:48:35,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176322420] [2019-11-28 20:48:35,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995414511] [2019-11-28 20:48:35,655 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 20:48:38,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 20:48:38,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:48:38,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:48:38,178 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:38,197 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 20:48:38,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:48:38,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-28 20:48:38,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439550981] [2019-11-28 20:48:38,199 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:48:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 10 times [2019-11-28 20:48:38,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:38,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642130988] [2019-11-28 20:48:38,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:48:38,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:48:38,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:48:38,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:48:38,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:48:38,240 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-11-28 20:48:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:48:38,345 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 20:48:38,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:48:38,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2019-11-28 20:48:38,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:38,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 20:48:38,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:48:38,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:48:38,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2019-11-28 20:48:38,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:48:38,347 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 20:48:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2019-11-28 20:48:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 20:48:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:48:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 20:48:38,349 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 20:48:38,349 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 20:48:38,349 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 20:48:38,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-11-28 20:48:38,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:48:38,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:48:38,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:48:38,351 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2019-11-28 20:48:38,351 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:48:38,352 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~mem9.base, main_#t~mem9.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.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~mem11.base, main_#t~mem11.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13; 987#L42-3 [2019-11-28 20:48:38,352 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 20:48:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:48:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 10 times [2019-11-28 20:48:38,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:48:38,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963998808] [2019-11-28 20:48:38,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:48:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:48:39,534 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-11-28 20:48:39,697 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2019-11-28 20:48:40,004 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-28 20:48:40,522 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 73 [2019-11-28 20:48:40,966 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 77 [2019-11-28 20:48:41,803 WARN L192 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 81 [2019-11-28 20:48:42,481 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 86 [2019-11-28 20:48:43,307 WARN L192 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 77 [2019-11-28 20:48:44,092 WARN L192 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 73 [2019-11-28 20:48:44,660 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 73 [2019-11-28 20:48:45,326 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 74 [2019-11-28 20:48:46,015 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 77 [2019-11-28 20:48:46,747 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 75 [2019-11-28 20:48:47,341 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 79 [2019-11-28 20:48:47,777 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 59 [2019-11-28 20:48:47,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 20:48:47,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963998808] [2019-11-28 20:48:47,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747381285] [2019-11-28 20:48:47,852 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 20:48:52,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:48:52,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:48:52,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-28 20:48:52,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:48:52,037 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 20:48:52,038 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:52,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 20:48:52,048 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_56|], 28=[|v_#valid_81|]} [2019-11-28 20:48:52,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,068 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 20:48:52,068 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:52,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,171 INFO L343 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2019-11-28 20:48:52,172 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 20:48:52,173 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,245 INFO L614 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-11-28 20:48:52,246 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,246 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:66 [2019-11-28 20:48:52,418 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 20:48:52,420 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:52,450 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,450 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:77 [2019-11-28 20:48:52,630 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 20:48:52,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:52,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:52,682 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 20:48:52,683 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:52,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:52,722 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:86 [2019-11-28 20:48:52,940 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_32|], 6=[|v_#memory_$Pointer$.base_41|]} [2019-11-28 20:48:52,949 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:53,023 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:53,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,039 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 20:48:53,040 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:53,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:53,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:53,087 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:95 [2019-11-28 20:48:53,329 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_33|], 12=[|v_#memory_$Pointer$.base_42|]} [2019-11-28 20:48:53,332 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:53,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:53,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,424 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 20:48:53,425 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:53,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:53,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:53,495 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:104 [2019-11-28 20:48:53,808 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_34|], 20=[|v_#memory_$Pointer$.base_43|]} [2019-11-28 20:48:53,811 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:53,878 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:53,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:53,897 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 20:48:53,898 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:53,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:53,948 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:53,948 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:143, output treesize:116 [2019-11-28 20:48:54,232 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_35|], 30=[|v_#memory_$Pointer$.base_44|]} [2019-11-28 20:48:54,234 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:54,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:54,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,361 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 20:48:54,362 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:54,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:54,420 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:54,420 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:149, output treesize:122 [2019-11-28 20:48:54,726 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_36|], 42=[|v_#memory_$Pointer$.base_45|]} [2019-11-28 20:48:54,729 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:54,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:54,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:54,857 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 20:48:54,857 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:54,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:54,920 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:54,920 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:161, output treesize:134 [2019-11-28 20:48:55,266 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_37|], 56=[|v_#memory_$Pointer$.base_46|]} [2019-11-28 20:48:55,269 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:55,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:55,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:55,392 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 20:48:55,393 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:55,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:55,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:55,462 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:167, output treesize:140 [2019-11-28 20:48:55,854 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_38|], 72=[|v_#memory_$Pointer$.base_47|]} [2019-11-28 20:48:55,858 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:56,024 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 20:48:56,025 INFO L614 ElimStorePlain]: treesize reduction 3, result has 98.4 percent of original size [2019-11-28 20:48:56,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,075 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 20:48:56,076 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:56,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:56,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:48:56,153 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:182, output treesize:152 [2019-11-28 20:48:56,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:56,905 INFO L237 Elim1Store]: Index analysis took 191 ms [2019-11-28 20:48:56,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:56,957 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 20:48:56,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:57,707 WARN L192 SmtUtils]: Spent 748.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-11-28 20:48:57,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:57,714 INFO L430 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 20:48:57,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:57,784 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 20:48:57,784 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:58,480 WARN L192 SmtUtils]: Spent 695.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-11-28 20:48:58,480 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:58,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:58,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:58,508 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:48:58,534 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 20:48:58,534 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:58,983 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-28 20:48:58,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:58,994 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:48:59,512 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-28 20:48:59,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:59,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:59,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:48:59,543 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 20:48:59,544 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 20:48:59,854 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-28 20:48:59,855 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:48:59,877 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 20:48:59,877 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 20:49:00,187 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-28 20:49:00,188 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:49:00,192 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:49:00,519 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-28 20:49:00,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:49:00,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:49:00,789 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-28 20:49:00,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:49:00,790 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 20:49:00,792 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-28 20:49:01,117 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 108 [2019-11-28 20:49:01,118 INFO L614 ElimStorePlain]: treesize reduction 277, result has 45.9 percent of original size [2019-11-28 20:49:01,120 INFO L534 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 20:49:01,120 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:417, output treesize:324 [2019-11-28 20:49:01,368 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 20:49:01,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:49:01,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 40 [2019-11-28 20:49:01,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814285731] [2019-11-28 20:49:01,370 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:49:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:49:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 11 times [2019-11-28 20:49:01,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:49:01,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748381217] [2019-11-28 20:49:01,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:49:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:49:01,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:49:01,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:49:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-28 20:49:01,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2019-11-28 20:49:01,399 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 42 states. [2019-11-28 20:49:02,373 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 82 [2019-11-28 20:49:03,453 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-28 20:49:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:49:03,455 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-28 20:49:03,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 20:49:03,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 25 transitions. [2019-11-28 20:49:03,456 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:49:03,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-11-28 20:49:03,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:49:03,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:49:03,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:49:03,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:49:03,457 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:49:03,457 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:49:03,457 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:49:03,457 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 20:49:03,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:49:03,458 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:49:03,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:49:03,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:49:03 BoogieIcfgContainer [2019-11-28 20:49:03,465 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:49:03,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:49:03,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:49:03,466 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:49:03,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:48:27" (3/4) ... [2019-11-28 20:49:03,469 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:49:03,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:49:03,471 INFO L168 Benchmark]: Toolchain (without parser) took 37268.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 414.2 MB). Free memory was 960.4 MB in the beginning and 970.0 MB in the end (delta: -9.6 MB). Peak memory consumption was 404.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:03,472 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:49:03,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.18 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:03,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:03,473 INFO L168 Benchmark]: Boogie Preprocessor took 34.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:49:03,473 INFO L168 Benchmark]: RCFGBuilder took 504.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:03,474 INFO L168 Benchmark]: BuchiAutomizer took 36329.77 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 302.0 MB). Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 104.5 MB). Peak memory consumption was 406.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:49:03,474 INFO L168 Benchmark]: Witness Printer took 4.54 ms. Allocated memory is still 1.4 GB. Free memory is still 970.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:49:03,477 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.18 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 504.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 36329.77 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 302.0 MB). Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 104.5 MB). Peak memory consumption was 406.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.54 ms. Allocated memory is still 1.4 GB. Free memory is still 970.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 36.2s and 13 iterations. TraceHistogramMax:10. Analysis of lassos took 33.2s. 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: 19ms 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...