./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_ex1.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 97c126101f069ab488324cfc4632ee48c30de136646e991b84ddea84d63344d8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:24:57,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:24:57,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:24:57,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:24:57,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:24:57,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:24:57,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:24:57,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:24:57,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:24:57,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:24:57,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:24:57,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:24:57,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:24:57,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:24:57,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:24:57,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:24:57,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:24:57,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:24:57,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:24:57,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:24:57,998 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:24:57,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:24:58,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:24:58,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:24:58,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:24:58,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:24:58,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:24:58,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:24:58,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:24:58,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:24:58,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:24:58,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:24:58,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:24:58,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:24:58,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:24:58,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:24:58,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:24:58,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:24:58,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:24:58,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:24:58,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:24:58,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:24:58,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:24:58,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:24:58,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:24:58,051 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:24:58,051 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:24:58,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:24:58,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:24:58,053 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:24:58,054 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:24:58,054 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:24:58,055 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:24:58,055 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:24:58,055 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:24:58,055 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:24:58,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:24:58,056 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:24:58,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:24:58,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:24:58,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:24:58,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:24:58,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:24:58,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:24:58,057 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:24:58,057 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:24:58,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:24:58,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:24:58,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:24:58,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:24:58,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:24:58,074 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:24:58,074 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 97c126101f069ab488324cfc4632ee48c30de136646e991b84ddea84d63344d8 [2022-07-13 03:24:58,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:24:58,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:24:58,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:24:58,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:24:58,320 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:24:58,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2022-07-13 03:24:58,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f83efc7a/536d912dc01249f18adf73a3cc26325f/FLAG214f732bc [2022-07-13 03:24:58,728 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:24:58,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2022-07-13 03:24:58,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f83efc7a/536d912dc01249f18adf73a3cc26325f/FLAG214f732bc [2022-07-13 03:24:59,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f83efc7a/536d912dc01249f18adf73a3cc26325f [2022-07-13 03:24:59,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:24:59,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:24:59,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:24:59,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:24:59,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:24:59,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d28c3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59, skipping insertion in model container [2022-07-13 03:24:59,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:24:59,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:24:59,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:24:59,312 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:24:59,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:24:59,335 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:24:59,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59 WrapperNode [2022-07-13 03:24:59,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:24:59,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:24:59,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:24:59,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:24:59,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,365 INFO L137 Inliner]: procedures = 11, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-07-13 03:24:59,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:24:59,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:24:59,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:24:59,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:24:59,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:24:59,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:24:59,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:24:59,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:24:59,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (1/1) ... [2022-07-13 03:24:59,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:24:59,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:24:59,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:24:59,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:24:59,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:24:59,505 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-07-13 03:24:59,505 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-07-13 03:24:59,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 03:24:59,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:24:59,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:24:59,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:24:59,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:24:59,557 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:24:59,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:24:59,683 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:24:59,688 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:24:59,688 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:24:59,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:24:59 BoogieIcfgContainer [2022-07-13 03:24:59,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:24:59,691 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:24:59,691 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:24:59,694 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:24:59,694 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:59,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:24:59" (1/3) ... [2022-07-13 03:24:59,695 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17c3e671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:24:59, skipping insertion in model container [2022-07-13 03:24:59,696 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:59,696 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:24:59" (2/3) ... [2022-07-13 03:24:59,696 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17c3e671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:24:59, skipping insertion in model container [2022-07-13 03:24:59,696 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:24:59,696 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:24:59" (3/3) ... [2022-07-13 03:24:59,698 INFO L354 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex1.i [2022-07-13 03:24:59,742 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:24:59,742 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:24:59,743 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:24:59,743 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:24:59,743 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:24:59,743 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:24:59,743 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:24:59,743 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:24:59,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 03:24:59,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:24:59,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:59,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:59,769 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:24:59,769 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:59,770 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:24:59,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 03:24:59,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:24:59,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:24:59,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:24:59,773 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:24:59,773 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:24:59,778 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 12#L28-3true [2022-07-13 03:24:59,779 INFO L754 eck$LassoCheckResult]: Loop: 12#L28-3true call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 10#L28-1true assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 4#L31true call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 11#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 9#L9true assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 15#recFINALtrue assume true; 14#recEXITtrue >#33#return; 13#L31-1true havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 12#L28-3true [2022-07-13 03:24:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2022-07-13 03:24:59,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:24:59,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68243000] [2022-07-13 03:24:59,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:24:59,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:24:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:59,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:24:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:24:59,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:24:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:24:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2022-07-13 03:24:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:00,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739472753] [2022-07-13 03:25:00,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:00,061 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:00,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:00,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1890018113, now seen corresponding path program 1 times [2022-07-13 03:25:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:00,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270631750] [2022-07-13 03:25:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 03:25:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:25:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:00,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270631750] [2022-07-13 03:25:00,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270631750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:25:00,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:25:00,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 03:25:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106625993] [2022-07-13 03:25:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:25:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 03:25:00,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 03:25:00,977 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 03:25:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:01,079 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-07-13 03:25:01,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 03:25:01,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2022-07-13 03:25:01,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:25:01,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2022-07-13 03:25:01,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 03:25:01,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 03:25:01,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-07-13 03:25:01,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:25:01,102 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-13 03:25:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-07-13 03:25:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-13 03:25:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 03:25:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-13 03:25:01,123 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-13 03:25:01,123 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-13 03:25:01,124 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:25:01,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-07-13 03:25:01,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:25:01,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:01,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:01,125 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:25:01,126 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:01,126 INFO L752 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 59#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 66#L28-3 [2022-07-13 03:25:01,126 INFO L754 eck$LassoCheckResult]: Loop: 66#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 64#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 62#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 65#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 60#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 61#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 65#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 60#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 63#recFINAL assume true; 67#recEXIT >#31#return; 68#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 70#recFINAL assume true; 71#recEXIT >#33#return; 69#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 66#L28-3 [2022-07-13 03:25:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:01,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2022-07-13 03:25:01,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:01,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750383330] [2022-07-13 03:25:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:01,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:01,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:01,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:01,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2022-07-13 03:25:01,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:01,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679580955] [2022-07-13 03:25:01,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:01,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:25:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:25:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 03:25:01,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:01,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679580955] [2022-07-13 03:25:01,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679580955] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:01,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508628858] [2022-07-13 03:25:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:01,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:01,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:01,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:25:01,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 03:25:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:01,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 03:25:01,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:01,568 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-13 03:25:01,569 INFO L390 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 1 case distinctions, treesize of input 43 treesize of output 26 [2022-07-13 03:25:02,543 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_rec_#in~i| 0) (exists ((v_ArrVal_102 (Array Int Int))) (= (store |c_old(#memory_int)| |c_rec_#in~op.base| v_ArrVal_102) |c_#memory_int|))) is different from true [2022-07-13 03:25:02,696 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 03:25:02,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-13 03:25:02,703 INFO L390 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 [2022-07-13 03:25:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 03:25:02,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:25:02,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508628858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:02,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 03:25:02,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2022-07-13 03:25:02,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046760484] [2022-07-13 03:25:02,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 03:25:02,856 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:25:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:02,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 03:25:02,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=228, Unknown=2, NotChecked=30, Total=306 [2022-07-13 03:25:02,859 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 03:25:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:03,708 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-07-13 03:25:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 03:25:03,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2022-07-13 03:25:03,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:25:03,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2022-07-13 03:25:03,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-13 03:25:03,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 03:25:03,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2022-07-13 03:25:03,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:25:03,712 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-13 03:25:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2022-07-13 03:25:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 03:25:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 03:25:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-13 03:25:03,715 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-13 03:25:03,715 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-13 03:25:03,715 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:25:03,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2022-07-13 03:25:03,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:25:03,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:03,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:03,716 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:25:03,716 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:03,716 INFO L752 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 186#L28-3 [2022-07-13 03:25:03,717 INFO L754 eck$LassoCheckResult]: Loop: 186#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 181#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 178#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 177#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 179#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 177#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 179#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 177#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 180#recFINAL assume true; 183#recEXIT >#31#return; 184#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 187#recFINAL assume true; 191#recEXIT >#31#return; 189#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 190#recFINAL assume true; 188#recEXIT >#33#return; 185#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 186#L28-3 [2022-07-13 03:25:03,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:03,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2022-07-13 03:25:03,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:03,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302944754] [2022-07-13 03:25:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:03,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:03,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:03,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:03,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2022-07-13 03:25:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:03,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498779195] [2022-07-13 03:25:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:25:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:25:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 03:25:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 03:25:04,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:04,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498779195] [2022-07-13 03:25:04,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498779195] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:04,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602027763] [2022-07-13 03:25:04,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:25:04,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:04,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:04,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:25:04,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 03:25:04,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:25:04,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:25:04,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 03:25:04,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:04,150 INFO L390 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 36 treesize of output 28 [2022-07-13 03:25:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:25:04,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:25:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 03:25:04,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602027763] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:25:04,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:25:04,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 21 [2022-07-13 03:25:04,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929065960] [2022-07-13 03:25:04,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:25:04,647 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:25:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 03:25:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-07-13 03:25:04,648 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 7 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-13 03:25:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:04,803 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-07-13 03:25:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 03:25:04,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2022-07-13 03:25:04,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:25:04,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2022-07-13 03:25:04,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-13 03:25:04,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-13 03:25:04,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2022-07-13 03:25:04,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:25:04,807 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-13 03:25:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2022-07-13 03:25:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 03:25:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 03:25:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-13 03:25:04,811 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-13 03:25:04,811 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-13 03:25:04,811 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:25:04,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2022-07-13 03:25:04,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-13 03:25:04,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:04,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:04,813 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:25:04,813 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-07-13 03:25:04,813 INFO L752 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 389#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 399#L28-3 [2022-07-13 03:25:04,814 INFO L754 eck$LassoCheckResult]: Loop: 399#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 394#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 391#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 392#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 392#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 392#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 393#recFINAL assume true; 396#recEXIT >#31#return; 397#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 400#recFINAL assume true; 407#recEXIT >#31#return; 406#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 405#recFINAL assume true; 404#recEXIT >#31#return; 402#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 403#recFINAL assume true; 401#recEXIT >#33#return; 398#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 399#L28-3 [2022-07-13 03:25:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2022-07-13 03:25:04,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:04,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427121460] [2022-07-13 03:25:04,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:04,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:04,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:04,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1161179343, now seen corresponding path program 3 times [2022-07-13 03:25:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:04,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598597880] [2022-07-13 03:25:04,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:04,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:04,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:04,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1853588851, now seen corresponding path program 1 times [2022-07-13 03:25:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:04,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359272549] [2022-07-13 03:25:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:04,917 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:04,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:07,416 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:25:07,417 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:25:07,417 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:25:07,417 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:25:07,417 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:25:07,417 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:07,417 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:25:07,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:25:07,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex1.i_Iteration4_Lasso [2022-07-13 03:25:07,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:25:07,418 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:25:07,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:07,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:25:08,035 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:25:08,039 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:25:08,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 03:25:08,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 03:25:08,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 03:25:08,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,204 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 03:25:08,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,233 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 03:25:08,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:08,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:08,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 03:25:08,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,367 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 03:25:08,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,394 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 03:25:08,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,426 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 03:25:08,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:08,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:08,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:08,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,480 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 03:25:08,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:08,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:08,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:08,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,523 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 03:25:08,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:08,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:08,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:08,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:08,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:08,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:08,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:08,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:25:08,605 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-13 03:25:08,605 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-13 03:25:08,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:08,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:08,608 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:08,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 03:25:08,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:25:08,632 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:25:08,632 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:25:08,633 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1 Supporting invariants [] [2022-07-13 03:25:08,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:08,672 INFO L293 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-07-13 03:25:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:08,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:25:08,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:08,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-13 03:25:08,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:08,848 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-13 03:25:08,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 84 [2022-07-13 03:25:08,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2022-07-13 03:25:08,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 03:25:08,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-07-13 03:25:08,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 03:25:09,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 03:25:09,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 03:25:09,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:09,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-13 03:25:09,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:09,581 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 03:25:09,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 38 [2022-07-13 03:25:09,616 INFO L356 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2022-07-13 03:25:09,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 52 [2022-07-13 03:25:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 1 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 03:25:09,677 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 17 loop predicates [2022-07-13 03:25:09,677 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 03:25:09,747 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 28 states and 32 transitions. Complement of second has 9 states. [2022-07-13 03:25:09,748 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 [2022-07-13 03:25:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 03:25:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2022-07-13 03:25:09,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 2 letters. Loop has 26 letters. [2022-07-13 03:25:09,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:09,752 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:25:09,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:09,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:25:09,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:09,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-13 03:25:09,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:09,890 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-13 03:25:09,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 84 [2022-07-13 03:25:09,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2022-07-13 03:25:09,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 03:25:09,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 03:25:09,950 INFO L390 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 44 treesize of output 17 [2022-07-13 03:25:09,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-13 03:25:10,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:10,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2022-07-13 03:25:10,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 03:25:10,403 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 03:25:10,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 03:25:10,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:10,527 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 03:25:10,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 26 [2022-07-13 03:25:10,878 INFO L356 Elim1Store]: treesize reduction 167, result has 35.8 percent of original size [2022-07-13 03:25:10,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 129 treesize of output 234 [2022-07-13 03:25:11,026 INFO L356 Elim1Store]: treesize reduction 8, result has 93.4 percent of original size [2022-07-13 03:25:11,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 246 treesize of output 346 [2022-07-13 03:25:11,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:12,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:12,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:12,653 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:12,659 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:12,695 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:12,700 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:12,746 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:12,844 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:13,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:13,062 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:13,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:13,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-13 03:25:13,128 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:13,152 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:13,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:13,197 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:13,202 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:13,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:13,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-13 03:25:13,241 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:13,258 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:13,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:13,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:13,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:13,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:13,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:13,507 INFO L356 Elim1Store]: treesize reduction 120, result has 14.9 percent of original size [2022-07-13 03:25:13,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 108 [2022-07-13 03:25:13,740 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 03:25:13,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-13 03:25:13,779 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 03:25:13,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-13 03:25:14,155 INFO L356 Elim1Store]: treesize reduction 123, result has 16.3 percent of original size [2022-07-13 03:25:14,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 111 [2022-07-13 03:25:14,602 INFO L356 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2022-07-13 03:25:14,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2022-07-13 03:25:15,414 INFO L356 Elim1Store]: treesize reduction 580, result has 10.4 percent of original size [2022-07-13 03:25:15,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 159 treesize of output 240 [2022-07-13 03:25:16,304 INFO L356 Elim1Store]: treesize reduction 876, result has 0.1 percent of original size [2022-07-13 03:25:16,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 29 case distinctions, treesize of input 106 treesize of output 31 [2022-07-13 03:25:16,792 INFO L356 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2022-07-13 03:25:16,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2022-07-13 03:25:16,831 INFO L356 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2022-07-13 03:25:16,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2022-07-13 03:25:17,158 INFO L356 Elim1Store]: treesize reduction 320, result has 15.1 percent of original size [2022-07-13 03:25:17,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 159 treesize of output 230 [2022-07-13 03:25:17,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:18,132 INFO L356 Elim1Store]: treesize reduction 453, result has 0.2 percent of original size [2022-07-13 03:25:18,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 99 treesize of output 26 [2022-07-13 03:25:18,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 03:25:18,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 1 [2022-07-13 03:25:19,203 INFO L356 Elim1Store]: treesize reduction 185, result has 0.5 percent of original size [2022-07-13 03:25:19,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 11 [2022-07-13 03:25:19,250 INFO L356 Elim1Store]: treesize reduction 221, result has 0.5 percent of original size [2022-07-13 03:25:19,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 11 [2022-07-13 03:25:19,317 INFO L356 Elim1Store]: treesize reduction 230, result has 0.4 percent of original size [2022-07-13 03:25:19,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 11 [2022-07-13 03:25:19,352 INFO L356 Elim1Store]: treesize reduction 123, result has 0.8 percent of original size [2022-07-13 03:25:19,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 5 [2022-07-13 03:25:19,389 INFO L356 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-07-13 03:25:19,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 5 [2022-07-13 03:25:19,421 INFO L356 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2022-07-13 03:25:19,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 5 [2022-07-13 03:25:19,449 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-07-13 03:25:19,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 5 [2022-07-13 03:25:19,471 INFO L356 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-07-13 03:25:19,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 5 [2022-07-13 03:25:19,527 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 03:25:19,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 11 [2022-07-13 03:25:19,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:19,556 INFO L356 Elim1Store]: treesize reduction 117, result has 0.8 percent of original size [2022-07-13 03:25:19,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 11 [2022-07-13 03:25:19,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:19,588 INFO L356 Elim1Store]: treesize reduction 114, result has 0.9 percent of original size [2022-07-13 03:25:19,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 11 [2022-07-13 03:25:19,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:19,612 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-13 03:25:19,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 5 [2022-07-13 03:25:19,672 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-07-13 03:25:19,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2022-07-13 03:25:19,700 INFO L356 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2022-07-13 03:25:19,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2022-07-13 03:25:19,774 INFO L356 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2022-07-13 03:25:19,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 5 [2022-07-13 03:25:19,825 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-13 03:25:19,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 5 [2022-07-13 03:25:19,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:19,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 03:25:19,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 1 [2022-07-13 03:25:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 03:25:20,875 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 19 loop predicates [2022-07-13 03:25:20,875 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 03:25:20,931 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 29 states and 33 transitions. Complement of second has 11 states. [2022-07-13 03:25:20,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-13 03:25:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 03:25:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2022-07-13 03:25:20,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. Stem has 2 letters. Loop has 26 letters. [2022-07-13 03:25:20,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:20,933 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:25:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:20,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:25:20,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:21,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-13 03:25:21,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:21,074 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-13 03:25:21,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 84 [2022-07-13 03:25:21,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 03:25:21,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 18 [2022-07-13 03:25:21,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 22 [2022-07-13 03:25:21,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-13 03:25:21,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 03:25:21,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 03:25:21,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-13 03:25:21,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:21,693 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 03:25:21,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-07-13 03:25:21,734 INFO L356 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2022-07-13 03:25:21,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 52 [2022-07-13 03:25:21,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 03:25:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 8 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 03:25:21,805 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 17 loop predicates [2022-07-13 03:25:21,806 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 03:25:21,860 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 28 states and 32 transitions. Complement of second has 9 states. [2022-07-13 03:25:21,862 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 [2022-07-13 03:25:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 03:25:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-07-13 03:25:21,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 26 letters. [2022-07-13 03:25:21,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:21,866 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:25:21,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:21,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:25:21,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:21,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-13 03:25:21,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:21,997 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-13 03:25:21,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 84 [2022-07-13 03:25:22,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2022-07-13 03:25:22,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 03:25:22,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-07-13 03:25:22,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 03:25:22,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 03:25:22,421 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 03:25:22,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-13 03:25:22,614 INFO L356 Elim1Store]: treesize reduction 175, result has 32.7 percent of original size [2022-07-13 03:25:22,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 83 treesize of output 186 [2022-07-13 03:25:22,755 INFO L356 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2022-07-13 03:25:22,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 303 treesize of output 447 [2022-07-13 03:25:25,374 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,378 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,385 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,392 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,397 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,404 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,413 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,420 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,431 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,439 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,460 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,468 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:25,510 INFO L356 Elim1Store]: treesize reduction 229, result has 3.4 percent of original size [2022-07-13 03:25:25,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 111 [2022-07-13 03:25:25,556 INFO L356 Elim1Store]: treesize reduction 239, result has 0.4 percent of original size [2022-07-13 03:25:25,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 103 [2022-07-13 03:25:25,611 INFO L356 Elim1Store]: treesize reduction 218, result has 0.5 percent of original size [2022-07-13 03:25:25,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 103 [2022-07-13 03:25:25,653 INFO L356 Elim1Store]: treesize reduction 200, result has 0.5 percent of original size [2022-07-13 03:25:25,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 103 [2022-07-13 03:25:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 03:25:25,856 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 16 loop predicates [2022-07-13 03:25:25,856 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 03:25:25,914 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 29 states and 33 transitions. Complement of second has 11 states. [2022-07-13 03:25:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-13 03:25:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 03:25:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-07-13 03:25:25,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 2 letters. Loop has 26 letters. [2022-07-13 03:25:25,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:25,925 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:25:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:25,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:25:25,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:26,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-13 03:25:26,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:26,039 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-13 03:25:26,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 84 [2022-07-13 03:25:26,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 03:25:26,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 18 [2022-07-13 03:25:26,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 03:25:26,073 INFO L390 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 35 treesize of output 9 [2022-07-13 03:25:26,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 03:25:26,171 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:26,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 03:25:26,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:26,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 03:25:26,491 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 03:25:26,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-13 03:25:26,613 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 03:25:26,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 52 treesize of output 58 [2022-07-13 03:25:27,035 INFO L356 Elim1Store]: treesize reduction 223, result has 36.1 percent of original size [2022-07-13 03:25:27,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 140 treesize of output 335 [2022-07-13 03:25:27,415 INFO L356 Elim1Store]: treesize reduction 8, result has 96.4 percent of original size [2022-07-13 03:25:27,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 375 treesize of output 575 [2022-07-13 03:25:27,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:25:37,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:37,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:37,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:37,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 03:25:37,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,200 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,308 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:38,363 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:38,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-13 03:25:38,390 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,404 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,434 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:38,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-13 03:25:38,547 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:38,629 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,650 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:38,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-13 03:25:38,676 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,689 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,706 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,725 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:38,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:38,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-13 03:25:38,953 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,253 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,394 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,422 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:39,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-13 03:25:39,491 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:39,525 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,581 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,600 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,620 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:25:39,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-13 03:25:39,674 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:39,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:39,709 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:40,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:40,059 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:40,222 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:40,275 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:40,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:40,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:40,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:40,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-13 03:25:42,593 INFO L356 Elim1Store]: treesize reduction 579, result has 4.0 percent of original size [2022-07-13 03:25:42,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 13 case distinctions, treesize of input 1058 treesize of output 1006 [2022-07-13 03:25:44,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:44,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:44,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:25:44,826 INFO L356 Elim1Store]: treesize reduction 623, result has 0.2 percent of original size [2022-07-13 03:25:44,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 13 case distinctions, treesize of input 1058 treesize of output 983 [2022-07-13 03:25:44,876 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:44,888 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:44,954 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:44,958 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:44,974 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:44,984 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:45,015 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:45,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 03:25:47,651 INFO L356 Elim1Store]: treesize reduction 643, result has 1.2 percent of original size [2022-07-13 03:25:47,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 13 case distinctions, treesize of input 1058 treesize of output 991 [2022-07-13 03:25:47,870 INFO L356 Elim1Store]: treesize reduction 554, result has 0.2 percent of original size [2022-07-13 03:25:47,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 13 case distinctions, treesize of input 1058 treesize of output 983 [2022-07-13 03:25:48,118 INFO L356 Elim1Store]: treesize reduction 627, result has 3.7 percent of original size [2022-07-13 03:25:48,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 13 case distinctions, treesize of input 1058 treesize of output 1006 [2022-07-13 03:25:56,938 INFO L356 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-07-13 03:25:56,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 1 [2022-07-13 03:26:01,919 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No Interpolants at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:204) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.refineBuchiAndReportRankingFunction(AbstractBuchiCegarLoop.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:358) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 03:26:01,921 INFO L158 Benchmark]: Toolchain (without parser) took 62769.89ms. Allocated memory was 88.1MB in the beginning and 209.7MB in the end (delta: 121.6MB). Free memory was 45.3MB in the beginning and 87.7MB in the end (delta: -42.4MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. [2022-07-13 03:26:01,921 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 88.1MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:26:01,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.54ms. Allocated memory is still 88.1MB. Free memory was 45.1MB in the beginning and 59.1MB in the end (delta: -14.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 03:26:01,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.91ms. Allocated memory is still 88.1MB. Free memory was 59.1MB in the beginning and 57.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:26:01,921 INFO L158 Benchmark]: Boogie Preprocessor took 39.68ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 56.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:26:01,921 INFO L158 Benchmark]: RCFGBuilder took 282.97ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 45.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:26:01,922 INFO L158 Benchmark]: BuchiAutomizer took 62229.37ms. Allocated memory was 88.1MB in the beginning and 209.7MB in the end (delta: 121.6MB). Free memory was 45.5MB in the beginning and 87.7MB in the end (delta: -42.2MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2022-07-13 03:26:01,922 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 88.1MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.54ms. Allocated memory is still 88.1MB. Free memory was 45.1MB in the beginning and 59.1MB in the end (delta: -14.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.91ms. Allocated memory is still 88.1MB. Free memory was 59.1MB in the beginning and 57.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.68ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 56.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 282.97ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 45.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 62229.37ms. Allocated memory was 88.1MB in the beginning and 209.7MB in the end (delta: 121.6MB). Free memory was 45.5MB in the beginning and 87.7MB in the end (delta: -42.2MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: No Interpolants de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No Interpolants: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:150) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 03:26:01,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 03:26:02,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 03:26:02,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: No Interpolants