./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ace4aef293e19a259ba259e8c5434d0ef43394b5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:40:12,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:40:12,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:40:12,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:40:12,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:40:12,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:40:12,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:40:12,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:40:12,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:40:12,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:40:12,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:40:12,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:40:12,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:40:12,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:40:12,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:40:12,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:40:12,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:40:12,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:40:12,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:40:12,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:40:12,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:40:12,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:40:12,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:40:12,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:40:12,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:40:12,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:40:12,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:40:12,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:40:12,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:40:12,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:40:12,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:40:12,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:40:12,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:40:12,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:40:12,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:40:12,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:40:12,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:40:12,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:40:12,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:40:12,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:40:12,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:40:12,481 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:40:12,522 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:40:12,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:40:12,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:40:12,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:40:12,525 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:40:12,526 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:40:12,526 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:40:12,526 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:40:12,526 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:40:12,527 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:40:12,528 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:40:12,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:40:12,528 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:40:12,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:40:12,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:40:12,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:40:12,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:40:12,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:40:12,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:40:12,530 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:40:12,531 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:40:12,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:40:12,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:40:12,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:40:12,531 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:40:12,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:40:12,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:40:12,532 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:40:12,532 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:40:12,533 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:40:12,534 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ace4aef293e19a259ba259e8c5434d0ef43394b5 [2020-10-20 06:40:12,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:40:12,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:40:12,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:40:12,762 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:40:12,763 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:40:12,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2020-10-20 06:40:12,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41ca61ea/82e455c2de5a4552b3cca79c29e5a946/FLAGd8bde0817 [2020-10-20 06:40:13,362 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:40:13,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2020-10-20 06:40:13,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41ca61ea/82e455c2de5a4552b3cca79c29e5a946/FLAGd8bde0817 [2020-10-20 06:40:13,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41ca61ea/82e455c2de5a4552b3cca79c29e5a946 [2020-10-20 06:40:13,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:40:13,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:40:13,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:40:13,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:40:13,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:40:13,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:40:13" (1/1) ... [2020-10-20 06:40:13,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50be503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:13, skipping insertion in model container [2020-10-20 06:40:13,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:40:13" (1/1) ... [2020-10-20 06:40:13,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:40:13,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:40:14,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:40:14,162 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:40:14,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:40:14,282 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:40:14,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14 WrapperNode [2020-10-20 06:40:14,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:40:14,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:40:14,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:40:14,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:40:14,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... [2020-10-20 06:40:14,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... [2020-10-20 06:40:14,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:40:14,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:40:14,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:40:14,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:40:14,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... [2020-10-20 06:40:14,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... [2020-10-20 06:40:14,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... [2020-10-20 06:40:14,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... [2020-10-20 06:40:14,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... [2020-10-20 06:40:14,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... [2020-10-20 06:40:14,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... [2020-10-20 06:40:14,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:40:14,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:40:14,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:40:14,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:40:14,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:14,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:40:14,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:40:14,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:40:14,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:40:14,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:40:14,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:40:14,774 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:40:14,774 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-20 06:40:14,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:40:14 BoogieIcfgContainer [2020-10-20 06:40:14,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:40:14,776 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:40:14,776 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:40:14,780 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:40:14,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:40:14,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:40:13" (1/3) ... [2020-10-20 06:40:14,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e18cb5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:40:14, skipping insertion in model container [2020-10-20 06:40:14,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:40:14,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:14" (2/3) ... [2020-10-20 06:40:14,783 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e18cb5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:40:14, skipping insertion in model container [2020-10-20 06:40:14,783 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:40:14,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:40:14" (3/3) ... [2020-10-20 06:40:14,785 INFO L373 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2020-10-20 06:40:14,835 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:40:14,835 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:40:14,835 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:40:14,835 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:40:14,836 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:40:14,836 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:40:14,836 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:40:14,836 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:40:14,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-10-20 06:40:14,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:14,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:14,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:14,877 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:40:14,877 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:14,877 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:40:14,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-10-20 06:40:14,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:14,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:14,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:14,879 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:40:14,879 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:14,888 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 11#L552-3true [2020-10-20 06:40:14,888 INFO L796 eck$LassoCheckResult]: Loop: 11#L552-3true goto; 5#L554-1true call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 8#L552-1true assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 12#L554true assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 11#L552-3true [2020-10-20 06:40:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:40:14,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:14,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464654410] [2020-10-20 06:40:14,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,180 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2020-10-20 06:40:15,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:15,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938829335] [2020-10-20 06:40:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,263 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2020-10-20 06:40:15,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:15,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127195766] [2020-10-20 06:40:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:15,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127195766] [2020-10-20 06:40:15,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:40:15,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:40:15,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345288358] [2020-10-20 06:40:15,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:15,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:40:15,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:40:15,577 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2020-10-20 06:40:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:15,617 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-10-20 06:40:15,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:40:15,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2020-10-20 06:40:15,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:15,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 11 transitions. [2020-10-20 06:40:15,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 06:40:15,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 06:40:15,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-10-20 06:40:15,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:40:15,630 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-10-20 06:40:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-10-20 06:40:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-10-20 06:40:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-20 06:40:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-10-20 06:40:15,658 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-10-20 06:40:15,658 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-10-20 06:40:15,659 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:40:15,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-10-20 06:40:15,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:15,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:15,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:15,660 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:40:15,660 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:40:15,660 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 40#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 41#L552-3 goto; 42#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 43#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 45#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 46#L554-1 [2020-10-20 06:40:15,661 INFO L796 eck$LassoCheckResult]: Loop: 46#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 49#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 47#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 46#L554-1 [2020-10-20 06:40:15,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:15,661 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2020-10-20 06:40:15,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:15,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783642121] [2020-10-20 06:40:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,700 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2020-10-20 06:40:15,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:15,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306042508] [2020-10-20 06:40:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,736 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2020-10-20 06:40:15,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:15,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735955831] [2020-10-20 06:40:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:15,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:15,820 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:16,123 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2020-10-20 06:40:16,210 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:40:16,211 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:40:16,211 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:40:16,211 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:40:16,212 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:40:16,212 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:16,212 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:40:16,212 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:40:16,213 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2020-10-20 06:40:16,213 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:40:16,213 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:40:16,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,492 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-10-20 06:40:16,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:16,836 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:40:16,841 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:16,848 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:16,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:16,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:16,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:16,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:16,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:16,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:16,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:16,859 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) [2020-10-20 06:40:16,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:16,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:16,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:16,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:16,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:16,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:16,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:16,917 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 [2020-10-20 06:40:16,920 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) [2020-10-20 06:40:16,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:16,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:16,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:16,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:16,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:16,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:16,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:16,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:16,971 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) [2020-10-20 06:40:17,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:17,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:17,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:17,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:17,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:17,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:17,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:17,104 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) [2020-10-20 06:40:17,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:17,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:17,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:17,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:17,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:17,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:17,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:17,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:17,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:17,205 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) [2020-10-20 06:40:17,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:17,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:17,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:17,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:17,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:17,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:17,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:17,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:17,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:17,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:17,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:17,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:17,347 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 [2020-10-20 06:40:17,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:17,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:17,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:17,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:17,436 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:17,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:17,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:17,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:17,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:17,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:17,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:17,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:17,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:17,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:17,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:17,505 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:40:17,521 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-20 06:40:17,521 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:17,530 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:40:17,535 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:40:17,535 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:40:17,536 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 19 Supporting invariants [] [2020-10-20 06:40:17,658 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-10-20 06:40:17,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:40:17,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:17,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:17,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:17,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:40:17,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:17,849 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2020-10-20 06:40:17,850 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:17,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:17,858 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:17,858 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:17,874 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:40:17,875 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-10-20 06:40:17,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 17 states and 20 transitions. Complement of second has 6 states. [2020-10-20 06:40:17,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:40:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-20 06:40:17,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2020-10-20 06:40:17,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:17,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2020-10-20 06:40:17,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:17,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2020-10-20 06:40:17,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:17,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2020-10-20 06:40:17,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:17,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2020-10-20 06:40:17,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:17,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-20 06:40:17,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2020-10-20 06:40:17,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:17,946 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-20 06:40:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2020-10-20 06:40:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-10-20 06:40:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 06:40:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-10-20 06:40:17,948 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-20 06:40:17,949 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-20 06:40:17,949 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:40:17,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-10-20 06:40:17,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:17,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:17,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:17,950 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-10-20 06:40:17,950 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:17,951 INFO L794 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 149#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 150#L552-3 goto; 164#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 163#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 162#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 161#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 152#L552-1 [2020-10-20 06:40:17,951 INFO L796 eck$LassoCheckResult]: Loop: 152#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 156#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 158#L552-3 goto; 151#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 152#L552-1 [2020-10-20 06:40:17,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:17,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2020-10-20 06:40:17,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:17,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77325691] [2020-10-20 06:40:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:17,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:17,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:17,978 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:17,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2020-10-20 06:40:17,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:17,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535489038] [2020-10-20 06:40:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:17,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:17,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:17,998 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2020-10-20 06:40:17,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:17,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51899515] [2020-10-20 06:40:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:18,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51899515] [2020-10-20 06:40:18,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263075414] [2020-10-20 06:40:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:40:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:18,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:40:18,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:18,138 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:18,146 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:18,159 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:18,160 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,167 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:18,170 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:18,171 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:18,234 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:18,235 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:18,245 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:18,246 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:18,296 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-10-20 06:40:18,298 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:18,304 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,305 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-10-20 06:40:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:18,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:18,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-20 06:40:18,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125230106] [2020-10-20 06:40:18,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:18,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:40:18,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:40:18,389 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-10-20 06:40:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:18,456 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-10-20 06:40:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:40:18,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-10-20 06:40:18,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:18,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 20 transitions. [2020-10-20 06:40:18,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:18,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:18,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2020-10-20 06:40:18,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:18,462 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 06:40:18,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2020-10-20 06:40:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-20 06:40:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 06:40:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-10-20 06:40:18,465 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 06:40:18,465 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 06:40:18,465 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:40:18,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-10-20 06:40:18,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:18,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:18,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:18,467 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2020-10-20 06:40:18,467 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:18,468 INFO L794 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 229#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 230#L552-3 goto; 246#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 236#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 237#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 245#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 244#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 242#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 243#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 232#L552-1 [2020-10-20 06:40:18,468 INFO L796 eck$LassoCheckResult]: Loop: 232#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 241#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 239#L552-3 goto; 231#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 232#L552-1 [2020-10-20 06:40:18,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:18,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751228, now seen corresponding path program 4 times [2020-10-20 06:40:18,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:18,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878429784] [2020-10-20 06:40:18,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:18,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:18,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:18,498 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:18,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2020-10-20 06:40:18,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:18,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302765612] [2020-10-20 06:40:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:18,506 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:18,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:18,515 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:18,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:18,516 INFO L82 PathProgramCache]: Analyzing trace with hash 112465226, now seen corresponding path program 2 times [2020-10-20 06:40:18,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:18,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507106661] [2020-10-20 06:40:18,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:18,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507106661] [2020-10-20 06:40:18,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777058705] [2020-10-20 06:40:18,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:40:18,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:40:18,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:40:18,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:40:18,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:18,643 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:18,644 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:18,655 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:18,655 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:18,664 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:18,664 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:18,712 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:18,714 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:18,722 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:18,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:18,755 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:18,757 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:18,764 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:18,765 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:18,800 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-10-20 06:40:18,802 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:18,807 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:18,808 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-10-20 06:40:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:18,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:18,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-10-20 06:40:18,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565231782] [2020-10-20 06:40:18,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:40:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:40:18,880 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-10-20 06:40:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:18,984 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-10-20 06:40:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:40:18,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-10-20 06:40:18,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:18,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2020-10-20 06:40:18,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:18,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:18,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-10-20 06:40:18,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:18,987 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-10-20 06:40:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-10-20 06:40:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-20 06:40:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 06:40:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-10-20 06:40:18,990 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-10-20 06:40:18,990 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-10-20 06:40:18,990 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:40:18,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2020-10-20 06:40:18,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:18,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:18,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:18,992 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2020-10-20 06:40:18,992 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:18,992 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 327#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 328#L552-3 goto; 347#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 346#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 345#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 329#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 330#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 336#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 331#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 332#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 344#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 342#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 334#L552-1 [2020-10-20 06:40:18,992 INFO L796 eck$LassoCheckResult]: Loop: 334#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 335#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 337#L552-3 goto; 338#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 334#L552-1 [2020-10-20 06:40:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:18,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1381845472, now seen corresponding path program 5 times [2020-10-20 06:40:18,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:18,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716693995] [2020-10-20 06:40:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:19,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:19,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:19,024 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:19,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:19,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2020-10-20 06:40:19,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:19,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841457650] [2020-10-20 06:40:19,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:19,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:19,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:19,043 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash 320887590, now seen corresponding path program 3 times [2020-10-20 06:40:19,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:19,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138939396] [2020-10-20 06:40:19,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:19,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138939396] [2020-10-20 06:40:19,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085479944] [2020-10-20 06:40:19,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2020-10-20 06:40:19,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-20 06:40:19,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:40:19,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 06:40:19,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:19,277 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-10-20 06:40:19,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:19,278 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:19,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:19,305 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:19,305 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-10-20 06:40:19,351 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:19,351 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 [2020-10-20 06:40:19,353 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:19,381 INFO L625 ElimStorePlain]: treesize reduction 38, result has 42.4 percent of original size [2020-10-20 06:40:19,382 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:19,383 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:24 [2020-10-20 06:40:19,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:40:19,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:40:19,469 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:19,470 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 [2020-10-20 06:40:19,472 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:19,480 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:19,481 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:19,519 INFO L625 ElimStorePlain]: treesize reduction 49, result has 41.0 percent of original size [2020-10-20 06:40:19,520 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-10-20 06:40:19,520 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:34 [2020-10-20 06:40:19,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:19,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:40:19,571 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:19,572 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:19,618 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:19,618 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 61 [2020-10-20 06:40:19,620 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:19,651 INFO L625 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2020-10-20 06:40:19,652 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-10-20 06:40:19,653 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:32 [2020-10-20 06:40:19,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:19,706 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-10-20 06:40:19,707 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:19,717 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:19,717 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2020-10-20 06:40:19,718 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:19,744 INFO L625 ElimStorePlain]: treesize reduction 17, result has 29.2 percent of original size [2020-10-20 06:40:19,744 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:19,745 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:7 [2020-10-20 06:40:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:19,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:19,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-10-20 06:40:19,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765055764] [2020-10-20 06:40:19,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:19,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:40:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:40:19,837 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-10-20 06:40:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:20,039 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-10-20 06:40:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:40:20,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-10-20 06:40:20,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:20,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2020-10-20 06:40:20,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:20,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:20,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2020-10-20 06:40:20,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:20,043 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 06:40:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2020-10-20 06:40:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-20 06:40:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 06:40:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-10-20 06:40:20,046 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 06:40:20,046 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 06:40:20,046 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:40:20,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-10-20 06:40:20,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:20,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:20,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:20,048 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2020-10-20 06:40:20,048 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:20,048 INFO L794 eck$LassoCheckResult]: Stem: 451#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 445#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 446#L552-3 goto; 467#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 466#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 464#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 447#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 448#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 468#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 449#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 450#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 454#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 463#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 465#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 459#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 460#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 452#L552-1 [2020-10-20 06:40:20,049 INFO L796 eck$LassoCheckResult]: Loop: 452#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 453#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 455#L552-3 goto; 456#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 452#L552-1 [2020-10-20 06:40:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:20,049 INFO L82 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 6 times [2020-10-20 06:40:20,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:20,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459605228] [2020-10-20 06:40:20,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:20,063 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:20,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:20,079 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 5 times [2020-10-20 06:40:20,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:20,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631825137] [2020-10-20 06:40:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:20,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:20,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:20,090 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 4 times [2020-10-20 06:40:20,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:20,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495101162] [2020-10-20 06:40:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:20,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495101162] [2020-10-20 06:40:20,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970482174] [2020-10-20 06:40:20,156 INFO L93 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 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 [2020-10-20 06:40:20,230 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:40:20,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:40:20,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 06:40:20,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:20,248 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:40:20,257 INFO L350 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2020-10-20 06:40:20,257 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:20,257 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,268 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,270 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:20,270 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2020-10-20 06:40:20,294 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:20,294 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,301 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,301 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2020-10-20 06:40:20,316 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:20,317 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,323 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,323 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2020-10-20 06:40:20,340 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:20,341 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,347 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,347 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2020-10-20 06:40:20,366 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:20,367 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,373 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,373 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:14 [2020-10-20 06:40:20,397 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-10-20 06:40:20,397 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,405 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,405 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2020-10-20 06:40:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:20,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:20,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-20 06:40:20,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549705598] [2020-10-20 06:40:20,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:20,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:40:20,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:40:20,479 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-10-20 06:40:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:20,657 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-10-20 06:40:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:40:20,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2020-10-20 06:40:20,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:20,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2020-10-20 06:40:20,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:20,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:20,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2020-10-20 06:40:20,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:20,661 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-10-20 06:40:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2020-10-20 06:40:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-20 06:40:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 06:40:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-10-20 06:40:20,664 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-10-20 06:40:20,665 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-10-20 06:40:20,665 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:40:20,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2020-10-20 06:40:20,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:20,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:20,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:20,667 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2020-10-20 06:40:20,667 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:20,667 INFO L794 eck$LassoCheckResult]: Stem: 587#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 581#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 582#L552-3 goto; 591#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 599#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 606#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 583#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 584#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 595#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 585#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 586#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 590#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 605#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 604#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 603#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 602#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 601#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 600#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 597#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 588#L552-1 [2020-10-20 06:40:20,667 INFO L796 eck$LassoCheckResult]: Loop: 588#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 589#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 594#L552-3 goto; 607#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 588#L552-1 [2020-10-20 06:40:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash -866483296, now seen corresponding path program 7 times [2020-10-20 06:40:20,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:20,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942272200] [2020-10-20 06:40:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:20,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:20,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:20,701 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 6 times [2020-10-20 06:40:20,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:20,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497055849] [2020-10-20 06:40:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:20,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:20,709 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:20,711 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:20,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:20,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1312123046, now seen corresponding path program 5 times [2020-10-20 06:40:20,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:20,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330919646] [2020-10-20 06:40:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:20,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330919646] [2020-10-20 06:40:20,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842220709] [2020-10-20 06:40:20,787 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-10-20 06:40:20,867 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-10-20 06:40:20,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:40:20,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 06:40:20,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:20,885 INFO L350 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2020-10-20 06:40:20,886 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:20,886 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,892 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:20,892 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2020-10-20 06:40:20,916 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:20,916 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,921 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,921 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2020-10-20 06:40:20,935 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:20,935 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,939 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,940 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,940 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2020-10-20 06:40:20,966 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:20,967 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,972 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,972 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2020-10-20 06:40:20,988 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:20,989 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:20,994 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:20,994 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2020-10-20 06:40:21,011 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-20 06:40:21,012 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,017 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,017 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2020-10-20 06:40:21,048 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-10-20 06:40:21,049 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,054 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,054 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2020-10-20 06:40:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:21,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:21,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-10-20 06:40:21,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428472611] [2020-10-20 06:40:21,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 06:40:21,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-20 06:40:21,122 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand 15 states. [2020-10-20 06:40:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:21,318 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-10-20 06:40:21,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 06:40:21,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2020-10-20 06:40:21,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:21,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2020-10-20 06:40:21,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:21,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:21,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2020-10-20 06:40:21,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:21,323 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-10-20 06:40:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2020-10-20 06:40:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-10-20 06:40:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 06:40:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-10-20 06:40:21,329 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-10-20 06:40:21,329 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-10-20 06:40:21,329 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:40:21,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2020-10-20 06:40:21,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:21,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:21,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:21,334 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2020-10-20 06:40:21,335 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:21,335 INFO L794 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 736#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 737#L552-3 goto; 746#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 753#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 754#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 738#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 739#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 745#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 740#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 741#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 765#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 764#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 763#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 762#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 761#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 760#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 759#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 758#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 756#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 755#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 751#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 743#L552-1 [2020-10-20 06:40:21,335 INFO L796 eck$LassoCheckResult]: Loop: 743#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 744#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 749#L552-3 goto; 757#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 743#L552-1 [2020-10-20 06:40:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:21,336 INFO L82 PathProgramCache]: Analyzing trace with hash -650410172, now seen corresponding path program 8 times [2020-10-20 06:40:21,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:21,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103533897] [2020-10-20 06:40:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:21,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:21,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:21,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:21,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:21,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 7 times [2020-10-20 06:40:21,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:21,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339635580] [2020-10-20 06:40:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:21,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:21,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:21,414 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:21,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash 904133194, now seen corresponding path program 6 times [2020-10-20 06:40:21,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:21,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367641657] [2020-10-20 06:40:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:21,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367641657] [2020-10-20 06:40:21,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955038239] [2020-10-20 06:40:21,503 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2020-10-20 06:40:21,602 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2020-10-20 06:40:21,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:40:21,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 06:40:21,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:21,617 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:21,618 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,633 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:21,634 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,640 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:21,641 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:21,666 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:21,667 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,674 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:21,674 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:21,700 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:21,700 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,706 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:21,708 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:21,733 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:21,734 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,740 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:21,741 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:21,774 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:21,775 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,783 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:21,783 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:21,812 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:21,813 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,820 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:21,820 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:21,850 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:21,851 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,857 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:21,858 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:21,904 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-10-20 06:40:21,906 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:21,911 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:21,911 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-10-20 06:40:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:21,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:21,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-10-20 06:40:21,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391660677] [2020-10-20 06:40:21,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:21,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 06:40:21,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-10-20 06:40:21,996 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand 17 states. [2020-10-20 06:40:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:22,263 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-10-20 06:40:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 06:40:22,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2020-10-20 06:40:22,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:22,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2020-10-20 06:40:22,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:22,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:22,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2020-10-20 06:40:22,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:22,266 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-10-20 06:40:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2020-10-20 06:40:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-10-20 06:40:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-20 06:40:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-10-20 06:40:22,269 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-10-20 06:40:22,269 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-10-20 06:40:22,269 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:40:22,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2020-10-20 06:40:22,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:22,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:22,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:22,271 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2020-10-20 06:40:22,271 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:22,271 INFO L794 eck$LassoCheckResult]: Stem: 916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 910#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 911#L552-3 goto; 920#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 927#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 928#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 912#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 913#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 919#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 914#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 915#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 942#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 941#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 940#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 939#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 938#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 937#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 936#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 935#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 934#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 933#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 932#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 930#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 929#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 925#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 917#L552-1 [2020-10-20 06:40:22,272 INFO L796 eck$LassoCheckResult]: Loop: 917#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 918#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 923#L552-3 goto; 931#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 917#L552-1 [2020-10-20 06:40:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1771949792, now seen corresponding path program 9 times [2020-10-20 06:40:22,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:22,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206547629] [2020-10-20 06:40:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:22,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:22,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:22,339 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 8 times [2020-10-20 06:40:22,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:22,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327257902] [2020-10-20 06:40:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:22,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:22,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:22,352 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1235899942, now seen corresponding path program 7 times [2020-10-20 06:40:22,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:22,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686738838] [2020-10-20 06:40:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:22,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686738838] [2020-10-20 06:40:22,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75180407] [2020-10-20 06:40:22,485 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2020-10-20 06:40:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:22,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 06:40:22,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:22,582 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:22,583 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,595 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:22,596 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,603 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:22,603 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:22,635 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:22,636 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,644 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,645 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:22,645 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:22,673 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:22,674 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,682 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:22,682 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:22,734 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:22,735 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,741 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:22,741 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:22,768 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:22,769 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,775 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:22,776 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:22,804 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:22,805 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,813 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:22,813 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:22,847 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:22,848 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,853 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,854 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:22,854 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:22,895 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:22,896 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,901 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,902 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:22,902 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:22,940 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-10-20 06:40:22,941 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:22,946 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:22,946 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-10-20 06:40:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:22,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:22,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2020-10-20 06:40:22,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758571184] [2020-10-20 06:40:23,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-20 06:40:23,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-10-20 06:40:23,031 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand 19 states. [2020-10-20 06:40:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:23,444 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-10-20 06:40:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-20 06:40:23,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2020-10-20 06:40:23,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:23,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2020-10-20 06:40:23,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:23,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:23,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2020-10-20 06:40:23,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:23,448 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-10-20 06:40:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2020-10-20 06:40:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-20 06:40:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 06:40:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-10-20 06:40:23,452 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-10-20 06:40:23,452 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-10-20 06:40:23,452 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:40:23,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2020-10-20 06:40:23,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:23,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:23,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:23,454 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2020-10-20 06:40:23,454 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:23,454 INFO L794 eck$LassoCheckResult]: Stem: 1109#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1103#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1104#L552-3 goto; 1113#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1120#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1121#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1105#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1106#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1112#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1107#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1108#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1138#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1137#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1136#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1135#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1134#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1133#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1132#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1131#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1130#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1129#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1128#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1127#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1126#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1125#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1123#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1122#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1118#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1110#L552-1 [2020-10-20 06:40:23,454 INFO L796 eck$LassoCheckResult]: Loop: 1110#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1111#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1116#L552-3 goto; 1124#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1110#L552-1 [2020-10-20 06:40:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1286793668, now seen corresponding path program 10 times [2020-10-20 06:40:23,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:23,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133544219] [2020-10-20 06:40:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:23,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:23,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:23,485 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:23,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:23,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 9 times [2020-10-20 06:40:23,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:23,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661091680] [2020-10-20 06:40:23,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:23,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:23,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:23,494 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2115625782, now seen corresponding path program 8 times [2020-10-20 06:40:23,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:23,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006471959] [2020-10-20 06:40:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:23,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006471959] [2020-10-20 06:40:23,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967379618] [2020-10-20 06:40:23,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:40:23,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:40:23,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:40:23,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 06:40:23,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:23,699 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:23,700 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:23,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:23,708 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:23,709 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:23,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:23,715 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:23,715 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:23,744 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:23,745 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:23,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:23,753 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:23,753 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:23,777 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:23,778 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:23,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:23,789 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:23,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:23,813 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:23,814 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:23,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:23,821 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:23,821 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:23,860 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:23,861 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:23,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:23,878 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:23,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:23,928 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:23,929 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:23,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:23,936 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:23,936 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:23,973 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:23,974 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:23,980 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:23,981 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:23,981 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:24,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:24,016 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:24,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:24,025 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:24,025 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:24,057 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:24,058 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:24,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:24,067 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:24,067 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:24,103 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-10-20 06:40:24,104 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:24,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:24,109 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:24,109 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-10-20 06:40:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:24,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:24,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-10-20 06:40:24,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427460253] [2020-10-20 06:40:24,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:24,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-20 06:40:24,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2020-10-20 06:40:24,187 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 21 states. [2020-10-20 06:40:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:24,611 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-10-20 06:40:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-20 06:40:24,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2020-10-20 06:40:24,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:24,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2020-10-20 06:40:24,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:24,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:24,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2020-10-20 06:40:24,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:24,617 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-10-20 06:40:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2020-10-20 06:40:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-20 06:40:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 06:40:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-10-20 06:40:24,625 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-10-20 06:40:24,625 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-10-20 06:40:24,625 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:40:24,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2020-10-20 06:40:24,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:24,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:24,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:24,630 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2020-10-20 06:40:24,631 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:24,632 INFO L794 eck$LassoCheckResult]: Stem: 1321#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1315#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1316#L552-3 goto; 1325#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1332#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1333#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1317#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1318#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1324#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1319#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1320#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1353#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1352#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1351#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1350#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1349#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1348#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1347#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1346#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1345#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1344#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1343#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1342#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1341#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1340#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1339#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1338#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1337#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1335#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1334#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1330#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1322#L552-1 [2020-10-20 06:40:24,633 INFO L796 eck$LassoCheckResult]: Loop: 1322#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1323#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1328#L552-3 goto; 1336#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1322#L552-1 [2020-10-20 06:40:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2007908704, now seen corresponding path program 11 times [2020-10-20 06:40:24,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:24,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247560099] [2020-10-20 06:40:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:24,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:24,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:24,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:24,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 10 times [2020-10-20 06:40:24,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:24,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398093648] [2020-10-20 06:40:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:24,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:24,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:24,697 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1981227942, now seen corresponding path program 9 times [2020-10-20 06:40:24,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:24,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301018264] [2020-10-20 06:40:24,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:25,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301018264] [2020-10-20 06:40:25,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552839532] [2020-10-20 06:40:25,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:40:25,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2020-10-20 06:40:25,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:40:25,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 06:40:25,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:25,175 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:25,176 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,186 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:25,186 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,191 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,192 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,192 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:25,215 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:25,216 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,223 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,224 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:25,252 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:25,253 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,259 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,260 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:25,283 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:25,284 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,290 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,290 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:25,317 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:25,318 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,327 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,327 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:25,354 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:25,355 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,362 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:25,394 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:25,395 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,401 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,403 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:25,458 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:25,459 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,465 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,465 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:25,494 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:25,495 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,501 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,501 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:25,533 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:25,533 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,539 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,540 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:25,541 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:25,574 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-10-20 06:40:25,575 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:25,580 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:25,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-10-20 06:40:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:25,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:25,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2020-10-20 06:40:25,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194267262] [2020-10-20 06:40:25,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:25,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-20 06:40:25,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2020-10-20 06:40:25,660 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand 23 states. [2020-10-20 06:40:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:26,243 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-10-20 06:40:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-20 06:40:26,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2020-10-20 06:40:26,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:26,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2020-10-20 06:40:26,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:26,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:26,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2020-10-20 06:40:26,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:26,247 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-10-20 06:40:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2020-10-20 06:40:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-20 06:40:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-20 06:40:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-10-20 06:40:26,251 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-10-20 06:40:26,251 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-10-20 06:40:26,251 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:40:26,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2020-10-20 06:40:26,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:26,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:26,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:26,253 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2020-10-20 06:40:26,253 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:26,253 INFO L794 eck$LassoCheckResult]: Stem: 1552#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1546#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1547#L552-3 goto; 1556#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1563#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1564#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1548#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1549#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1555#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1550#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1551#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1587#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1586#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1585#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1584#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1583#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1582#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1581#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1580#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1579#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1578#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1577#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1576#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1575#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1574#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1573#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1572#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1571#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1570#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1569#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1568#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1566#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1565#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1561#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1553#L552-1 [2020-10-20 06:40:26,253 INFO L796 eck$LassoCheckResult]: Loop: 1553#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1554#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1559#L552-3 goto; 1567#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1553#L552-1 [2020-10-20 06:40:26,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 12 times [2020-10-20 06:40:26,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:26,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085537779] [2020-10-20 06:40:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:26,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:26,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:26,288 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:26,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 11 times [2020-10-20 06:40:26,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:26,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519684010] [2020-10-20 06:40:26,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:26,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:26,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:26,296 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 10 times [2020-10-20 06:40:26,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:26,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753301335] [2020-10-20 06:40:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:26,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:26,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:26,331 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:37,033 WARN L193 SmtUtils]: Spent 10.65 s on a formula simplification. DAG size of input: 204 DAG size of output: 166 [2020-10-20 06:40:37,107 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:40:37,108 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:40:37,108 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:40:37,108 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:40:37,108 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:40:37,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:37,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:40:37,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:40:37,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration12_Lasso [2020-10-20 06:40:37,109 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:40:37,109 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:40:37,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,278 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-10-20 06:40:37,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:37,747 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:40:37,748 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:37,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:37,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:37,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:37,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:37,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:37,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:37,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:37,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:37,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:37,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:37,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:37,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:37,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:37,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:37,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:37,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:37,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:37,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:37,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:37,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:37,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:37,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:37,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:37,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:37,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:37,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:37,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:37,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:37,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:37,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:37,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:37,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:37,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:37,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:37,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:37,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:37,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:37,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:37,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:37,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:37,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:37,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:37,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:37,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:37,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:37,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:37,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:37,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:37,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:37,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:37,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:37,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:37,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:37,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:37,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:37,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:37,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:37,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:37,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:38,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:38,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:38,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:38,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:38,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:38,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:38,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:38,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:38,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:38,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:38,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:38,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:38,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:38,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:38,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:38,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:38,084 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:38,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:38,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:38,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:38,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:38,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:38,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:38,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:38,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:38,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:38,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:38,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:38,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:38,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:38,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:38,152 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:40:38,177 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-20 06:40:38,177 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:38,179 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:40:38,181 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 06:40:38,182 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:40:38,182 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem4) = -41*ULTIMATE.start_main_#t~mem4 + 790 Supporting invariants [-40*ULTIMATE.start_main_#t~mem4 + 41*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 >= 0] [2020-10-20 06:40:38,242 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2020-10-20 06:40:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:38,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 06:40:38,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:38,334 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:38,335 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,344 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,349 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:38,349 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,357 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,357 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:38,392 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,393 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,401 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,403 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:38,435 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,436 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,445 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,445 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:38,479 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,479 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,487 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,487 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:38,533 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,534 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,541 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,542 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,542 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:38,630 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,631 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,640 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,641 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:38,697 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,698 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,712 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,712 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:38,764 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,765 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,774 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,774 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:38,819 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,819 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,827 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,828 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,829 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:38,874 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,875 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,883 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,883 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:38,926 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:38,927 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:38,935 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:38,936 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:38,936 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:38,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:40:38,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:39,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2020-10-20 06:40:39,016 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:39,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:39,032 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:39,032 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2020-10-20 06:40:39,114 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:39,114 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 71 [2020-10-20 06:40:39,148 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:40:39,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:40:39,168 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:40:39,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:40:39,188 INFO L545 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:39,296 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-20 06:40:39,297 INFO L625 ElimStorePlain]: treesize reduction 20, result has 83.7 percent of original size [2020-10-20 06:40:39,303 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-20 06:40:39,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,315 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-20 06:40:39,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,322 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-20 06:40:39,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,333 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:39,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:103 [2020-10-20 06:40:39,341 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-20 06:40:39,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,357 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-20 06:40:39,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,364 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-20 06:40:39,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:39,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-20 06:40:39,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:40:39,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:40:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:41,986 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 4 loop predicates [2020-10-20 06:40:41,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 16 states. [2020-10-20 06:40:42,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 16 states. Result 43 states and 45 transitions. Complement of second has 6 states. [2020-10-20 06:40:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 06:40:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-10-20 06:40:42,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2020-10-20 06:40:42,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:42,068 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:40:42,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:42,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 06:40:42,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:42,162 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:42,163 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,177 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:42,177 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,185 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,186 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,187 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:42,223 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,224 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,239 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,240 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:42,273 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,274 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,289 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,290 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:42,331 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,332 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,342 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,342 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:42,394 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,395 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,411 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,411 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:42,462 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,463 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,473 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,474 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,475 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:42,526 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,527 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,540 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,541 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,542 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:42,590 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,590 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,599 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,600 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:42,648 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,649 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,659 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:42,703 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,704 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,713 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,714 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:42,762 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:42,763 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,772 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:42,772 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:42,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:40:42,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:42,837 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2020-10-20 06:40:42,838 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,847 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,848 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:42,848 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2020-10-20 06:40:42,921 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:42,921 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 71 [2020-10-20 06:40:42,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:40:42,934 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-20 06:40:42,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:40:42,941 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-20 06:40:42,944 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,033 INFO L625 ElimStorePlain]: treesize reduction 20, result has 79.8 percent of original size [2020-10-20 06:40:43,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:43,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-10-20 06:40:43,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:40:43,043 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,043 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:105 [2020-10-20 06:40:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:43,142 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2020-10-20 06:40:43,143 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2020-10-20 06:40:43,232 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 43 states and 45 transitions. Complement of second has 6 states. [2020-10-20 06:40:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 06:40:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-10-20 06:40:43,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2020-10-20 06:40:43,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:43,237 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:40:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:43,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 06:40:43,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:43,309 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:43,310 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,323 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:43,323 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,332 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,333 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:43,364 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,364 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,373 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,374 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:43,408 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,409 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,417 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,418 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,419 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:43,454 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,455 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,464 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,465 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:43,512 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,513 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,521 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,521 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:43,562 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,562 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,570 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,571 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:43,617 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,617 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,626 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,626 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:43,687 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,687 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,697 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:43,742 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,743 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,755 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,756 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,757 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2020-10-20 06:40:43,801 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,801 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,810 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,811 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,811 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:43,859 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:43,860 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,873 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,874 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:43,874 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2020-10-20 06:40:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:43,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:40:43,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:43,935 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2020-10-20 06:40:43,935 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:43,945 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:43,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2020-10-20 06:40:44,007 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:44,008 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 71 [2020-10-20 06:40:44,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 06:40:44,017 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:40:44,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 06:40:44,021 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:40:44,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 06:40:44,026 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:40:44,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 06:40:44,030 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:40:44,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 06:40:44,035 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:40:44,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 06:40:44,038 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:40:44,040 INFO L545 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:44,133 INFO L625 ElimStorePlain]: treesize reduction 20, result has 83.7 percent of original size [2020-10-20 06:40:44,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:44,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-10-20 06:40:44,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:40:44,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:44,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:40:44,143 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:44,144 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:105 [2020-10-20 06:40:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:44,231 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2020-10-20 06:40:44,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2020-10-20 06:40:44,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 69 states and 75 transitions. Complement of second has 49 states. [2020-10-20 06:40:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2020-10-20 06:40:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 06:40:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2020-10-20 06:40:44,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 4 letters. [2020-10-20 06:40:44,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:44,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 38 letters. Loop has 4 letters. [2020-10-20 06:40:44,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:44,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 8 letters. [2020-10-20 06:40:44,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:44,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2020-10-20 06:40:44,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:44,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 49 states and 53 transitions. [2020-10-20 06:40:44,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:40:44,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:44,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2020-10-20 06:40:44,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:44,803 INFO L691 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-10-20 06:40:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2020-10-20 06:40:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-10-20 06:40:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 06:40:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2020-10-20 06:40:44,806 INFO L714 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-10-20 06:40:44,806 INFO L594 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2020-10-20 06:40:44,806 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 06:40:44,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2020-10-20 06:40:44,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:44,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:44,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:44,808 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 1, 1, 1] [2020-10-20 06:40:44,808 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:44,808 INFO L794 eck$LassoCheckResult]: Stem: 2282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2276#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 2277#L552-3 goto; 2300#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2283#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2284#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2278#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2279#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2322#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2280#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2281#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2285#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2291#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2321#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2320#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2319#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2318#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2317#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2316#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2315#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2314#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2313#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2312#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2311#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2310#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2309#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2308#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2307#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2306#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2305#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2304#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2303#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2302#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2289#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2296#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2297#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2294#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2293#L552-1 [2020-10-20 06:40:44,809 INFO L796 eck$LassoCheckResult]: Loop: 2293#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2290#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 2286#L552-3 goto; 2287#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2293#L552-1 [2020-10-20 06:40:44,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:44,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1287728160, now seen corresponding path program 13 times [2020-10-20 06:40:44,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:44,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470884789] [2020-10-20 06:40:44,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 146 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:44,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470884789] [2020-10-20 06:40:44,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215484225] [2020-10-20 06:40:44,977 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:40:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:45,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 06:40:45,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:45,045 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:40:45,047 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,056 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-20 06:40:45,056 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,068 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,068 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:45,104 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,105 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,111 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,112 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,113 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:45,161 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,161 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,173 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,173 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:45,213 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,214 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,227 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,227 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:45,268 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,269 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,277 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,277 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:45,330 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,331 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,339 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,340 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,340 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:45,397 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,398 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,411 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,411 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:45,467 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,468 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,479 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,479 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:45,542 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,543 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,552 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,553 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,553 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2020-10-20 06:40:45,619 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,620 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,630 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,631 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,631 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:45,702 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-10-20 06:40:45,703 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,715 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:40:45,715 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-10-20 06:40:45,791 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-10-20 06:40:45,798 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:45,806 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:45,806 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2020-10-20 06:40:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:45,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:40:45,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2020-10-20 06:40:45,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372313869] [2020-10-20 06:40:45,843 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:40:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 12 times [2020-10-20 06:40:45,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:45,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167381371] [2020-10-20 06:40:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:45,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:45,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:45,854 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:45,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:45,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-20 06:40:45,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2020-10-20 06:40:45,966 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. cyclomatic complexity: 6 Second operand 25 states. [2020-10-20 06:40:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:46,537 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-10-20 06:40:46,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 06:40:46,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2020-10-20 06:40:46,539 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:40:46,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2020-10-20 06:40:46,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:40:46,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:40:46,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:40:46,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:40:46,539 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:46,539 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:46,540 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:46,540 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 06:40:46,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:40:46,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:40:46,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:40:46,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:40:46 BoogieIcfgContainer [2020-10-20 06:40:46,548 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:40:46,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:40:46,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:40:46,549 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:40:46,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:40:14" (3/4) ... [2020-10-20 06:40:46,554 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:40:46,554 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:40:46,556 INFO L168 Benchmark]: Toolchain (without parser) took 32864.79 ms. Allocated memory was 34.6 MB in the beginning and 138.4 MB in the end (delta: 103.8 MB). Free memory was 10.2 MB in the beginning and 58.1 MB in the end (delta: -47.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:46,556 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 33.6 MB. Free memory is still 18.4 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:40:46,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.35 ms. Allocated memory was 34.6 MB in the beginning and 41.9 MB in the end (delta: 7.3 MB). Free memory was 9.4 MB in the beginning and 15.0 MB in the end (delta: -5.6 MB). Peak memory consumption was 7.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:46,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.14 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 15.0 MB in the beginning and 25.6 MB in the end (delta: -10.6 MB). Peak memory consumption was 3.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:46,557 INFO L168 Benchmark]: Boogie Preprocessor took 28.13 ms. Allocated memory is still 42.5 MB. Free memory was 25.4 MB in the beginning and 24.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:46,557 INFO L168 Benchmark]: RCFGBuilder took 391.81 ms. Allocated memory was 42.5 MB in the beginning and 43.5 MB in the end (delta: 1.0 MB). Free memory was 24.0 MB in the beginning and 24.1 MB in the end (delta: -121.7 kB). Peak memory consumption was 13.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:46,558 INFO L168 Benchmark]: BuchiAutomizer took 31772.16 ms. Allocated memory was 43.5 MB in the beginning and 138.4 MB in the end (delta: 94.9 MB). Free memory was 24.1 MB in the beginning and 58.1 MB in the end (delta: -34.0 MB). Peak memory consumption was 60.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:46,558 INFO L168 Benchmark]: Witness Printer took 5.64 ms. Allocated memory is still 138.4 MB. Free memory is still 58.1 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:40:46,561 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 33.6 MB. Free memory is still 18.4 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 587.35 ms. Allocated memory was 34.6 MB in the beginning and 41.9 MB in the end (delta: 7.3 MB). Free memory was 9.4 MB in the beginning and 15.0 MB in the end (delta: -5.6 MB). Peak memory consumption was 7.5 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 71.14 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 15.0 MB in the beginning and 25.6 MB in the end (delta: -10.6 MB). Peak memory consumption was 3.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 28.13 ms. Allocated memory is still 42.5 MB. Free memory was 25.4 MB in the beginning and 24.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 391.81 ms. Allocated memory was 42.5 MB in the beginning and 43.5 MB in the end (delta: 1.0 MB). Free memory was 24.0 MB in the beginning and 24.1 MB in the end (delta: -121.7 kB). Peak memory consumption was 13.9 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 31772.16 ms. Allocated memory was 43.5 MB in the beginning and 138.4 MB in the end (delta: 94.9 MB). Free memory was 24.1 MB in the beginning and 58.1 MB in the end (delta: -34.0 MB). Peak memory consumption was 60.9 MB. Max. memory is 14.3 GB. * Witness Printer took 5.64 ms. Allocated memory is still 138.4 MB. Free memory is still 58.1 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 19 and consists of 4 locations. One nondeterministic module has affine ranking function -41 * aux-i-aux + 790 and consists of 16 locations. 11 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.7s and 14 iterations. TraceHistogramMax:12. Analysis of lassos took 21.6s. Construction of modules took 2.2s. Büchi inclusion checks took 7.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 12. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 67 SDslu, 496 SDs, 0 SdLazy, 2285 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital240 mio100 ax107 hnf99 lsp90 ukn45 mio100 lsp38 div100 bol100 ite100 ukn100 eq192 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms 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...