./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a96be28be4b50f026536d78db5ba85eeb0ae4413 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:40:21,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:40:21,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:40:21,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:40:21,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:40:21,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:40:21,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:40:21,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:40:21,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:40:21,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:40:21,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:40:21,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:40:21,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:40:21,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:40:21,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:40:21,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:40:21,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:40:21,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:40:21,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:40:21,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:40:21,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:40:21,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:40:21,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:40:21,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:40:21,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:40:21,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:40:21,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:40:21,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:40:21,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:40:21,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:40:21,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:40:21,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:40:21,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:40:21,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:40:21,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:40:21,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:40:21,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:40:21,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:40:21,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:40:21,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:40:21,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:40:21,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:40:21,227 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:40:21,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:40:21,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:40:21,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:40:21,229 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:40:21,230 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:40:21,230 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:40:21,230 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:40:21,230 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:40:21,231 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:40:21,231 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:40:21,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:40:21,232 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:40:21,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:40:21,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:40:21,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:40:21,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:40:21,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:40:21,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:40:21,234 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:40:21,234 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:40:21,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:40:21,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:40:21,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:40:21,235 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:40:21,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:40:21,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:40:21,236 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:40:21,236 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:40:21,237 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:40:21,237 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a96be28be4b50f026536d78db5ba85eeb0ae4413 [2020-07-29 01:40:21,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:40:21,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:40:21,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:40:21,557 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:40:21,558 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:40:21,559 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2020-07-29 01:40:21,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2547ebd01/767317b45c8e4c24b3f1f533db2688c3/FLAGa9fae0bb8 [2020-07-29 01:40:22,094 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:40:22,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2020-07-29 01:40:22,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2547ebd01/767317b45c8e4c24b3f1f533db2688c3/FLAGa9fae0bb8 [2020-07-29 01:40:22,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2547ebd01/767317b45c8e4c24b3f1f533db2688c3 [2020-07-29 01:40:22,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:40:22,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:40:22,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:40:22,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:40:22,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:40:22,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4374af48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22, skipping insertion in model container [2020-07-29 01:40:22,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:40:22,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:40:22,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:40:22,707 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:40:22,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:40:22,740 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:40:22,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22 WrapperNode [2020-07-29 01:40:22,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:40:22,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:40:22,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:40:22,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:40:22,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:40:22,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:40:22,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:40:22,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:40:22,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... [2020-07-29 01:40:22,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:40:22,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:40:22,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:40:22,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:40:22,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:22,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:40:22,931 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2020-07-29 01:40:22,932 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2020-07-29 01:40:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:40:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:40:22,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:40:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:40:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:40:23,204 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:40:23,204 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:40:23,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:40:23 BoogieIcfgContainer [2020-07-29 01:40:23,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:40:23,210 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:40:23,210 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:40:23,217 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:40:23,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:40:23,219 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:40:22" (1/3) ... [2020-07-29 01:40:23,220 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c759c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:40:23, skipping insertion in model container [2020-07-29 01:40:23,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:40:23,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:22" (2/3) ... [2020-07-29 01:40:23,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c759c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:40:23, skipping insertion in model container [2020-07-29 01:40:23,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:40:23,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:40:23" (3/3) ... [2020-07-29 01:40:23,223 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3.i [2020-07-29 01:40:23,294 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:40:23,294 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:40:23,294 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:40:23,295 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:40:23,295 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:40:23,295 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:40:23,295 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:40:23,295 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:40:23,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:40:23,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:40:23,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:23,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:23,356 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:40:23,357 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:23,357 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:40:23,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:40:23,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:40:23,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:23,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:23,363 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:40:23,363 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:23,372 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 5#L20-2true [2020-07-29 01:40:23,372 INFO L796 eck$LassoCheckResult]: Loop: 5#L20-2true assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 13#L23true call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 9#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 15#recFINALtrue assume true; 12#recEXITtrue >#30#return; 11#L23-1true main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 5#L20-2true [2020-07-29 01:40:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:23,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2020-07-29 01:40:23,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:23,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517991956] [2020-07-29 01:40:23,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:23,491 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:23,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:23,520 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:23,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:23,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2039113776, now seen corresponding path program 1 times [2020-07-29 01:40:23,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:23,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247383316] [2020-07-29 01:40:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:23,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:23,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:23,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:23,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1009969970, now seen corresponding path program 1 times [2020-07-29 01:40:23,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:23,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982901982] [2020-07-29 01:40:23,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:23,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:23,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:23,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:24,298 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2020-07-29 01:40:24,434 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:24,435 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:24,435 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:24,436 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:24,436 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:24,436 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:24,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:24,437 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:24,437 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration1_Lasso [2020-07-29 01:40:24,437 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:24,438 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:24,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:24,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:24,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:24,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:24,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:24,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:24,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:25,085 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:25,093 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:25,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:25,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:25,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:25,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:25,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:25,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:25,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:25,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:25,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:25,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:25,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:25,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:25,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:25,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:25,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:25,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:25,213 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:25,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:25,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:25,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:25,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:25,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:25,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:25,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:25,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:25,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:25,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:25,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:25,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:25,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:25,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:25,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:25,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:25,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:25,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:25,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:25,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:25,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:25,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,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 [2020-07-29 01:40:25,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:25,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:25,365 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:40:25,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:25,379 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:40:25,379 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:40:25,401 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) [2020-07-29 01:40:25,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:25,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:25,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:25,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:25,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:25,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:25,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,452 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-07-29 01:40:25,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:25,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:25,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:25,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:25,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:25,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:25,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:25,507 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) [2020-07-29 01:40:25,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:25,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:25,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:25,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:25,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:25,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:25,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:25,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:25,583 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:40:25,584 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:25,597 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:40:25,598 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:40:25,598 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:25,599 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:25,645 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:40:25,650 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8;" "call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#30#return;" "main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9;" [2020-07-29 01:40:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:25,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:40:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:25,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:25,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2020-07-29 01:40:25,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {24#unseeded} is VALID [2020-07-29 01:40:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:25,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:40:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:25,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:26,095 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-29 01:40:26,109 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:26,115 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:26,116 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:26,116 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2020-07-29 01:40:26,120 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:26,120 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, rec_~p.base, rec_~p.offset]. (let ((.cse0 (select (select |#memory_int| rec_~p.base) rec_~p.offset))) (and (<= (+ .cse0 1) 0) (<= |old(oldRank0)| oldRank0) (<= |rec_#res| .cse0))) [2020-07-29 01:40:26,121 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0)) [2020-07-29 01:40:26,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#(>= oldRank0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {45#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:40:26,262 INFO L263 TraceCheckUtils]: 1: Hoare triple {45#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {49#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:40:26,265 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {53#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} is VALID [2020-07-29 01:40:26,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {53#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {57#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:40:26,268 INFO L280 TraceCheckUtils]: 4: Hoare triple {57#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} assume true; {57#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:40:26,270 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {57#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} {45#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} #30#return; {64#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ret9| 1) 0) (< 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:40:26,271 INFO L280 TraceCheckUtils]: 6: Hoare triple {64#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ret9| 1) 0) (< 0 ULTIMATE.start_main_~i~0))} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {37#(or (and (> oldRank0 ULTIMATE.start_main_~i~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:40:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:40:26,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:40:26,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:26,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:40:26,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,332 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-07-29 01:40:26,333 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2020-07-29 01:40:26,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 63 states and 77 transitions. Complement of second has 22 states. [2020-07-29 01:40:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:26,599 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:26,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:40:26,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:40:26,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:26,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:26,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:40:26,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:40:26,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:26,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:26,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 77 transitions. [2020-07-29 01:40:26,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:40:26,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:26,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:26,616 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states. [2020-07-29 01:40:26,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:40:26,621 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:40:26,622 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:40:26,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:40:26,625 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:40:26,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 77 transitions. cyclomatic complexity: 19 [2020-07-29 01:40:26,631 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:40:26,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:40:26,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:40:26,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:40:26,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:26,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:26,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:26,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:26,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:26,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:26,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:40:26,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:40:26,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:40:26,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:40:26,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:40:26,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:40:26,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:26,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:26,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:26,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:40:26,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:40:26,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:40:26,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:40:26,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:40:26,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:40:26,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:40:26,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:40:26,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:40:26,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:40:26,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:40:26,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:40:26,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:40:26,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:40:26,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:40:26,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:40:26,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:40:26,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:40:26,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:40:26,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:40:26,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:40:26,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:40:26,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:40:26,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:40:26,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:26,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:26,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:26,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:26,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:26,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:26,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:26,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:26,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:26,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:26,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:26,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:26,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:26,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:26,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:26,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:26,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:26,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:26,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:26,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:26,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:26,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:26,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:26,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:26,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:26,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:26,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:26,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:26,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:26,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:26,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:26,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:26,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:26,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,671 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:40:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2020-07-29 01:40:26,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:40:26,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:40:26,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 14 letters. [2020-07-29 01:40:26,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:26,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. cyclomatic complexity: 19 [2020-07-29 01:40:26,701 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:40:26,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 35 states and 42 transitions. [2020-07-29 01:40:26,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-07-29 01:40:26,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-29 01:40:26,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2020-07-29 01:40:26,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:26,716 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-07-29 01:40:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2020-07-29 01:40:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-29 01:40:26,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:26,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 42 transitions. Second operand 32 states. [2020-07-29 01:40:26,746 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 42 transitions. Second operand 32 states. [2020-07-29 01:40:26,748 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 32 states. [2020-07-29 01:40:26,752 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:26,759 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-29 01:40:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2020-07-29 01:40:26,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:26,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:26,762 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states and 42 transitions. [2020-07-29 01:40:26,762 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states and 42 transitions. [2020-07-29 01:40:26,762 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:26,768 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-29 01:40:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2020-07-29 01:40:26,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:26,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:26,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:26,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 01:40:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-07-29 01:40:26,774 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-07-29 01:40:26,774 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-07-29 01:40:26,775 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:40:26,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2020-07-29 01:40:26,776 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:40:26,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:26,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:26,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:26,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:26,777 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 160#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 161#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 180#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 181#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 191#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 163#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 170#recENTRY [2020-07-29 01:40:26,777 INFO L796 eck$LassoCheckResult]: Loop: 170#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 164#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 170#recENTRY [2020-07-29 01:40:26,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:26,778 INFO L82 PathProgramCache]: Analyzing trace with hash 557607690, now seen corresponding path program 1 times [2020-07-29 01:40:26,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:26,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087926536] [2020-07-29 01:40:26,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,818 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:26,820 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2020-07-29 01:40:26,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:26,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996083279] [2020-07-29 01:40:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,854 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:26,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:26,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1242807987, now seen corresponding path program 2 times [2020-07-29 01:40:26,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:26,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524031854] [2020-07-29 01:40:26,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:26,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:26,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:27,413 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-07-29 01:40:27,767 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2020-07-29 01:40:31,375 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:31,375 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:31,375 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:31,375 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:31,375 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:31,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:31,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:31,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:31,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration2_Lasso [2020-07-29 01:40:31,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:31,376 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:31,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,537 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:40:31,537 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:40:31,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:31,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:32,313 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:32,313 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:40:32,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:32,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:32,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:32,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:32,326 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-07-29 01:40:32,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:32,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:32,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:32,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:32,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:32,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:32,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:32,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:32,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:32,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:32,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:32,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:32,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:32,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:32,465 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) [2020-07-29 01:40:32,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 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:32,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:32,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:32,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:32,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:32,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:32,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:32,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:32,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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:32,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:32,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:32,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:32,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:32,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:32,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:32,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:32,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:32,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:32,576 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-07-29 01:40:32,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-07-29 01:40:32,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,603 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:40:32,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,609 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-07-29 01:40:32,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:32,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:32,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:32,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:32,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:32,660 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-07-29 01:40:32,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:32,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:32,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:32,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:32,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:32,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:32,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:32,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:32,712 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:40:32,712 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 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-07-29 01:40:32,715 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:32,750 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-07-29 01:40:32,751 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:32,751 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int) rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select old(#memory_int) rec_#in~p.base) rec_#in~p.offset)_1 + 3 Supporting invariants [1*v_rep(select (select old(#memory_int) rec_#in~p.base) rec_#in~p.offset)_1 + 1 >= 0, -1*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1*v_rep(select (select old(#memory_int) rec_#in~p.base) rec_#in~p.offset)_1 >= 0] [2020-07-29 01:40:32,833 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:40:32,841 INFO L393 LassoCheck]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3;" "call #t~ret5 := rec(~p.base, ~p.offset);"< [2020-07-29 01:40:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:32,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:40:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:32,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:40:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:32,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:32,925 INFO L280 TraceCheckUtils]: 0: Hoare triple {396#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {396#unseeded} is VALID [2020-07-29 01:40:32,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {396#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {396#unseeded} is VALID [2020-07-29 01:40:32,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {396#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {396#unseeded} is VALID [2020-07-29 01:40:32,928 INFO L263 TraceCheckUtils]: 3: Hoare triple {396#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {396#unseeded} is VALID [2020-07-29 01:40:32,929 INFO L280 TraceCheckUtils]: 4: Hoare triple {396#unseeded} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {396#unseeded} is VALID [2020-07-29 01:40:32,929 INFO L280 TraceCheckUtils]: 5: Hoare triple {396#unseeded} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {396#unseeded} is VALID [2020-07-29 01:40:32,930 INFO L263 TraceCheckUtils]: 6: Hoare triple {396#unseeded} call #t~ret5 := rec(~p.base, ~p.offset); {425#(and (>= (+ (* (- 1) (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|)) 0) unseeded)} is VALID [2020-07-29 01:40:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:32,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-29 01:40:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:32,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:32,977 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-07-29 01:40:32,998 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:33,004 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:33,005 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:33,005 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2020-07-29 01:40:33,072 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2020-07-29 01:40:33,077 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:33,082 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:33,083 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:33,083 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:23 [2020-07-29 01:40:36,382 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:36,382 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_68|]. (let ((.cse0 (select |v_#memory_int_68| rec_~p.base))) (let ((.cse1 (select .cse0 rec_~p.offset))) (and (= (store |v_#memory_int_68| rec_~p.base (store .cse0 rec_~p.offset (+ .cse1 (- 1)))) |#memory_int|) (<= 0 .cse1) (<= .cse1 (div (+ oldRank0 (- 3)) 2))))) [2020-07-29 01:40:36,383 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1))) (and (<= 0 .cse0) (<= .cse0 (div (+ oldRank0 (- 3)) 2)))) [2020-07-29 01:40:36,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {426#(and (>= oldRank0 (+ (* 2 (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|)) 3)) (>= (+ (* (- 1) (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|)) 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {452#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) (div (+ oldRank0 (- 3)) 2)))} is VALID [2020-07-29 01:40:36,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {452#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) (div (+ oldRank0 (- 3)) 2)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {456#(and (<= 0 (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (<= (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1) (div (+ oldRank0 (- 3)) 2)))} is VALID [2020-07-29 01:40:36,411 INFO L263 TraceCheckUtils]: 2: Hoare triple {456#(and (<= 0 (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (<= (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1) (div (+ oldRank0 (- 3)) 2)))} call #t~ret5 := rec(~p.base, ~p.offset); {428#(and (>= (+ (* (- 1) (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|)) 0) (or (and (> oldRank0 (+ (* 2 (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|)) 3)) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:40:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:40:36,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:36,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:36,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:36,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,427 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:40:36,427 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-07-29 01:40:36,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 47 states and 56 transitions. Complement of second has 17 states. [2020-07-29 01:40:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:36,714 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:36,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. cyclomatic complexity: 10 [2020-07-29 01:40:36,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:36,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:36,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:36,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:36,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:36,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:36,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 56 transitions. [2020-07-29 01:40:36,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:40:36,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:36,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:36,725 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 38 transitions. cyclomatic complexity: 10 [2020-07-29 01:40:36,733 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:40:36,733 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:36,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:36,737 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:36,737 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 56 transitions. cyclomatic complexity: 13 [2020-07-29 01:40:36,744 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:40:36,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:36,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:36,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:36,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:36,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:36,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:36,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 47 letters. Loop has 47 letters. [2020-07-29 01:40:36,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 47 letters. Loop has 47 letters. [2020-07-29 01:40:36,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 47 letters. Loop has 47 letters. [2020-07-29 01:40:36,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:40:36,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:40:36,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:40:36,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:40:36,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:40:36,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:40:36,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:36,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:36,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:36,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:36,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:36,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:36,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:36,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:36,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:36,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:36,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:36,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:36,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:36,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:36,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:36,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:36,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:36,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:36,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:36,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:36,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:36,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:36,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:36,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:36,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:36,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:36,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:36,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:36,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:36,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:36,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:36,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:36,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:36,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:36,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:36,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:36,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:36,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:36,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:36,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,775 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-07-29 01:40:36,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:36,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:36,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:40:36,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:36,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. cyclomatic complexity: 13 [2020-07-29 01:40:36,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:40:36,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 50 transitions. [2020-07-29 01:40:36,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-07-29 01:40:36,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-07-29 01:40:36,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2020-07-29 01:40:36,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:36,812 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-07-29 01:40:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2020-07-29 01:40:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-07-29 01:40:36,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:36,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 50 transitions. Second operand 39 states. [2020-07-29 01:40:36,821 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 50 transitions. Second operand 39 states. [2020-07-29 01:40:36,821 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 39 states. [2020-07-29 01:40:36,822 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:36,832 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2020-07-29 01:40:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2020-07-29 01:40:36,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:36,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:36,834 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states and 50 transitions. [2020-07-29 01:40:36,834 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states and 50 transitions. [2020-07-29 01:40:36,835 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:36,842 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-07-29 01:40:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2020-07-29 01:40:36,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:36,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:36,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:36,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:40:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2020-07-29 01:40:36,852 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-07-29 01:40:36,852 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-07-29 01:40:36,852 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:40:36,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2020-07-29 01:40:36,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:40:36,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:36,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:36,859 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:36,860 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:36,860 INFO L794 eck$LassoCheckResult]: Stem: 543#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 531#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 532#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 555#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 565#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 564#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 537#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 540#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 541#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 569#recFINAL assume true; 548#recEXIT >#28#return; 549#L15-1 #res := #t~ret5;havoc #t~ret5; 563#recFINAL assume true; 558#recEXIT >#30#return; 544#L23-1 [2020-07-29 01:40:36,860 INFO L796 eck$LassoCheckResult]: Loop: 544#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 545#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 552#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 553#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 560#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 562#recFINAL assume true; 567#recEXIT >#30#return; 544#L23-1 [2020-07-29 01:40:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1969157627, now seen corresponding path program 1 times [2020-07-29 01:40:36,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:36,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032170649] [2020-07-29 01:40:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:36,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:36,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:36,905 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 2 times [2020-07-29 01:40:36,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:36,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532499620] [2020-07-29 01:40:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:36,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:36,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:36,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:36,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash 931270558, now seen corresponding path program 1 times [2020-07-29 01:40:36,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:36,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890007125] [2020-07-29 01:40:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:36,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:36,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:37,007 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:37,337 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2020-07-29 01:40:37,692 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2020-07-29 01:40:38,090 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2020-07-29 01:40:38,219 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:38,219 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:38,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:38,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:38,220 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:38,220 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:38,220 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:38,220 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:38,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration3_Lasso [2020-07-29 01:40:38,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:38,221 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:38,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:38,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:38,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:38,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:38,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:38,403 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-07-29 01:40:38,535 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:40:38,536 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:40:39,067 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:39,068 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:39,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:39,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:39,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:39,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:39,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:39,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:39,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:39,080 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-07-29 01:40:39,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:39,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:39,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:39,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:39,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:39,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:39,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:39,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:39,111 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-07-29 01:40:39,145 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-07-29 01:40:39,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:39,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:39,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:39,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:39,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:39,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:39,154 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) [2020-07-29 01:40:39,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:39,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:39,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:39,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:39,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:39,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:39,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:39,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:39,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:39,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:39,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:39,211 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:40:39,211 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:40:39,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:39,227 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:40:39,227 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:40:39,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:39,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:39,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:39,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:39,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:39,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:39,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:39,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:39,284 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-07-29 01:40:39,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:39,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:39,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:39,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:39,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:39,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:39,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:39,321 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-07-29 01:40:39,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:39,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:39,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:39,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:39,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:39,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:39,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:39,361 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-07-29 01:40:39,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:39,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:39,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:39,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:39,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:39,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:39,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:39,398 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:39,410 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:40:39,410 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:39,413 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-07-29 01:40:39,421 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:39,421 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:39,421 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 01:40:39,454 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:40:39,459 INFO L393 LassoCheck]: Loop: "main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9;" "assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8;" "call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#30#return;" [2020-07-29 01:40:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:39,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:39,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:40:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:39,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:39,549 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:40:39,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {796#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {796#unseeded} is VALID [2020-07-29 01:40:39,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {796#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {796#unseeded} is VALID [2020-07-29 01:40:39,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {796#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {796#unseeded} is VALID [2020-07-29 01:40:39,554 INFO L263 TraceCheckUtils]: 3: Hoare triple {796#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,554 INFO L280 TraceCheckUtils]: 4: Hoare triple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,555 INFO L280 TraceCheckUtils]: 5: Hoare triple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,557 INFO L263 TraceCheckUtils]: 6: Hoare triple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,558 INFO L280 TraceCheckUtils]: 7: Hoare triple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,558 INFO L280 TraceCheckUtils]: 8: Hoare triple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,559 INFO L280 TraceCheckUtils]: 9: Hoare triple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,561 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,562 INFO L280 TraceCheckUtils]: 11: Hoare triple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,562 INFO L280 TraceCheckUtils]: 12: Hoare triple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:39,564 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {838#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {796#unseeded} #30#return; {796#unseeded} is VALID [2020-07-29 01:40:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:39,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:40:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:39,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:39,811 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-29 01:40:39,825 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:39,831 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:39,831 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:39,831 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2020-07-29 01:40:39,834 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:39,834 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, rec_~p.base, rec_~p.offset]. (let ((.cse0 (select (select |#memory_int| rec_~p.base) rec_~p.offset))) (and (<= (+ .cse0 1) 0) (<= |old(oldRank0)| oldRank0) (<= |rec_#res| .cse0))) [2020-07-29 01:40:39,834 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0)) [2020-07-29 01:40:39,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {799#(>= oldRank0 (+ |ULTIMATE.start_main_#t~ret9| ULTIMATE.start_main_~i~0))} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {869#(<= ULTIMATE.start_main_~i~0 oldRank0)} is VALID [2020-07-29 01:40:39,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {869#(<= ULTIMATE.start_main_~i~0 oldRank0)} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {873#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:40:39,859 INFO L263 TraceCheckUtils]: 2: Hoare triple {873#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {877#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:40:39,860 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {881#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} is VALID [2020-07-29 01:40:39,862 INFO L280 TraceCheckUtils]: 4: Hoare triple {881#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {885#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:40:39,863 INFO L280 TraceCheckUtils]: 5: Hoare triple {885#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} assume true; {885#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:40:39,864 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {885#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} {873#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} #30#return; {824#(or (and (> oldRank0 (+ |ULTIMATE.start_main_#t~ret9| ULTIMATE.start_main_~i~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:40:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:40:39,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:40:39,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:39,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:39,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:39,903 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2020-07-29 01:40:39,904 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-07-29 01:40:40,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 130 states and 152 transitions. Complement of second has 21 states. [2020-07-29 01:40:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:40,240 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:40,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:40,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:40,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:40,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:40:40,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:40,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:40,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:40,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 152 transitions. [2020-07-29 01:40:40,246 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:40:40,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:40,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:40,248 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 46 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:40,250 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:40:40,250 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:40:40,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:40,253 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:40,253 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 130 states and 152 transitions. cyclomatic complexity: 31 [2020-07-29 01:40:40,256 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:40:40,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:40:40,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:40:40,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:40:40,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:40,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:40,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:40,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 130 letters. Loop has 130 letters. [2020-07-29 01:40:40,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 130 letters. Loop has 130 letters. [2020-07-29 01:40:40,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 130 letters. Loop has 130 letters. [2020-07-29 01:40:40,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:40:40,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:40:40,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:40:40,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:40:40,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:40:40,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:40:40,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:40,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:40,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:40,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:40,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:40,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:40:40,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:40,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:40,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 7 letters. [2020-07-29 01:40:40,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:40,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:40,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:40:40,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:40:40,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:40:40,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:40:40,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:40,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:40,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:40,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:40,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:40,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:40,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:40,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:40,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:40,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:40,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:40,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:40,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:40,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:40,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:40,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:40:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:40:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:40:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:40:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:40:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:40:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:40:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:40:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:40:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:40:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:40:40,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:40:40,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:40:40,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:40:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:40:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,283 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:40:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2020-07-29 01:40:40,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:40:40,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:40:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:40,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 152 transitions. cyclomatic complexity: 31 [2020-07-29 01:40:40,295 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:40:40,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 90 states and 105 transitions. [2020-07-29 01:40:40,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2020-07-29 01:40:40,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2020-07-29 01:40:40,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 105 transitions. [2020-07-29 01:40:40,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:40,302 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2020-07-29 01:40:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 105 transitions. [2020-07-29 01:40:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2020-07-29 01:40:40,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:40,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states and 105 transitions. Second operand 82 states. [2020-07-29 01:40:40,311 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states and 105 transitions. Second operand 82 states. [2020-07-29 01:40:40,311 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand 82 states. [2020-07-29 01:40:40,311 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:40,321 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2020-07-29 01:40:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2020-07-29 01:40:40,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:40,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:40,323 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 90 states and 105 transitions. [2020-07-29 01:40:40,323 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 90 states and 105 transitions. [2020-07-29 01:40:40,323 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:40,333 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2020-07-29 01:40:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2020-07-29 01:40:40,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:40,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:40,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:40,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-29 01:40:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2020-07-29 01:40:40,339 INFO L711 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2020-07-29 01:40:40,339 INFO L591 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2020-07-29 01:40:40,339 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:40:40,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2020-07-29 01:40:40,340 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:40:40,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:40,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:40,341 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:40,341 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:40,341 INFO L794 eck$LassoCheckResult]: Stem: 1067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1057#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 1058#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1086#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1087#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1092#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 1082#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1091#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1099#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1100#recFINAL assume true; 1090#recEXIT >#28#return; 1089#L15-1 #res := #t~ret5;havoc #t~ret5; 1088#recFINAL assume true; 1085#recEXIT >#30#return; 1084#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1072#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1076#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1077#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1130#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 1064#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1062#recENTRY [2020-07-29 01:40:40,341 INFO L796 eck$LassoCheckResult]: Loop: 1062#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1065#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 1063#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1062#recENTRY [2020-07-29 01:40:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:40,342 INFO L82 PathProgramCache]: Analyzing trace with hash -801242957, now seen corresponding path program 2 times [2020-07-29 01:40:40,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:40,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75640484] [2020-07-29 01:40:40,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:40,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:40,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:40,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:40,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:40,406 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2020-07-29 01:40:40,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:40,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327991018] [2020-07-29 01:40:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:40,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:40,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:40,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1599299332, now seen corresponding path program 3 times [2020-07-29 01:40:40,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:40,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291656697] [2020-07-29 01:40:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:40,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:40,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:40,462 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:40,928 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2020-07-29 01:40:41,818 WARN L193 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 117 [2020-07-29 01:40:42,645 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-07-29 01:40:56,100 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:56,100 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:56,100 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:56,100 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:56,100 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:56,100 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:56,100 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:56,101 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:56,101 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration4_Lasso [2020-07-29 01:40:56,101 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:56,101 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:56,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,315 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-07-29 01:40:56,377 WARN L257 bleTransFormulaUtils]: 5 quantified variables [2020-07-29 01:40:56,377 WARN L257 bleTransFormulaUtils]: 5 quantified variables [2020-07-29 01:40:56,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:56,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:57,203 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:57,204 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:57,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:57,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:57,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:57,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:57,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:57,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:57,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:57,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:57,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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:57,237 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:57,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:57,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:57,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:57,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:57,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:57,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:57,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:57,241 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:57,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:57,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:57,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:57,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:57,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:57,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:57,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:57,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:57,269 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:57,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:57,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:57,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:57,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:57,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:57,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:57,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:57,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:57,297 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:57,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:57,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:57,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:57,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:57,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:57,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:57,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:57,327 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:57,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:57,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:57,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:57,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:57,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:57,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:57,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:57,361 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:57,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:57,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:57,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:57,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:57,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:57,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:57,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:57,396 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:57,408 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:40:57,409 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:57,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:40:57,417 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:57,417 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:57,417 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2020-07-29 01:40:57,444 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:40:57,448 INFO L393 LassoCheck]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3;" "call #t~ret5 := rec(~p.base, ~p.offset);"< [2020-07-29 01:40:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:57,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:40:57,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:57,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:40:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:57,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:57,559 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:40:57,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {1571#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1571#unseeded} is VALID [2020-07-29 01:40:57,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {1571#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {1571#unseeded} is VALID [2020-07-29 01:40:57,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {1571#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {1571#unseeded} is VALID [2020-07-29 01:40:57,568 INFO L263 TraceCheckUtils]: 3: Hoare triple {1571#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,569 INFO L280 TraceCheckUtils]: 4: Hoare triple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,570 INFO L263 TraceCheckUtils]: 6: Hoare triple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,574 INFO L280 TraceCheckUtils]: 8: Hoare triple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,577 INFO L280 TraceCheckUtils]: 9: Hoare triple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,579 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,581 INFO L280 TraceCheckUtils]: 11: Hoare triple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,583 INFO L280 TraceCheckUtils]: 12: Hoare triple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:40:57,584 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1603#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1571#unseeded} #30#return; {1571#unseeded} is VALID [2020-07-29 01:40:57,585 INFO L280 TraceCheckUtils]: 14: Hoare triple {1571#unseeded} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {1571#unseeded} is VALID [2020-07-29 01:40:57,586 INFO L280 TraceCheckUtils]: 15: Hoare triple {1571#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {1571#unseeded} is VALID [2020-07-29 01:40:57,587 INFO L263 TraceCheckUtils]: 16: Hoare triple {1571#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {1571#unseeded} is VALID [2020-07-29 01:40:57,587 INFO L280 TraceCheckUtils]: 17: Hoare triple {1571#unseeded} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1571#unseeded} is VALID [2020-07-29 01:40:57,588 INFO L280 TraceCheckUtils]: 18: Hoare triple {1571#unseeded} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {1571#unseeded} is VALID [2020-07-29 01:40:57,588 INFO L263 TraceCheckUtils]: 19: Hoare triple {1571#unseeded} call #t~ret5 := rec(~p.base, ~p.offset); {1571#unseeded} is VALID [2020-07-29 01:40:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:57,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:40:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:57,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:57,679 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2020-07-29 01:40:57,685 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:57,691 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:57,691 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:57,692 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2020-07-29 01:40:59,620 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:59,621 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_162|]. (let ((.cse1 (select |v_#memory_int_162| rec_~p.base))) (let ((.cse0 (select .cse1 rec_~p.offset))) (and (<= (+ (* 2 .cse0) 1) oldRank0) (= (store |v_#memory_int_162| rec_~p.base (store .cse1 rec_~p.offset (+ .cse0 (- 1)))) |#memory_int|) (<= 0 .cse0)))) [2020-07-29 01:40:59,621 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| rec_~p.base) rec_~p.offset))) (and (<= (+ (* 2 .cse0) 3) oldRank0) (<= 0 (+ .cse0 1)))) [2020-07-29 01:40:59,642 INFO L280 TraceCheckUtils]: 0: Hoare triple {1574#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) 1))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1652#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 1) oldRank0))} is VALID [2020-07-29 01:40:59,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {1652#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 1) oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {1656#(and (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 3) oldRank0) (<= 0 (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)))} is VALID [2020-07-29 01:40:59,646 INFO L263 TraceCheckUtils]: 2: Hoare triple {1656#(and (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 3) oldRank0) (<= 0 (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)))} call #t~ret5 := rec(~p.base, ~p.offset); {1589#(or (and (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:40:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:40:59,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:40:59,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:59,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,681 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:40:59,681 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-07-29 01:40:59,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2020-07-29 01:40:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:59,917 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:59,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2020-07-29 01:40:59,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:59,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:59,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:40:59,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:59,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:59,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:59,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 124 transitions. [2020-07-29 01:40:59,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:40:59,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:59,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:59,922 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2020-07-29 01:40:59,925 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:40:59,925 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:40:59,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:59,927 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:59,927 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 106 states and 124 transitions. cyclomatic complexity: 25 [2020-07-29 01:40:59,929 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:40:59,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:40:59,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:40:59,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:40:59,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:40:59,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:40:59,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:40:59,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 82 letters. Loop has 82 letters. [2020-07-29 01:40:59,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 82 letters. [2020-07-29 01:40:59,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 82 letters. Loop has 82 letters. [2020-07-29 01:40:59,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:40:59,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:40:59,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:40:59,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:40:59,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:40:59,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:40:59,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:59,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:59,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:59,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:59,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:59,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:59,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:40:59,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:40:59,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:40:59,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:40:59,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:40:59,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:40:59,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:59,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:59,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:59,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:59,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:59,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:59,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:40:59,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:40:59,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:40:59,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:59,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:59,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:59,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:59,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:59,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:59,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:40:59,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:40:59,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:40:59,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:40:59,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:40:59,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:40:59,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:40:59,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:40:59,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:40:59,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:40:59,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:59,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:59,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:59,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:59,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:59,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:59,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,961 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:40:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2020-07-29 01:40:59,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:59,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:59,963 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:40:59,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:00,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:41:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:00,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:00,060 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:41:00,071 INFO L280 TraceCheckUtils]: 0: Hoare triple {1571#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1571#unseeded} is VALID [2020-07-29 01:41:00,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {1571#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {1571#unseeded} is VALID [2020-07-29 01:41:00,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {1571#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {1571#unseeded} is VALID [2020-07-29 01:41:00,073 INFO L263 TraceCheckUtils]: 3: Hoare triple {1571#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,074 INFO L280 TraceCheckUtils]: 4: Hoare triple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,075 INFO L280 TraceCheckUtils]: 5: Hoare triple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,076 INFO L263 TraceCheckUtils]: 6: Hoare triple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,076 INFO L280 TraceCheckUtils]: 7: Hoare triple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,076 INFO L280 TraceCheckUtils]: 8: Hoare triple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,077 INFO L280 TraceCheckUtils]: 9: Hoare triple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,078 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,079 INFO L280 TraceCheckUtils]: 11: Hoare triple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,079 INFO L280 TraceCheckUtils]: 12: Hoare triple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:00,080 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1804#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1571#unseeded} #30#return; {1571#unseeded} is VALID [2020-07-29 01:41:00,081 INFO L280 TraceCheckUtils]: 14: Hoare triple {1571#unseeded} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {1571#unseeded} is VALID [2020-07-29 01:41:00,081 INFO L280 TraceCheckUtils]: 15: Hoare triple {1571#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {1571#unseeded} is VALID [2020-07-29 01:41:00,082 INFO L263 TraceCheckUtils]: 16: Hoare triple {1571#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {1571#unseeded} is VALID [2020-07-29 01:41:00,082 INFO L280 TraceCheckUtils]: 17: Hoare triple {1571#unseeded} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1571#unseeded} is VALID [2020-07-29 01:41:00,083 INFO L280 TraceCheckUtils]: 18: Hoare triple {1571#unseeded} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {1571#unseeded} is VALID [2020-07-29 01:41:00,084 INFO L263 TraceCheckUtils]: 19: Hoare triple {1571#unseeded} call #t~ret5 := rec(~p.base, ~p.offset); {1571#unseeded} is VALID [2020-07-29 01:41:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:00,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:41:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:00,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:00,181 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2020-07-29 01:41:00,186 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:00,191 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:00,191 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:00,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2020-07-29 01:41:04,016 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:41:04,016 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_163|]. (let ((.cse0 (select |v_#memory_int_163| rec_~p.base))) (let ((.cse1 (select .cse0 rec_~p.offset))) (and (= (store |v_#memory_int_163| rec_~p.base (store .cse0 rec_~p.offset (+ .cse1 (- 1)))) |#memory_int|) (<= 0 .cse1) (<= (+ (* 2 .cse1) 1) oldRank0)))) [2020-07-29 01:41:04,016 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| rec_~p.base) rec_~p.offset))) (and (<= (+ (* 2 .cse0) 3) oldRank0) (<= 0 (+ .cse0 1)))) [2020-07-29 01:41:04,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {1574#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) 1))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1853#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 1) oldRank0))} is VALID [2020-07-29 01:41:04,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {1853#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 1) oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {1857#(and (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 3) oldRank0) (<= 0 (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)))} is VALID [2020-07-29 01:41:04,041 INFO L263 TraceCheckUtils]: 2: Hoare triple {1857#(and (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 3) oldRank0) (<= 0 (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)))} call #t~ret5 := rec(~p.base, ~p.offset); {1589#(or (and (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:41:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:04,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:41:04,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:04,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:41:04,075 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-07-29 01:41:04,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2020-07-29 01:41:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:41:04,290 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:04,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2020-07-29 01:41:04,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:04,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:04,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:41:04,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:04,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:04,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:04,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 124 transitions. [2020-07-29 01:41:04,293 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:41:04,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:04,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:04,294 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2020-07-29 01:41:04,294 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:41:04,294 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:41:04,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:04,295 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:41:04,295 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 106 states and 124 transitions. cyclomatic complexity: 25 [2020-07-29 01:41:04,297 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:41:04,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:04,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:04,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:04,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:41:04,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:41:04,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:41:04,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 82 letters. Loop has 82 letters. [2020-07-29 01:41:04,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 82 letters. [2020-07-29 01:41:04,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 82 letters. Loop has 82 letters. [2020-07-29 01:41:04,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:04,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:04,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:04,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:41:04,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:41:04,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:41:04,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:41:04,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:41:04,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:41:04,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:41:04,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:41:04,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:41:04,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:04,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:04,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:04,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:04,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:04,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:04,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:41:04,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:41:04,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:41:04,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:04,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:04,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:04,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:04,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:04,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:04,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:41:04,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:41:04,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:41:04,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:41:04,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:41:04,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:41:04,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:41:04,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:41:04,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:41:04,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:04,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:04,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:04,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:04,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:04,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:04,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:04,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:04,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:04,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:04,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:41:04,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:41:04,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:41:04,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,318 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:41:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2020-07-29 01:41:04,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:04,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:04,320 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:41:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:04,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:41:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:04,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:04,428 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:41:04,435 INFO L280 TraceCheckUtils]: 0: Hoare triple {1571#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1571#unseeded} is VALID [2020-07-29 01:41:04,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {1571#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {1571#unseeded} is VALID [2020-07-29 01:41:04,436 INFO L280 TraceCheckUtils]: 2: Hoare triple {1571#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {1571#unseeded} is VALID [2020-07-29 01:41:04,438 INFO L263 TraceCheckUtils]: 3: Hoare triple {1571#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,438 INFO L280 TraceCheckUtils]: 4: Hoare triple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,439 INFO L280 TraceCheckUtils]: 5: Hoare triple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,440 INFO L263 TraceCheckUtils]: 6: Hoare triple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,440 INFO L280 TraceCheckUtils]: 7: Hoare triple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,440 INFO L280 TraceCheckUtils]: 8: Hoare triple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,442 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,443 INFO L280 TraceCheckUtils]: 11: Hoare triple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,443 INFO L280 TraceCheckUtils]: 12: Hoare triple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:04,444 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2005#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1571#unseeded} #30#return; {1571#unseeded} is VALID [2020-07-29 01:41:04,445 INFO L280 TraceCheckUtils]: 14: Hoare triple {1571#unseeded} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {1571#unseeded} is VALID [2020-07-29 01:41:04,446 INFO L280 TraceCheckUtils]: 15: Hoare triple {1571#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {1571#unseeded} is VALID [2020-07-29 01:41:04,447 INFO L263 TraceCheckUtils]: 16: Hoare triple {1571#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {1571#unseeded} is VALID [2020-07-29 01:41:04,447 INFO L280 TraceCheckUtils]: 17: Hoare triple {1571#unseeded} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1571#unseeded} is VALID [2020-07-29 01:41:04,453 INFO L280 TraceCheckUtils]: 18: Hoare triple {1571#unseeded} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {1571#unseeded} is VALID [2020-07-29 01:41:04,454 INFO L263 TraceCheckUtils]: 19: Hoare triple {1571#unseeded} call #t~ret5 := rec(~p.base, ~p.offset); {1571#unseeded} is VALID [2020-07-29 01:41:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:04,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:41:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:04,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:04,550 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2020-07-29 01:41:04,553 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:04,558 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:04,558 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:04,559 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2020-07-29 01:41:08,048 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:41:08,048 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_164|]. (let ((.cse0 (select |v_#memory_int_164| rec_~p.base))) (let ((.cse1 (select .cse0 rec_~p.offset))) (and (= |#memory_int| (store |v_#memory_int_164| rec_~p.base (store .cse0 rec_~p.offset (+ .cse1 (- 1))))) (<= 0 .cse1) (<= (+ (* 2 .cse1) 1) oldRank0)))) [2020-07-29 01:41:08,048 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| rec_~p.base) rec_~p.offset))) (and (<= (+ (* 2 .cse0) 3) oldRank0) (<= 0 (+ .cse0 1)))) [2020-07-29 01:41:08,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {1574#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) 1))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2054#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 1) oldRank0))} is VALID [2020-07-29 01:41:08,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {2054#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 1) oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {2058#(and (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 3) oldRank0) (<= 0 (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)))} is VALID [2020-07-29 01:41:08,072 INFO L263 TraceCheckUtils]: 2: Hoare triple {2058#(and (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) 3) oldRank0) (<= 0 (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)))} call #t~ret5 := rec(~p.base, ~p.offset); {1589#(or (and (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:41:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:08,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:41:08,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:08,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:08,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,110 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:41:08,110 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-07-29 01:41:08,353 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 154 states and 179 transitions. Complement of second has 19 states. [2020-07-29 01:41:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:41:08,353 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:08,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2020-07-29 01:41:08,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:08,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:08,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:41:08,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:08,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:08,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:08,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 179 transitions. [2020-07-29 01:41:08,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:08,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:08,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:08,358 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2020-07-29 01:41:08,358 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:41:08,358 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:41:08,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:08,359 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:41:08,360 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 154 states and 179 transitions. cyclomatic complexity: 32 [2020-07-29 01:41:08,361 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:41:08,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:08,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:08,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:08,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 154 letters. Loop has 154 letters. [2020-07-29 01:41:08,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 154 letters. Loop has 154 letters. [2020-07-29 01:41:08,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 154 letters. Loop has 154 letters. [2020-07-29 01:41:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 82 letters. Loop has 82 letters. [2020-07-29 01:41:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 82 letters. Loop has 82 letters. [2020-07-29 01:41:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 82 letters. Loop has 82 letters. [2020-07-29 01:41:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:08,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:08,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:08,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:41:08,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:41:08,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 3 letters. [2020-07-29 01:41:08,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:41:08,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:41:08,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:41:08,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:41:08,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:41:08,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:41:08,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:08,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:08,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:08,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:08,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:08,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:08,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:08,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:41:08,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:41:08,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:41:08,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:08,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:08,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:41:08,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:08,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:08,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:41:08,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:08,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:08,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:08,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:08,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:08,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:08,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:08,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,377 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:41:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-07-29 01:41:08,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:41:08,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:41:08,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 6 letters. [2020-07-29 01:41:08,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:08,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 179 transitions. cyclomatic complexity: 32 [2020-07-29 01:41:08,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:08,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 110 states and 135 transitions. [2020-07-29 01:41:08,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-07-29 01:41:08,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-07-29 01:41:08,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 135 transitions. [2020-07-29 01:41:08,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:41:08,400 INFO L688 BuchiCegarLoop]: Abstraction has 110 states and 135 transitions. [2020-07-29 01:41:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 135 transitions. [2020-07-29 01:41:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2020-07-29 01:41:08,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:08,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states and 135 transitions. Second operand 74 states. [2020-07-29 01:41:08,408 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states and 135 transitions. Second operand 74 states. [2020-07-29 01:41:08,408 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand 74 states. [2020-07-29 01:41:08,408 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:41:08,427 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2020-07-29 01:41:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2020-07-29 01:41:08,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:08,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:08,429 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 110 states and 135 transitions. [2020-07-29 01:41:08,429 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 110 states and 135 transitions. [2020-07-29 01:41:08,429 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:41:08,444 INFO L93 Difference]: Finished difference Result 161 states and 187 transitions. [2020-07-29 01:41:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2020-07-29 01:41:08,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:08,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:08,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:08,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-29 01:41:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2020-07-29 01:41:08,451 INFO L711 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2020-07-29 01:41:08,451 INFO L591 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2020-07-29 01:41:08,451 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:41:08,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2020-07-29 01:41:08,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:08,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:08,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:08,453 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:08,453 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:08,453 INFO L794 eck$LassoCheckResult]: Stem: 2255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2243#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 2244#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2263#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 2266#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2272#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2269#recFINAL assume true; 2262#recEXIT >#30#return; 2258#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 2259#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2267#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 2274#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2293#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 2246#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 2252#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2245#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2247#recFINAL assume true; 2315#recEXIT >#28#return; 2298#L15-1 #res := #t~ret5;havoc #t~ret5; 2292#recFINAL assume true; 2273#recEXIT >#30#return; 2256#L23-1 [2020-07-29 01:41:08,454 INFO L796 eck$LassoCheckResult]: Loop: 2256#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 2257#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2295#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 2299#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2294#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2296#recFINAL assume true; 2300#recEXIT >#30#return; 2256#L23-1 [2020-07-29 01:41:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:08,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1572162950, now seen corresponding path program 4 times [2020-07-29 01:41:08,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:08,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209036498] [2020-07-29 01:41:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:08,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:08,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:08,485 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 3 times [2020-07-29 01:41:08,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:08,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778966671] [2020-07-29 01:41:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:08,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:08,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:08,500 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1341076915, now seen corresponding path program 5 times [2020-07-29 01:41:08,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:08,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558117713] [2020-07-29 01:41:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:08,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:08,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:08,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:08,955 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2020-07-29 01:41:09,510 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2020-07-29 01:41:10,532 WARN L193 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 135 [2020-07-29 01:41:11,205 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-07-29 01:41:11,208 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:41:11,208 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:41:11,208 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:41:11,208 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:41:11,208 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:41:11,208 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:11,208 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:41:11,209 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:41:11,209 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration5_Lasso [2020-07-29 01:41:11,209 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:41:11,209 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:41:11,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:11,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:11,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:11,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:11,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-07-29 01:41:11,453 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2020-07-29 01:41:11,586 WARN L257 bleTransFormulaUtils]: 5 quantified variables [2020-07-29 01:41:11,586 WARN L257 bleTransFormulaUtils]: 5 quantified variables [2020-07-29 01:41:12,151 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2020-07-29 01:41:12,326 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:41:12,327 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:12,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:12,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:12,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:12,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:12,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:12,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:12,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:12,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:12,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:12,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:12,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:12,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:12,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:12,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:12,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:12,378 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:12,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:12,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:12,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:12,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:12,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:12,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:12,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:12,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:12,406 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 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:12,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:12,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:12,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:12,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:12,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:12,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:12,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:12,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:12,438 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:12,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:12,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:12,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:12,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:12,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:12,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:12,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:12,468 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:12,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:12,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:12,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:12,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:12,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:12,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:12,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:12,507 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:12,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:12,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:12,537 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:41:12,537 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:41:12,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:12,548 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2020-07-29 01:41:12,548 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:41:12,578 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:12,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:12,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:12,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:12,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:12,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:12,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:12,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:12,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:41:12,627 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:41:12,627 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:12,629 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:41:12,631 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:41:12,632 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:41:12,632 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 01:41:12,667 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:41:12,673 INFO L393 LassoCheck]: Loop: "main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9;" "assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8;" "call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#30#return;" [2020-07-29 01:41:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:12,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:41:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:12,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:12,777 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:41:12,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {2839#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2839#unseeded} is VALID [2020-07-29 01:41:12,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {2839#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {2839#unseeded} is VALID [2020-07-29 01:41:12,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {2839#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {2839#unseeded} is VALID [2020-07-29 01:41:12,781 INFO L263 TraceCheckUtils]: 3: Hoare triple {2839#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,782 INFO L280 TraceCheckUtils]: 5: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,784 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2839#unseeded} #30#return; {2839#unseeded} is VALID [2020-07-29 01:41:12,784 INFO L280 TraceCheckUtils]: 8: Hoare triple {2839#unseeded} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {2839#unseeded} is VALID [2020-07-29 01:41:12,787 INFO L280 TraceCheckUtils]: 9: Hoare triple {2839#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {2839#unseeded} is VALID [2020-07-29 01:41:12,791 INFO L263 TraceCheckUtils]: 10: Hoare triple {2839#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,793 INFO L280 TraceCheckUtils]: 11: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,794 INFO L280 TraceCheckUtils]: 12: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,800 INFO L263 TraceCheckUtils]: 13: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,801 INFO L280 TraceCheckUtils]: 14: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,802 INFO L280 TraceCheckUtils]: 15: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,803 INFO L280 TraceCheckUtils]: 16: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,805 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,805 INFO L280 TraceCheckUtils]: 18: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,806 INFO L280 TraceCheckUtils]: 19: Hoare triple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:12,807 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2881#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2839#unseeded} #30#return; {2839#unseeded} is VALID [2020-07-29 01:41:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:12,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:41:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:12,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:13,045 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-29 01:41:13,056 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:13,061 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:13,062 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:13,062 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2020-07-29 01:41:13,064 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:41:13,065 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, rec_~p.base, rec_~p.offset]. (let ((.cse0 (select (select |#memory_int| rec_~p.base) rec_~p.offset))) (and (<= (+ .cse0 1) 0) (<= |old(oldRank0)| oldRank0) (<= |rec_#res| .cse0))) [2020-07-29 01:41:13,065 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0)) [2020-07-29 01:41:13,086 INFO L280 TraceCheckUtils]: 0: Hoare triple {2842#(>= oldRank0 (+ |ULTIMATE.start_main_#t~ret9| ULTIMATE.start_main_~i~0))} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {2933#(<= ULTIMATE.start_main_~i~0 oldRank0)} is VALID [2020-07-29 01:41:13,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {2933#(<= ULTIMATE.start_main_~i~0 oldRank0)} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {2937#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:41:13,088 INFO L263 TraceCheckUtils]: 2: Hoare triple {2937#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {2941#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:41:13,089 INFO L280 TraceCheckUtils]: 3: Hoare triple {2941#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2945#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} is VALID [2020-07-29 01:41:13,090 INFO L280 TraceCheckUtils]: 4: Hoare triple {2945#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {2949#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:13,090 INFO L280 TraceCheckUtils]: 5: Hoare triple {2949#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} assume true; {2949#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:13,092 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2949#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} {2937#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} #30#return; {2867#(or (and (> oldRank0 (+ |ULTIMATE.start_main_#t~ret9| ULTIMATE.start_main_~i~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:41:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:13,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:41:13,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:13,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,136 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2020-07-29 01:41:13,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-07-29 01:41:13,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2020-07-29 01:41:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:41:13,442 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:13,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2020-07-29 01:41:13,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:13,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:13,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:41:13,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:13,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:13,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:13,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 139 transitions. [2020-07-29 01:41:13,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:13,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:13,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:13,447 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2020-07-29 01:41:13,448 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:41:13,448 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:41:13,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:13,450 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:41:13,450 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 118 states and 139 transitions. cyclomatic complexity: 28 [2020-07-29 01:41:13,451 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:41:13,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:13,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:13,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:13,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:13,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:13,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:13,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 118 letters. Loop has 118 letters. [2020-07-29 01:41:13,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 118 letters. Loop has 118 letters. [2020-07-29 01:41:13,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 118 letters. Loop has 118 letters. [2020-07-29 01:41:13,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 74 letters. Loop has 74 letters. [2020-07-29 01:41:13,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 74 letters. Loop has 74 letters. [2020-07-29 01:41:13,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 74 letters. Loop has 74 letters. [2020-07-29 01:41:13,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:13,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:13,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:13,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:13,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:13,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:13,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:13,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:13,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:13,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:13,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:13,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:13,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:13,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:13,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:13,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:13,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:13,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:13,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:13,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:13,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:13,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,469 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:41:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2020-07-29 01:41:13,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,471 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:41:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:13,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:41:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:13,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:13,573 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:41:13,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {2839#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2839#unseeded} is VALID [2020-07-29 01:41:13,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {2839#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {2839#unseeded} is VALID [2020-07-29 01:41:13,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {2839#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {2839#unseeded} is VALID [2020-07-29 01:41:13,578 INFO L263 TraceCheckUtils]: 3: Hoare triple {2839#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,579 INFO L280 TraceCheckUtils]: 4: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,579 INFO L280 TraceCheckUtils]: 5: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,580 INFO L280 TraceCheckUtils]: 6: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,581 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2839#unseeded} #30#return; {2839#unseeded} is VALID [2020-07-29 01:41:13,581 INFO L280 TraceCheckUtils]: 8: Hoare triple {2839#unseeded} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {2839#unseeded} is VALID [2020-07-29 01:41:13,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {2839#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {2839#unseeded} is VALID [2020-07-29 01:41:13,582 INFO L263 TraceCheckUtils]: 10: Hoare triple {2839#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,583 INFO L280 TraceCheckUtils]: 11: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,583 INFO L280 TraceCheckUtils]: 12: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,585 INFO L263 TraceCheckUtils]: 13: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,585 INFO L280 TraceCheckUtils]: 14: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,585 INFO L280 TraceCheckUtils]: 15: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,586 INFO L280 TraceCheckUtils]: 16: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,587 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,588 INFO L280 TraceCheckUtils]: 18: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,588 INFO L280 TraceCheckUtils]: 19: Hoare triple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:13,589 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3116#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2839#unseeded} #30#return; {2839#unseeded} is VALID [2020-07-29 01:41:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:13,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:41:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:13,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:13,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-29 01:41:13,830 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:13,835 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:13,836 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:13,836 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2020-07-29 01:41:13,839 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:41:13,839 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, rec_~p.base, rec_~p.offset]. (let ((.cse0 (select (select |#memory_int| rec_~p.base) rec_~p.offset))) (and (<= (+ .cse0 1) 0) (<= |old(oldRank0)| oldRank0) (<= |rec_#res| .cse0))) [2020-07-29 01:41:13,840 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0)) [2020-07-29 01:41:13,867 INFO L280 TraceCheckUtils]: 0: Hoare triple {2842#(>= oldRank0 (+ |ULTIMATE.start_main_#t~ret9| ULTIMATE.start_main_~i~0))} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {3168#(<= ULTIMATE.start_main_~i~0 oldRank0)} is VALID [2020-07-29 01:41:13,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {3168#(<= ULTIMATE.start_main_~i~0 oldRank0)} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {3172#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:41:13,869 INFO L263 TraceCheckUtils]: 2: Hoare triple {3172#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {3176#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:41:13,870 INFO L280 TraceCheckUtils]: 3: Hoare triple {3176#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3180#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} is VALID [2020-07-29 01:41:13,871 INFO L280 TraceCheckUtils]: 4: Hoare triple {3180#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3184#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:13,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {3184#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} assume true; {3184#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:13,875 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {3184#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} {3172#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} #30#return; {2867#(or (and (> oldRank0 (+ |ULTIMATE.start_main_#t~ret9| ULTIMATE.start_main_~i~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:41:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:13,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:41:13,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:13,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:13,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:13,921 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2020-07-29 01:41:13,922 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-07-29 01:41:14,191 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2020-07-29 01:41:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:41:14,191 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:14,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2020-07-29 01:41:14,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:14,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:14,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:41:14,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:14,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:14,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:14,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 139 transitions. [2020-07-29 01:41:14,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:14,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:14,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:14,196 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2020-07-29 01:41:14,196 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:41:14,197 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:41:14,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:14,198 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:41:14,198 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 118 states and 139 transitions. cyclomatic complexity: 28 [2020-07-29 01:41:14,199 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:41:14,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:14,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:14,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:14,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:14,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:14,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:14,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 118 letters. Loop has 118 letters. [2020-07-29 01:41:14,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 118 letters. Loop has 118 letters. [2020-07-29 01:41:14,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 118 letters. Loop has 118 letters. [2020-07-29 01:41:14,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 74 letters. Loop has 74 letters. [2020-07-29 01:41:14,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 74 letters. Loop has 74 letters. [2020-07-29 01:41:14,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 74 letters. Loop has 74 letters. [2020-07-29 01:41:14,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:14,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:14,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:14,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:14,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:14,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:14,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:14,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:14,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:14,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:14,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:14,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:14,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:14,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:14,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:14,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:14,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:14,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:14,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:14,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:14,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:14,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:14,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:14,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:14,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,216 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:41:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2020-07-29 01:41:14,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,218 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:41:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:14,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:41:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:14,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:14,338 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:41:14,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {2839#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2839#unseeded} is VALID [2020-07-29 01:41:14,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {2839#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {2839#unseeded} is VALID [2020-07-29 01:41:14,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {2839#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {2839#unseeded} is VALID [2020-07-29 01:41:14,342 INFO L263 TraceCheckUtils]: 3: Hoare triple {2839#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,343 INFO L280 TraceCheckUtils]: 6: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,344 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2839#unseeded} #30#return; {2839#unseeded} is VALID [2020-07-29 01:41:14,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {2839#unseeded} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {2839#unseeded} is VALID [2020-07-29 01:41:14,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {2839#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {2839#unseeded} is VALID [2020-07-29 01:41:14,347 INFO L263 TraceCheckUtils]: 10: Hoare triple {2839#unseeded} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,347 INFO L280 TraceCheckUtils]: 11: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,347 INFO L280 TraceCheckUtils]: 12: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,348 INFO L263 TraceCheckUtils]: 13: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,350 INFO L280 TraceCheckUtils]: 15: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,350 INFO L280 TraceCheckUtils]: 16: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,351 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,352 INFO L280 TraceCheckUtils]: 18: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,353 INFO L280 TraceCheckUtils]: 19: Hoare triple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:41:14,354 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2839#unseeded} #30#return; {2839#unseeded} is VALID [2020-07-29 01:41:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:14,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:41:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:14,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:14,584 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-29 01:41:14,595 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:14,600 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:14,600 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:14,600 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2020-07-29 01:41:14,604 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:41:14,604 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, rec_~p.base, rec_~p.offset]. (let ((.cse0 (select (select |#memory_int| rec_~p.base) rec_~p.offset))) (and (<= (+ .cse0 1) 0) (<= |old(oldRank0)| oldRank0) (<= |rec_#res| .cse0))) [2020-07-29 01:41:14,604 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0)) [2020-07-29 01:41:14,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {2842#(>= oldRank0 (+ |ULTIMATE.start_main_#t~ret9| ULTIMATE.start_main_~i~0))} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {3403#(<= ULTIMATE.start_main_~i~0 oldRank0)} is VALID [2020-07-29 01:41:14,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {3403#(<= ULTIMATE.start_main_~i~0 oldRank0)} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {3407#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:41:14,633 INFO L263 TraceCheckUtils]: 2: Hoare triple {3407#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {3411#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:41:14,634 INFO L280 TraceCheckUtils]: 3: Hoare triple {3411#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3415#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} is VALID [2020-07-29 01:41:14,635 INFO L280 TraceCheckUtils]: 4: Hoare triple {3415#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3419#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:14,636 INFO L280 TraceCheckUtils]: 5: Hoare triple {3419#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} assume true; {3419#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:14,638 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {3419#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} {3407#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} #30#return; {2867#(or (and (> oldRank0 (+ |ULTIMATE.start_main_#t~ret9| ULTIMATE.start_main_~i~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:41:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:14,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:41:14,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:14,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:14,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:14,684 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2020-07-29 01:41:14,684 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-07-29 01:41:14,992 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 143 states and 169 transitions. Complement of second has 22 states. [2020-07-29 01:41:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:41:14,993 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:14,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2020-07-29 01:41:14,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:14,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:14,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:41:14,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:14,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:14,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:14,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 169 transitions. [2020-07-29 01:41:14,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:41:14,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:14,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:14,997 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2020-07-29 01:41:14,998 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:41:14,998 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:41:14,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:14,999 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:41:15,000 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 143 states and 169 transitions. cyclomatic complexity: 34 [2020-07-29 01:41:15,000 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:41:15,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:15,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:15,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:15,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 13 letters. [2020-07-29 01:41:15,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 13 letters. [2020-07-29 01:41:15,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 13 letters. [2020-07-29 01:41:15,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 143 letters. Loop has 143 letters. [2020-07-29 01:41:15,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 143 letters. Loop has 143 letters. [2020-07-29 01:41:15,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 143 letters. Loop has 143 letters. [2020-07-29 01:41:15,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 74 letters. Loop has 74 letters. [2020-07-29 01:41:15,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 74 letters. Loop has 74 letters. [2020-07-29 01:41:15,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 74 letters. Loop has 74 letters. [2020-07-29 01:41:15,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:15,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:15,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:15,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:15,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:15,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 7 letters. [2020-07-29 01:41:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 7 letters. [2020-07-29 01:41:15,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:15,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:15,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:41:15,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 13 letters. [2020-07-29 01:41:15,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 13 letters. [2020-07-29 01:41:15,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 13 letters. [2020-07-29 01:41:15,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 13 letters. [2020-07-29 01:41:15,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 13 letters. [2020-07-29 01:41:15,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 13 letters. [2020-07-29 01:41:15,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 13 letters. [2020-07-29 01:41:15,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 13 letters. [2020-07-29 01:41:15,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 13 letters. [2020-07-29 01:41:15,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,017 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:41:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2020-07-29 01:41:15,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 7 letters. [2020-07-29 01:41:15,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2020-07-29 01:41:15,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 14 letters. [2020-07-29 01:41:15,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:15,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 169 transitions. cyclomatic complexity: 34 [2020-07-29 01:41:15,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:41:15,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 94 states and 109 transitions. [2020-07-29 01:41:15,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-07-29 01:41:15,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2020-07-29 01:41:15,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 109 transitions. [2020-07-29 01:41:15,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:41:15,030 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 109 transitions. [2020-07-29 01:41:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 109 transitions. [2020-07-29 01:41:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 32. [2020-07-29 01:41:15,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:15,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states and 109 transitions. Second operand 32 states. [2020-07-29 01:41:15,034 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states and 109 transitions. Second operand 32 states. [2020-07-29 01:41:15,035 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand 32 states. [2020-07-29 01:41:15,035 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:41:15,039 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2020-07-29 01:41:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2020-07-29 01:41:15,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:15,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:15,041 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 94 states and 109 transitions. [2020-07-29 01:41:15,041 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 94 states and 109 transitions. [2020-07-29 01:41:15,041 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:41:15,046 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2020-07-29 01:41:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2020-07-29 01:41:15,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:15,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:15,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:15,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 01:41:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-07-29 01:41:15,049 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-07-29 01:41:15,049 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-07-29 01:41:15,050 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:41:15,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2020-07-29 01:41:15,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:41:15,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:15,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:15,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:41:15,051 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:15,051 INFO L794 eck$LassoCheckResult]: Stem: 3613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3605#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 3606#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 3620#L23 [2020-07-29 01:41:15,052 INFO L796 eck$LassoCheckResult]: Loop: 3620#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 3621#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 3625#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 3600#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 3610#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 3599#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 3601#recFINAL assume true; 3622#recEXIT >#28#return; 3627#L15-1 #res := #t~ret5;havoc #t~ret5; 3626#recFINAL assume true; 3624#recEXIT >#30#return; 3614#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 3616#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 3620#L23 [2020-07-29 01:41:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash 37808, now seen corresponding path program 1 times [2020-07-29 01:41:15,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:15,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253646776] [2020-07-29 01:41:15,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:15,058 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:15,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:15,063 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash -669629144, now seen corresponding path program 1 times [2020-07-29 01:41:15,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:15,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963668398] [2020-07-29 01:41:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:15,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:15,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:15,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:15,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1720097319, now seen corresponding path program 6 times [2020-07-29 01:41:15,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:15,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942073167] [2020-07-29 01:41:15,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:15,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:15,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:15,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:15,421 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2020-07-29 01:41:15,895 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-07-29 01:41:16,138 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:41:16,138 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:41:16,139 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:41:16,139 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:41:16,139 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:41:16,139 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:16,139 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:41:16,139 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:41:16,140 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration6_Lasso [2020-07-29 01:41:16,140 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:41:16,140 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:41:16,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:16,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:16,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:16,408 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-07-29 01:41:16,411 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:41:16,411 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:41:16,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:16,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:16,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:16,957 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:41:16,957 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:16,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:16,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:16,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:16,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:16,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:16,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:16,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:16,969 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:16,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:16,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:16,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:16,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:16,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:16,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:16,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:16,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:16,993 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:17,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:17,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:17,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:17,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:17,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:17,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:17,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:17,031 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:17,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:17,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:17,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:17,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:17,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:17,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:17,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:17,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:17,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:17,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:17,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:17,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:17,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:17,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:17,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:17,090 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:17,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:17,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:17,114 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:41:17,114 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:41:17,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:17,122 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:41:17,122 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:41:17,142 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:17,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:41:17,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:17,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:17,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:17,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:17,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:17,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:17,178 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:41:17,187 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:41:17,187 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:17,191 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:41:17,193 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:41:17,193 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:41:17,193 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 01:41:17,227 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:41:17,232 INFO L393 LassoCheck]: Loop: "call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3;" "call #t~ret5 := rec(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#28#return;" "#res := #t~ret5;havoc #t~ret5;" "assume true;" >"#30#return;" "main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9;" "assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8;" [2020-07-29 01:41:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:17,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:41:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:17,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:17,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {3993#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3993#unseeded} is VALID [2020-07-29 01:41:17,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {3993#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; {3993#unseeded} is VALID [2020-07-29 01:41:17,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {3993#unseeded} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {3993#unseeded} is VALID [2020-07-29 01:41:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:17,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-29 01:41:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:17,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:17,436 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-29 01:41:17,447 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:17,452 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:17,452 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:17,453 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2020-07-29 01:41:17,455 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:41:17,455 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, rec_~p.base, rec_~p.offset]. (let ((.cse0 (select (select |#memory_int| rec_~p.base) rec_~p.offset))) (and (<= (+ .cse0 1) 0) (<= |old(oldRank0)| oldRank0) (<= |rec_#res| .cse0))) [2020-07-29 01:41:17,456 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0)) [2020-07-29 01:41:17,729 INFO L263 TraceCheckUtils]: 0: Hoare triple {3996#(>= oldRank0 ULTIMATE.start_main_~i~0)} call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset); {4032#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:41:17,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {4032#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {4032#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:41:17,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {4032#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; {4032#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:41:17,731 INFO L263 TraceCheckUtils]: 3: Hoare triple {4032#(<= |old(oldRank0)| oldRank0)} call #t~ret5 := rec(~p.base, ~p.offset); {4032#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:41:17,732 INFO L280 TraceCheckUtils]: 4: Hoare triple {4032#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {4045#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} is VALID [2020-07-29 01:41:17,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {4045#(and (<= |old(oldRank0)| oldRank0) (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {4049#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:17,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {4049#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} assume true; {4049#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:17,741 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {4049#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} {4032#(<= |old(oldRank0)| oldRank0)} #28#return; {4056#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2020-07-29 01:41:17,742 INFO L280 TraceCheckUtils]: 8: Hoare triple {4056#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#t~ret5| 1) 0))} #res := #t~ret5;havoc #t~ret5; {4049#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:17,743 INFO L280 TraceCheckUtils]: 9: Hoare triple {4049#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} assume true; {4049#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} is VALID [2020-07-29 01:41:17,744 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {4049#(and (<= |old(oldRank0)| oldRank0) (<= (+ |rec_#res| 1) 0))} {3996#(>= oldRank0 ULTIMATE.start_main_~i~0)} #30#return; {4066#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ret9| 1) 0))} is VALID [2020-07-29 01:41:17,745 INFO L280 TraceCheckUtils]: 11: Hoare triple {4066#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ret9| 1) 0))} main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; {4070#(<= (+ ULTIMATE.start_main_~i~0 1) oldRank0)} is VALID [2020-07-29 01:41:17,747 INFO L280 TraceCheckUtils]: 12: Hoare triple {4070#(<= (+ ULTIMATE.start_main_~i~0 1) oldRank0)} assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; {4021#(or (and (> oldRank0 ULTIMATE.start_main_~i~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:41:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:41:17,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:41:17,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:17,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 13 letters. [2020-07-29 01:41:17,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:17,781 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-07-29 01:41:17,781 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand 8 states. [2020-07-29 01:41:18,008 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 69 states and 86 transitions. Complement of second has 22 states. [2020-07-29 01:41:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-07-29 01:41:18,009 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:18,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. cyclomatic complexity: 8 [2020-07-29 01:41:18,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:18,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:18,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:41:18,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:18,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:18,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:18,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 86 transitions. [2020-07-29 01:41:18,012 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:41:18,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:41:18,012 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 38 transitions. cyclomatic complexity: 8 [2020-07-29 01:41:18,013 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:41:18,013 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:41:18,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:41:18,014 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:41:18,014 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 69 states and 86 transitions. cyclomatic complexity: 21 [2020-07-29 01:41:18,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 86 transitions. cyclomatic complexity: 21 [2020-07-29 01:41:18,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:41:18,015 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:41:18,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 13 letters. [2020-07-29 01:41:18,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 13 letters. [2020-07-29 01:41:18,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 13 letters. [2020-07-29 01:41:18,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:41:18,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:41:18,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:41:18,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 69 letters. Loop has 69 letters. [2020-07-29 01:41:18,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 69 letters. Loop has 69 letters. [2020-07-29 01:41:18,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 69 letters. Loop has 69 letters. [2020-07-29 01:41:18,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:41:18,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:41:18,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:41:18,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:18,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:18,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:41:18,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:41:18,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:41:18,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 13 letters. [2020-07-29 01:41:18,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 13 letters. [2020-07-29 01:41:18,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 13 letters. [2020-07-29 01:41:18,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 13 letters. [2020-07-29 01:41:18,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 13 letters. [2020-07-29 01:41:18,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 14 letters. Loop has 13 letters. [2020-07-29 01:41:18,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 13 letters. [2020-07-29 01:41:18,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 13 letters. [2020-07-29 01:41:18,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 14 letters. Loop has 13 letters. [2020-07-29 01:41:18,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 13 letters. [2020-07-29 01:41:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:41:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:41:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:41:18,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,027 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:41:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2020-07-29 01:41:18,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 13 letters. [2020-07-29 01:41:18,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 16 letters. Loop has 13 letters. [2020-07-29 01:41:18,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 26 letters. [2020-07-29 01:41:18,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:18,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 86 transitions. cyclomatic complexity: 21 [2020-07-29 01:41:18,032 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:41:18,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2020-07-29 01:41:18,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:41:18,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:41:18,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:41:18,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:18,033 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:41:18,033 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:41:18,033 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:41:18,034 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:41:18,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:41:18,034 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:41:18,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:41:18,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:41:18 BoogieIcfgContainer [2020-07-29 01:41:18,041 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:41:18,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:41:18,042 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:41:18,042 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:41:18,043 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:40:23" (3/4) ... [2020-07-29 01:41:18,046 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:41:18,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:41:18,048 INFO L168 Benchmark]: Toolchain (without parser) took 55570.14 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 462.9 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -58.1 MB). Peak memory consumption was 404.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:18,049 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:41:18,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.88 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:18,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:18,050 INFO L168 Benchmark]: Boogie Preprocessor took 26.29 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-07-29 01:41:18,051 INFO L168 Benchmark]: RCFGBuilder took 350.77 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:18,052 INFO L168 Benchmark]: BuchiAutomizer took 54830.80 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.2 MB). Peak memory consumption was 408.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:18,052 INFO L168 Benchmark]: Witness Printer took 5.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:41:18,054 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.88 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.29 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. * RCFGBuilder took 350.77 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 54830.80 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.2 MB). Peak memory consumption was 408.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function i and consists of 9 locations. One deterministic module has affine ranking function 2 * \old(unknown-#memory_int-unknown)[p][p] + 3 and consists of 5 locations. One deterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. One deterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 54.7s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 34.5s. Construction of modules took 1.1s. Büchi inclusion checks took 18.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 111 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 82 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 127 SDtfs, 146 SDslu, 118 SDs, 0 SdLazy, 385 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital171 mio100 ax100 hnf99 lsp95 ukn64 mio100 lsp30 div100 bol100 ite100 ukn100 eq177 hnf89 smp96 dnf152 smp90 tf100 neg93 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 4 VariablesLoop: 5 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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...