./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test27-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/test27-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2292364e3df3925555991c57490c078c89b959e0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 19:09:22,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 19:09:22,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 19:09:22,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 19:09:22,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 19:09:22,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 19:09:22,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 19:09:22,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 19:09:22,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 19:09:22,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 19:09:22,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 19:09:22,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 19:09:22,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 19:09:22,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 19:09:22,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 19:09:22,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 19:09:22,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 19:09:22,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 19:09:22,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 19:09:22,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 19:09:22,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 19:09:22,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 19:09:22,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 19:09:22,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 19:09:22,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 19:09:22,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 19:09:22,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 19:09:22,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 19:09:22,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 19:09:22,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 19:09:22,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 19:09:22,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 19:09:22,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 19:09:22,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 19:09:22,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 19:09:22,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 19:09:22,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 19:09:22,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 19:09:22,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 19:09:22,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 19:09:22,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 19:09:22,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 19:09:22,149 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 19:09:22,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 19:09:22,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 19:09:22,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 19:09:22,151 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 19:09:22,152 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 19:09:22,152 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 19:09:22,152 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 19:09:22,152 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 19:09:22,153 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 19:09:22,153 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 19:09:22,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 19:09:22,153 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 19:09:22,154 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 19:09:22,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 19:09:22,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 19:09:22,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 19:09:22,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 19:09:22,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 19:09:22,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 19:09:22,156 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 19:09:22,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 19:09:22,156 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 19:09:22,156 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 19:09:22,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 19:09:22,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 19:09:22,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 19:09:22,158 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 19:09:22,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 19:09:22,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 19:09:22,158 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 19:09:22,159 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 19:09:22,160 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 19:09:22,160 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2292364e3df3925555991c57490c078c89b959e0 [2020-10-19 19:09:22,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 19:09:22,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 19:09:22,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 19:09:22,505 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 19:09:22,506 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 19:09:22,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-2.c [2020-10-19 19:09:22,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfc45b2f9/8dbff13c85b849dfae99eeaa58ef8c13/FLAGa518268e3 [2020-10-19 19:09:23,011 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 19:09:23,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2020-10-19 19:09:23,024 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfc45b2f9/8dbff13c85b849dfae99eeaa58ef8c13/FLAGa518268e3 [2020-10-19 19:09:23,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfc45b2f9/8dbff13c85b849dfae99eeaa58ef8c13 [2020-10-19 19:09:23,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 19:09:23,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 19:09:23,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:23,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 19:09:23,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 19:09:23,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c422bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23, skipping insertion in model container [2020-10-19 19:09:23,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 19:09:23,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 19:09:23,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:23,612 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 19:09:23,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:23,716 INFO L208 MainTranslator]: Completed translation [2020-10-19 19:09:23,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23 WrapperNode [2020-10-19 19:09:23,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:23,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:23,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 19:09:23,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 19:09:23,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:23,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 19:09:23,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 19:09:23,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 19:09:23,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (1/1) ... [2020-10-19 19:09:23,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 19:09:23,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 19:09:23,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 19:09:23,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 19:09:23,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (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-19 19:09:23,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-19 19:09:23,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 19:09:23,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-19 19:09:23,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 19:09:23,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 19:09:23,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 19:09:23,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 19:09:23,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 19:09:23,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 19:09:24,363 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 19:09:24,363 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-19 19:09:24,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:24 BoogieIcfgContainer [2020-10-19 19:09:24,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 19:09:24,368 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 19:09:24,368 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 19:09:24,371 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 19:09:24,371 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:24,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 07:09:23" (1/3) ... [2020-10-19 19:09:24,373 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c750d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:24, skipping insertion in model container [2020-10-19 19:09:24,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:24,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:23" (2/3) ... [2020-10-19 19:09:24,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c750d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:24, skipping insertion in model container [2020-10-19 19:09:24,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:24,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:24" (3/3) ... [2020-10-19 19:09:24,376 INFO L373 chiAutomizerObserver]: Analyzing ICFG test27-2.c [2020-10-19 19:09:24,422 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 19:09:24,422 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 19:09:24,422 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 19:09:24,422 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 19:09:24,422 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 19:09:24,422 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 19:09:24,422 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 19:09:24,423 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 19:09:24,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-10-19 19:09:24,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 19:09:24,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:24,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:24,460 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:24,461 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:24,461 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 19:09:24,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-10-19 19:09:24,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-19 19:09:24,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:24,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:24,463 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:24,464 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:24,471 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 4#L29-3true [2020-10-19 19:09:24,472 INFO L796 eck$LassoCheckResult]: Loop: 4#L29-3true assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 6#L29-2true main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 4#L29-3true [2020-10-19 19:09:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 19:09:24,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:24,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294783575] [2020-10-19 19:09:24,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:24,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:24,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:24,643 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:24,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-19 19:09:24,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:24,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335869026] [2020-10-19 19:09:24,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:24,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:24,677 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:24,681 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-19 19:09:24,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:24,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146650330] [2020-10-19 19:09:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:24,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:24,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:24,815 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:24,944 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-19 19:09:25,010 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:25,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:25,101 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:25,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:25,173 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:25,173 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:178 [2020-10-19 19:09:25,919 WARN L193 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2020-10-19 19:09:26,193 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-19 19:09:26,204 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 19:09:26,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 19:09:26,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 19:09:26,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 19:09:26,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 19:09:26,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:26,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 19:09:26,205 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 19:09:26,206 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-2.c_Iteration1_Lasso [2020-10-19 19:09:26,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 19:09:26,206 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 19:09:26,236 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-19 19:09:26,244 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-19 19:09:26,246 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-19 19:09:26,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-19 19:09:26,254 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-19 19:09:26,257 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-19 19:09:26,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-19 19:09:26,264 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-19 19:09:26,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-19 19:09:26,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 19:09:26,275 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-19 19:09:26,790 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-10-19 19:09:26,885 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-19 19:09:26,889 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-19 19:09:26,891 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-19 19:09:26,894 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-19 19:09:26,897 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-19 19:09:26,899 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-19 19:09:26,902 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-19 19:09:26,905 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-19 19:09:26,907 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-19 19:09:26,910 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-19 19:09:26,913 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-19 19:09:26,915 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-19 19:09:26,918 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-19 19:09:26,920 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-19 19:09:26,923 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-19 19:09:26,925 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-19 19:09:26,928 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-19 19:09:27,432 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 19:09:27,439 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-19 19:09:27,455 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-19 19:09:27,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:27,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,516 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-19 19:09:27,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:27,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:27,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:27,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,572 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-19 19:09:27,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:27,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:27,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:27,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,601 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-19 19:09:27,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:27,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:27,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:27,605 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-19 19:09:27,628 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-19 19:09:27,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:27,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:27,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:27,632 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-19 19:09:27,665 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-19 19:09:27,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:27,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:27,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,701 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-19 19:09:27,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:27,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:27,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:27,705 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-19 19:09:27,728 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:27,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:27,739 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-19 19:09:27,763 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-19 19:09:27,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:27,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:27,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:27,771 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-19 19:09:27,797 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-19 19:09:27,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:27,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:27,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 19:09:27,827 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-19 19:09:27,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:27,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:27,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:27,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:27,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:27,874 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-19 19:09:27,896 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-19 19:09:27,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:27,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:27,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,940 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-19 19:09:27,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:27,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:27,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:27,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:27,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:27,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:27,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:27,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:27,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:27,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:27,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:28,040 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-19 19:09:28,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 17 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:28,104 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-19 19:09:28,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:28,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:28,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:28,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 18 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:28,159 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-19 19:09:28,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:28,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,259 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-19 19:09:28,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,288 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-19 19:09:28,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:28,334 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-19 19:09:28,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:28,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:28,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:28,362 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,395 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-19 19:09:28,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,403 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) [2020-10-19 19:09:28,426 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:28,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:28,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:28,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 19:09:28,455 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-19 19:09:28,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,464 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-19 19:09:28,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:28,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:28,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 19:09:28,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:28,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:28,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,529 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-19 19:09:28,551 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-19 19:09:28,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 19:09:28,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 19:09:28,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 19:09:28,555 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-19 19:09:28,582 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-19 19:09:28,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,590 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-19 19:09:28,611 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-19 19:09:28,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 19:09:28,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 19:09:28,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 19:09:28,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 19:09:28,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 19:09:28,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 19:09:28,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 19:09:28,685 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-19 19:09:28,686 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 19:09:28,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:28,751 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 19:09:28,752 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 19:09:28,753 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#dummies~0.base)_1, ULTIMATE.start_main_~j~0) = 19*v_rep(select #length ULTIMATE.start_main_~#dummies~0.base)_1 - 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-10-19 19:09:28,961 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2020-10-19 19:09:28,972 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 19:09:28,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:29,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 19:09:29,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:29,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 19:09:29,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:29,060 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-19 19:09:29,077 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-19 19:09:29,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2020-10-19 19:09:29,173 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 40 states and 57 transitions. Complement of second has 8 states. [2020-10-19 19:09:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 19:09:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 19:09:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-10-19 19:09:29,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-19 19:09:29,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:09:29,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-19 19:09:29,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:09:29,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-19 19:09:29,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 19:09:29,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 57 transitions. [2020-10-19 19:09:29,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:29,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 9 states and 11 transitions. [2020-10-19 19:09:29,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-19 19:09:29,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:29,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-10-19 19:09:29,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:29,191 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-10-19 19:09:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-10-19 19:09:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-19 19:09:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-19 19:09:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-10-19 19:09:29,219 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-10-19 19:09:29,219 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-10-19 19:09:29,219 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 19:09:29,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-10-19 19:09:29,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:29,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:29,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:29,220 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 19:09:29,221 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:29,221 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 217#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 218#L29-3 assume !(main_~j~0 < 10); 221#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 219#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 220#L44-3 [2020-10-19 19:09:29,221 INFO L796 eck$LassoCheckResult]: Loop: 220#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 225#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 220#L44-3 [2020-10-19 19:09:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2020-10-19 19:09:29,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:29,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292508427] [2020-10-19 19:09:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:29,301 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-19 19:09:29,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292508427] [2020-10-19 19:09:29,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:29,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 19:09:29,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662520044] [2020-10-19 19:09:29,305 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:29,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:29,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2020-10-19 19:09:29,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:29,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139071322] [2020-10-19 19:09:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:29,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:29,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:29,315 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:29,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:29,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 19:09:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 19:09:29,343 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-19 19:09:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:29,357 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-10-19 19:09:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 19:09:29,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-10-19 19:09:29,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:29,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2020-10-19 19:09:29,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:29,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:29,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-10-19 19:09:29,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:29,360 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-10-19 19:09:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-10-19 19:09:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-10-19 19:09:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-19 19:09:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-10-19 19:09:29,362 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-19 19:09:29,362 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-19 19:09:29,362 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 19:09:29,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-10-19 19:09:29,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:29,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:29,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:29,363 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:09:29,363 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:29,363 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 242#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 243#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 244#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 245#L29-3 assume !(main_~j~0 < 10); 246#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 247#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 248#L44-3 [2020-10-19 19:09:29,364 INFO L796 eck$LassoCheckResult]: Loop: 248#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 250#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 248#L44-3 [2020-10-19 19:09:29,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:29,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2020-10-19 19:09:29,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:29,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854534254] [2020-10-19 19:09:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:29,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854534254] [2020-10-19 19:09:29,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661850788] [2020-10-19 19:09:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:29,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 19:09:29,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:29,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:29,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-19 19:09:29,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722108250] [2020-10-19 19:09:29,481 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:29,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2020-10-19 19:09:29,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:29,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709566130] [2020-10-19 19:09:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:29,486 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:29,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:29,490 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:29,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:29,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:09:29,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:09:29,514 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 5 states. [2020-10-19 19:09:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:29,534 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-10-19 19:09:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 19:09:29,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-10-19 19:09:29,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:29,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2020-10-19 19:09:29,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:29,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:29,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-10-19 19:09:29,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:29,537 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-10-19 19:09:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-10-19 19:09:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-10-19 19:09:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-19 19:09:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-10-19 19:09:29,539 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-19 19:09:29,539 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-19 19:09:29,539 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 19:09:29,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-10-19 19:09:29,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:29,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:29,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:29,540 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-19 19:09:29,541 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:29,541 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 289#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 290#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 291#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 292#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 293#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 299#L29-3 assume !(main_~j~0 < 10); 298#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 294#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 295#L44-3 [2020-10-19 19:09:29,541 INFO L796 eck$LassoCheckResult]: Loop: 295#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 297#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 295#L44-3 [2020-10-19 19:09:29,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash -367607132, now seen corresponding path program 2 times [2020-10-19 19:09:29,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:29,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289499222] [2020-10-19 19:09:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:29,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289499222] [2020-10-19 19:09:29,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413474486] [2020-10-19 19:09:29,591 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:29,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 19:09:29,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:09:29,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 19:09:29,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:29,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:29,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-19 19:09:29,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927711768] [2020-10-19 19:09:29,685 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:29,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:29,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2020-10-19 19:09:29,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:29,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327790901] [2020-10-19 19:09:29,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:29,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:29,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:29,692 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:29,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:29,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-19 19:09:29,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-19 19:09:29,717 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 6 states. [2020-10-19 19:09:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:29,740 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-10-19 19:09:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:09:29,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2020-10-19 19:09:29,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:29,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2020-10-19 19:09:29,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:29,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:29,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2020-10-19 19:09:29,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:29,743 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-10-19 19:09:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2020-10-19 19:09:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-10-19 19:09:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 19:09:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-10-19 19:09:29,745 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-19 19:09:29,745 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-19 19:09:29,745 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 19:09:29,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-10-19 19:09:29,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:29,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:29,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:29,747 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2020-10-19 19:09:29,747 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:29,747 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 347#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 348#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 349#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 355#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 359#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 350#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 351#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 358#L29-3 assume !(main_~j~0 < 10); 357#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 352#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 353#L44-3 [2020-10-19 19:09:29,748 INFO L796 eck$LassoCheckResult]: Loop: 353#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 356#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 353#L44-3 [2020-10-19 19:09:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479198, now seen corresponding path program 3 times [2020-10-19 19:09:29,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:29,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324783575] [2020-10-19 19:09:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:29,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324783575] [2020-10-19 19:09:29,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802565019] [2020-10-19 19:09:29,802 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:29,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-19 19:09:29,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:09:30,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 19:09:30,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:30,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:30,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-19 19:09:30,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473424958] [2020-10-19 19:09:30,028 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2020-10-19 19:09:30,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:30,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40876042] [2020-10-19 19:09:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:30,033 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:30,035 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:30,037 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:30,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 19:09:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 19:09:30,066 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 7 states. [2020-10-19 19:09:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:30,101 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-10-19 19:09:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-19 19:09:30,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2020-10-19 19:09:30,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:30,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2020-10-19 19:09:30,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:30,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:30,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2020-10-19 19:09:30,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:30,104 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-10-19 19:09:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2020-10-19 19:09:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-19 19:09:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-19 19:09:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-10-19 19:09:30,106 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 19:09:30,106 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-10-19 19:09:30,107 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 19:09:30,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2020-10-19 19:09:30,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:30,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:30,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:30,108 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2020-10-19 19:09:30,108 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:30,108 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 416#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 417#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 418#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 419#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 420#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 424#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 430#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 429#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 428#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 427#L29-3 assume !(main_~j~0 < 10); 426#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 421#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 422#L44-3 [2020-10-19 19:09:30,109 INFO L796 eck$LassoCheckResult]: Loop: 422#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 425#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 422#L44-3 [2020-10-19 19:09:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 4 times [2020-10-19 19:09:30,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:30,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66488994] [2020-10-19 19:09:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:30,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66488994] [2020-10-19 19:09:30,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262911547] [2020-10-19 19:09:30,173 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 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-19 19:09:49,648 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 19:09:49,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:09:49,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 19:09:49,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:49,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:49,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-19 19:09:49,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997688128] [2020-10-19 19:09:49,763 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 5 times [2020-10-19 19:09:49,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:49,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636361300] [2020-10-19 19:09:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:49,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:49,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:49,772 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:49,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:49,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 19:09:49,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-19 19:09:49,800 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 8 states. [2020-10-19 19:09:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:49,839 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-10-19 19:09:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 19:09:49,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2020-10-19 19:09:49,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:49,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2020-10-19 19:09:49,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:49,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:49,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2020-10-19 19:09:49,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:49,844 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-10-19 19:09:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2020-10-19 19:09:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-19 19:09:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 19:09:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-10-19 19:09:49,847 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-19 19:09:49,847 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-10-19 19:09:49,847 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 19:09:49,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2020-10-19 19:09:49,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:49,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:49,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:49,848 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2020-10-19 19:09:49,848 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:49,849 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 496#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 497#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 498#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 499#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 500#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 504#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 512#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 511#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 510#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 509#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 508#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 507#L29-3 assume !(main_~j~0 < 10); 506#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 501#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 502#L44-3 [2020-10-19 19:09:49,849 INFO L796 eck$LassoCheckResult]: Loop: 502#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 505#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 502#L44-3 [2020-10-19 19:09:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904350, now seen corresponding path program 5 times [2020-10-19 19:09:49,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:49,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130615576] [2020-10-19 19:09:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:49,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130615576] [2020-10-19 19:09:49,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462543861] [2020-10-19 19:09:49,924 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:50,699 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-19 19:09:50,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:09:50,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 19:09:50,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:50,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:50,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-19 19:09:50,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858303236] [2020-10-19 19:09:50,734 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 6 times [2020-10-19 19:09:50,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:50,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481655519] [2020-10-19 19:09:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:50,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:50,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:50,742 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:50,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:50,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 19:09:50,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-19 19:09:50,762 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 9 states. [2020-10-19 19:09:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:50,807 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-10-19 19:09:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 19:09:50,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2020-10-19 19:09:50,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:50,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2020-10-19 19:09:50,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:50,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:50,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2020-10-19 19:09:50,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:50,810 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-10-19 19:09:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2020-10-19 19:09:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-19 19:09:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-19 19:09:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-10-19 19:09:50,812 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-19 19:09:50,812 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-10-19 19:09:50,812 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 19:09:50,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2020-10-19 19:09:50,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:50,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:50,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:50,814 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2020-10-19 19:09:50,815 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:50,815 INFO L794 eck$LassoCheckResult]: Stem: 594#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 587#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 588#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 589#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 590#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 591#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 595#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 605#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 604#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 603#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 602#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 601#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 600#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 599#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 598#L29-3 assume !(main_~j~0 < 10); 597#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 592#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 593#L44-3 [2020-10-19 19:09:50,815 INFO L796 eck$LassoCheckResult]: Loop: 593#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 596#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 593#L44-3 [2020-10-19 19:09:50,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:50,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295068, now seen corresponding path program 6 times [2020-10-19 19:09:50,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:50,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590624373] [2020-10-19 19:09:50,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:50,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590624373] [2020-10-19 19:09:50,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010437674] [2020-10-19 19:09:50,899 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:51,806 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-19 19:09:51,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:09:51,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-19 19:09:51,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:51,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:51,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-19 19:09:51,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013642749] [2020-10-19 19:09:51,841 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:51,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 7 times [2020-10-19 19:09:51,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:51,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596426274] [2020-10-19 19:09:51,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:51,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:51,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:51,849 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:51,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:51,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-19 19:09:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-19 19:09:51,869 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 10 states. [2020-10-19 19:09:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:51,922 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-10-19 19:09:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 19:09:51,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2020-10-19 19:09:51,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:51,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2020-10-19 19:09:51,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:51,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:51,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2020-10-19 19:09:51,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:51,925 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-10-19 19:09:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2020-10-19 19:09:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-10-19 19:09:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-19 19:09:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-10-19 19:09:51,928 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-10-19 19:09:51,928 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-10-19 19:09:51,928 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 19:09:51,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2020-10-19 19:09:51,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:51,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:51,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:51,930 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2020-10-19 19:09:51,930 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:51,930 INFO L794 eck$LassoCheckResult]: Stem: 696#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 689#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 690#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 691#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 692#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 693#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 697#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 709#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 708#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 707#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 706#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 705#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 704#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 703#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 702#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 701#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 700#L29-3 assume !(main_~j~0 < 10); 699#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 694#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 695#L44-3 [2020-10-19 19:09:51,930 INFO L796 eck$LassoCheckResult]: Loop: 695#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 698#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 695#L44-3 [2020-10-19 19:09:51,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash 72219098, now seen corresponding path program 7 times [2020-10-19 19:09:51,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:51,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165924724] [2020-10-19 19:09:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:52,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165924724] [2020-10-19 19:09:52,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92719163] [2020-10-19 19:09:52,022 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:52,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 19:09:52,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:52,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:52,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-19 19:09:52,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561066467] [2020-10-19 19:09:52,119 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 8 times [2020-10-19 19:09:52,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:52,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174077664] [2020-10-19 19:09:52,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:52,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:52,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:52,126 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:52,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:52,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-19 19:09:52,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-19 19:09:52,152 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 11 states. [2020-10-19 19:09:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:52,193 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-10-19 19:09:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-19 19:09:52,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2020-10-19 19:09:52,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:52,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2020-10-19 19:09:52,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:52,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:52,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2020-10-19 19:09:52,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:52,197 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-10-19 19:09:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2020-10-19 19:09:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-10-19 19:09:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-19 19:09:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-10-19 19:09:52,199 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-10-19 19:09:52,199 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-10-19 19:09:52,200 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 19:09:52,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2020-10-19 19:09:52,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:52,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:52,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:52,201 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2020-10-19 19:09:52,201 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:52,201 INFO L794 eck$LassoCheckResult]: Stem: 809#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 802#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 803#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 804#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 805#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 806#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 811#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 824#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 823#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 822#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 821#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 820#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 819#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 818#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 817#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 816#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 815#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 814#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 813#L29-3 assume !(main_~j~0 < 10); 812#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 807#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 808#L44-3 [2020-10-19 19:09:52,201 INFO L796 eck$LassoCheckResult]: Loop: 808#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 810#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 808#L44-3 [2020-10-19 19:09:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:52,202 INFO L82 PathProgramCache]: Analyzing trace with hash 684732824, now seen corresponding path program 8 times [2020-10-19 19:09:52,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:52,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899663489] [2020-10-19 19:09:52,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:52,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899663489] [2020-10-19 19:09:52,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909348947] [2020-10-19 19:09:52,311 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:52,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 19:09:52,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:09:52,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 19:09:52,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:52,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:52,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-19 19:09:52,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727499511] [2020-10-19 19:09:52,431 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:52,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:52,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 9 times [2020-10-19 19:09:52,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:52,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887577101] [2020-10-19 19:09:52,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:52,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:52,436 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:52,437 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:52,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-19 19:09:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-19 19:09:52,459 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 12 states. [2020-10-19 19:09:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:52,520 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-10-19 19:09:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-19 19:09:52,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2020-10-19 19:09:52,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:52,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2020-10-19 19:09:52,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:52,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:52,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2020-10-19 19:09:52,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:52,523 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-10-19 19:09:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2020-10-19 19:09:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-19 19:09:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-19 19:09:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-10-19 19:09:52,526 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-19 19:09:52,526 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-19 19:09:52,526 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 19:09:52,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2020-10-19 19:09:52,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:52,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:52,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:52,528 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1] [2020-10-19 19:09:52,528 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:52,529 INFO L794 eck$LassoCheckResult]: Stem: 933#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 926#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 927#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 928#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 929#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 930#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 934#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 950#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 949#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 948#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 947#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 946#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 945#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 944#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 943#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 942#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 941#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 940#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 939#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 938#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 937#L29-3 assume !(main_~j~0 < 10); 936#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 931#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 932#L44-3 [2020-10-19 19:09:52,529 INFO L796 eck$LassoCheckResult]: Loop: 932#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 935#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 932#L44-3 [2020-10-19 19:09:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:52,529 INFO L82 PathProgramCache]: Analyzing trace with hash 899903958, now seen corresponding path program 9 times [2020-10-19 19:09:52,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:52,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058653294] [2020-10-19 19:09:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:52,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058653294] [2020-10-19 19:09:52,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931560234] [2020-10-19 19:09:52,635 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:09:56,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-19 19:09:56,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:09:56,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-19 19:09:56,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:09:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:56,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:09:56,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-19 19:09:56,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669676927] [2020-10-19 19:09:56,390 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:09:56,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 10 times [2020-10-19 19:09:56,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:56,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388931360] [2020-10-19 19:09:56,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:56,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:56,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:56,398 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:56,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:56,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 19:09:56,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-19 19:09:56,425 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 13 states. [2020-10-19 19:09:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:56,484 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-10-19 19:09:56,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-19 19:09:56,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2020-10-19 19:09:56,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:56,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2020-10-19 19:09:56,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-19 19:09:56,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-19 19:09:56,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2020-10-19 19:09:56,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:56,488 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-19 19:09:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2020-10-19 19:09:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-19 19:09:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-19 19:09:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-10-19 19:09:56,490 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-19 19:09:56,490 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-19 19:09:56,490 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 19:09:56,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2020-10-19 19:09:56,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-19 19:09:56,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:56,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:56,492 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2020-10-19 19:09:56,492 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-19 19:09:56,493 INFO L794 eck$LassoCheckResult]: Stem: 1067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1060#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet13, main_#t~post12, main_~j~0, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20, main_#t~pre22, main_#t~mem21, main_#t~ret23, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.allocOnStack(40);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~j~0 := 0; 1061#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1062#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1063#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1064#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1068#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1086#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1085#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1084#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1083#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1082#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1081#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1080#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1079#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1078#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1077#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1076#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1075#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1074#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1073#L29-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet13, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet13;call write~$Pointer$(0, 0, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * main_~j~0, 4); 1072#L29-2 main_#t~post12 := main_~j~0;main_~j~0 := 1 + main_#t~post12;havoc main_#t~post12; 1071#L29-3 assume !(main_~j~0 < 10); 1070#L29-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, main_~#dummy~0.base, main_~#dummy~0.offset, 4);call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, main_#t~mem14.offset + 4 * main_~i~0, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_#t~mem15.base, main_#t~mem15.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem16.base, main_#t~mem16.offset + 4 * main_~i~0;havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15.base, main_#t~mem15.offset;call main_#t~mem17 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1065#L42 assume main_#t~mem17 > 0;havoc main_#t~mem17;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 4 * (1 + main_~i~0), 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);call main_#t~mem20 := read~int(main_#t~mem19.base, main_#t~mem19.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~mem20 - 10;havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem20; 1066#L44-3 [2020-10-19 19:09:56,493 INFO L796 eck$LassoCheckResult]: Loop: 1066#L44-3 call main_#t~mem21 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 1069#L44-1 assume !!(main_~i~0 < main_#t~mem21);havoc main_#t~mem21;main_#t~pre22 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre22; 1066#L44-3 [2020-10-19 19:09:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 10 times [2020-10-19 19:09:56,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:56,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906968458] [2020-10-19 19:09:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:57,852 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2020-10-19 19:09:58,105 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 50 [2020-10-19 19:09:58,269 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2020-10-19 19:09:58,419 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2020-10-19 19:09:58,581 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2020-10-19 19:09:58,764 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 60 [2020-10-19 19:09:59,005 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2020-10-19 19:09:59,220 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2020-10-19 19:09:59,468 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 60 [2020-10-19 19:09:59,708 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2020-10-19 19:09:59,859 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2020-10-19 19:09:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:59,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906968458] [2020-10-19 19:09:59,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928697699] [2020-10-19 19:09:59,957 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 19:10:00,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-19 19:10:00,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 19:10:00,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 94 conjunts are in the unsatisfiable core [2020-10-19 19:10:00,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 19:10:00,352 INFO L350 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2020-10-19 19:10:00,352 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2020-10-19 19:10:00,353 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:00,373 INFO L625 ElimStorePlain]: treesize reduction 12, result has 66.7 percent of original size [2020-10-19 19:10:00,375 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:00,375 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:24 [2020-10-19 19:10:00,465 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_100|], 36=[|v_#valid_129|]} [2020-10-19 19:10:00,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,479 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2020-10-19 19:10:00,479 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:00,556 INFO L625 ElimStorePlain]: treesize reduction 4, result has 96.1 percent of original size [2020-10-19 19:10:00,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:00,699 INFO L350 Elim1Store]: treesize reduction 66, result has 57.4 percent of original size [2020-10-19 19:10:00,699 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 127 [2020-10-19 19:10:00,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 19:10:00,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 19:10:00,713 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:00,803 INFO L625 ElimStorePlain]: treesize reduction 51, result has 61.9 percent of original size [2020-10-19 19:10:00,805 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:00,805 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:83 [2020-10-19 19:10:00,987 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 15 treesize of output 11 [2020-10-19 19:10:00,988 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:01,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,045 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 15 treesize of output 11 [2020-10-19 19:10:01,045 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:01,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,083 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:01,083 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:88 [2020-10-19 19:10:01,283 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 33 treesize of output 13 [2020-10-19 19:10:01,284 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:01,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,350 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:01,405 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:01,425 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-10-19 19:10:01,425 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:01,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:01,492 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2020-10-19 19:10:01,492 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:01,542 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,543 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:01,544 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:160, output treesize:106 [2020-10-19 19:10:01,773 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_32|], 6=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2020-10-19 19:10:01,777 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:01,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,872 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:01,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:01,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:01,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:01,968 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2020-10-19 19:10:01,969 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:02,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:02,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,065 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2020-10-19 19:10:02,065 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:02,129 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:02,133 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:02,134 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:178, output treesize:124 [2020-10-19 19:10:02,380 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_33|, |v_#memory_$Pointer$.offset_33|], 12=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|]} [2020-10-19 19:10:02,386 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:02,498 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-19 19:10:02,499 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:02,503 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:02,604 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-19 19:10:02,605 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:02,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,630 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2020-10-19 19:10:02,630 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:02,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:02,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:02,731 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2020-10-19 19:10:02,732 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:02,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:02,804 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:02,805 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:196, output treesize:142 [2020-10-19 19:10:03,089 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_34|, |v_#memory_$Pointer$.base_34|], 20=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_43|]} [2020-10-19 19:10:03,094 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:03,216 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-19 19:10:03,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:03,221 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:03,333 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-19 19:10:03,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:03,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,376 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2020-10-19 19:10:03,378 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:03,484 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-19 19:10:03,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:03,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:03,503 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2020-10-19 19:10:03,504 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:03,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:03,582 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:03,582 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:214, output treesize:160 [2020-10-19 19:10:03,939 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_35|], 30=[|v_#memory_$Pointer$.base_44|, |v_#memory_$Pointer$.offset_44|]} [2020-10-19 19:10:03,943 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:04,090 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 19:10:04,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:04,102 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:04,217 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-19 19:10:04,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:04,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,244 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2020-10-19 19:10:04,245 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:04,352 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-19 19:10:04,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:04,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:04,390 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2020-10-19 19:10:04,391 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:04,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:04,489 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:04,489 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:238, output treesize:184 [2020-10-19 19:10:04,850 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_36|, |v_#memory_$Pointer$.base_36|], 42=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_45|]} [2020-10-19 19:10:04,854 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:04,990 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-19 19:10:04,990 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:04,994 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:05,113 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-19 19:10:05,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:05,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,144 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 95 [2020-10-19 19:10:05,146 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:05,250 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 19:10:05,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:05,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:05,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 95 [2020-10-19 19:10:05,283 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:05,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:05,380 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:05,380 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:250, output treesize:196 [2020-10-19 19:10:05,770 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_37|], 56=[|v_#memory_$Pointer$.offset_46|, |v_#memory_$Pointer$.base_46|]} [2020-10-19 19:10:05,774 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:05,936 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-19 19:10:05,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:05,941 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:06,104 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-19 19:10:06,105 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:06,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,146 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 110 [2020-10-19 19:10:06,148 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:06,280 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-19 19:10:06,281 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:06,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:06,333 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 110 [2020-10-19 19:10:06,336 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:06,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:06,433 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:06,434 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:274, output treesize:220 [2020-10-19 19:10:06,701 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-19 19:10:07,000 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-19 19:10:07,009 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|], 72=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_47|]} [2020-10-19 19:10:07,014 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:07,509 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2020-10-19 19:10:07,510 INFO L625 ElimStorePlain]: treesize reduction 3, result has 99.0 percent of original size [2020-10-19 19:10:07,516 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:07,775 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-19 19:10:07,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:07,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:07,871 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 119 [2020-10-19 19:10:07,873 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:08,064 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-19 19:10:08,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:08,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:08,115 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 119 [2020-10-19 19:10:08,117 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:08,238 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-19 19:10:08,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:08,240 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 19:10:08,240 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:289, output treesize:232 [2020-10-19 19:10:08,471 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 19:10:08,710 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 19:10:08,954 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-19 19:10:14,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:14,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:14,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:14,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:14,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:14,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:14,682 INFO L244 Elim1Store]: Index analysis took 102 ms [2020-10-19 19:10:14,720 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:14,721 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 47 treesize of output 155 [2020-10-19 19:10:14,726 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:15,814 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 173 [2020-10-19 19:10:15,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:15,819 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_54|], 2=[|v_#memory_int_52|, |v_#memory_int_53|, |#memory_int|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|], 90=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_48|]} [2020-10-19 19:10:15,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:15,907 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 11 [2020-10-19 19:10:15,907 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:16,625 WARN L193 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-10-19 19:10:16,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:16,652 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2020-10-19 19:10:16,652 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:17,231 WARN L193 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-10-19 19:10:17,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:17,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:17,261 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-10-19 19:10:17,262 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:17,753 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2020-10-19 19:10:17,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:17,779 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2020-10-19 19:10:17,780 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:18,159 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2020-10-19 19:10:18,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:18,168 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:18,560 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-10-19 19:10:18,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:18,565 INFO L545 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:18,994 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-10-19 19:10:18,995 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:19,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:19,153 INFO L244 Elim1Store]: Index analysis took 142 ms [2020-10-19 19:10:19,433 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 19:10:19,435 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:19,435 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 44 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 263 treesize of output 438 [2020-10-19 19:10:19,438 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:20,132 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 137 [2020-10-19 19:10:20,133 INFO L625 ElimStorePlain]: treesize reduction 277, result has 62.9 percent of original size [2020-10-19 19:10:20,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 19:10:20,400 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-19 19:10:20,401 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:10:20,401 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 44 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 247 treesize of output 434 [2020-10-19 19:10:20,404 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-10-19 19:10:20,889 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 133 [2020-10-19 19:10:20,890 INFO L625 ElimStorePlain]: treesize reduction 277, result has 56.0 percent of original size [2020-10-19 19:10:20,895 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 19:10:20,896 INFO L244 ElimStorePlain]: Needed 10 recursive calls to eliminate 15 variables, input treesize:558, output treesize:406 [2020-10-19 19:10:21,222 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-19 19:10:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:10:21,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 19:10:21,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 40 [2020-10-19 19:10:21,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709620619] [2020-10-19 19:10:21,247 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 19:10:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:10:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 11 times [2020-10-19 19:10:21,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:10:21,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629880489] [2020-10-19 19:10:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:10:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:21,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:10:21,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:10:21,264 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:10:21,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:10:21,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-10-19 19:10:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2020-10-19 19:10:21,291 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 42 states. [2020-10-19 19:10:21,784 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-19 19:10:21,999 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-10-19 19:10:22,222 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-10-19 19:10:22,466 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2020-10-19 19:10:22,693 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2020-10-19 19:10:22,964 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2020-10-19 19:10:23,223 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2020-10-19 19:10:23,526 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2020-10-19 19:10:23,795 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2020-10-19 19:10:24,132 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2020-10-19 19:10:24,451 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2020-10-19 19:10:24,811 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2020-10-19 19:10:25,146 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2020-10-19 19:10:25,555 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 90 [2020-10-19 19:10:25,901 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 90 [2020-10-19 19:10:26,355 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 95 [2020-10-19 19:10:26,776 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 96 [2020-10-19 19:10:27,285 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 102 [2020-10-19 19:10:27,669 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 102 [2020-10-19 19:10:29,052 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 130 [2020-10-19 19:10:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:10:29,054 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-10-19 19:10:29,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-19 19:10:29,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 24 transitions. [2020-10-19 19:10:29,055 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:10:29,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2020-10-19 19:10:29,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 19:10:29,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 19:10:29,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 19:10:29,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:10:29,055 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:10:29,055 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:10:29,055 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 19:10:29,055 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 19:10:29,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 19:10:29,056 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 19:10:29,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 19:10:29,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 07:10:29 BoogieIcfgContainer [2020-10-19 19:10:29,063 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 19:10:29,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 19:10:29,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 19:10:29,064 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 19:10:29,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:24" (3/4) ... [2020-10-19 19:10:29,067 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 19:10:29,068 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 19:10:29,069 INFO L168 Benchmark]: Toolchain (without parser) took 65686.89 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 685.2 MB). Free memory was 957.3 MB in the beginning and 1.5 GB in the end (delta: -566.3 MB). Peak memory consumption was 118.9 MB. Max. memory is 11.5 GB. [2020-10-19 19:10:29,069 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:10:29,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 957.3 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2020-10-19 19:10:29,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 19:10:29,070 INFO L168 Benchmark]: Boogie Preprocessor took 29.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:10:29,071 INFO L168 Benchmark]: RCFGBuilder took 570.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-10-19 19:10:29,071 INFO L168 Benchmark]: BuchiAutomizer took 64695.14 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 549.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -424.3 MB). Peak memory consumption was 125.2 MB. Max. memory is 11.5 GB. [2020-10-19 19:10:29,071 INFO L168 Benchmark]: Witness Printer took 4.61 ms. Allocated memory is still 1.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:10:29,073 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 957.3 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 570.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 64695.14 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 549.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -424.3 MB). Peak memory consumption was 125.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.61 ms. Allocated memory is still 1.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 * unknown-#length-unknown[dummies] + -8 * j and consists of 5 locations. 11 modules have a trivial ranking function, the largest among these consists of 42 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 64.6s and 13 iterations. TraceHistogramMax:10. Analysis of lassos took 56.0s. Construction of modules took 2.3s. Büchi inclusion checks took 6.0s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 81 SDslu, 199 SDs, 0 SdLazy, 688 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital419 mio100 ax100 hnf100 lsp95 ukn36 mio100 lsp44 div100 bol100 ite100 ukn100 eq169 hnf78 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms 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...