./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/ldv-memsafety/memleaks_test18_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12544117846b274bd1cb12a6694f8fda1d77f0b1327b2e9a353cfe44563b100a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 03:14:32,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 03:14:32,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 03:14:32,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 03:14:32,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 03:14:32,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 03:14:32,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 03:14:32,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 03:14:32,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 03:14:32,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 03:14:32,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 03:14:32,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 03:14:32,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 03:14:32,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 03:14:32,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 03:14:32,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 03:14:32,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 03:14:32,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 03:14:32,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 03:14:32,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 03:14:32,363 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 03:14:32,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 03:14:32,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 03:14:32,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 03:14:32,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 03:14:32,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 03:14:32,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 03:14:32,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 03:14:32,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 03:14:32,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 03:14:32,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 03:14:32,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 03:14:32,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 03:14:32,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 03:14:32,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 03:14:32,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 03:14:32,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 03:14:32,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 03:14:32,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 03:14:32,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 03:14:32,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 03:14:32,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 03:14:32,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 03:14:32,416 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 03:14:32,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 03:14:32,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 03:14:32,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 03:14:32,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 03:14:32,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 03:14:32,418 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 03:14:32,419 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 03:14:32,419 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 03:14:32,419 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 03:14:32,420 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 03:14:32,420 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 03:14:32,420 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 03:14:32,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 03:14:32,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 03:14:32,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 03:14:32,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 03:14:32,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 03:14:32,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 03:14:32,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 03:14:32,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 03:14:32,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 03:14:32,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 03:14:32,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 03:14:32,422 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 03:14:32,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 03:14:32,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 03:14:32,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 03:14:32,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 03:14:32,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 03:14:32,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 03:14:32,425 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 03:14:32,425 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12544117846b274bd1cb12a6694f8fda1d77f0b1327b2e9a353cfe44563b100a [2022-07-22 03:14:32,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 03:14:32,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 03:14:32,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 03:14:32,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 03:14:32,780 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 03:14:32,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2022-07-22 03:14:32,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2055cbb0/2de7baa72a424da9a30d07f306e7203a/FLAG0760be501 [2022-07-22 03:14:33,328 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 03:14:33,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2022-07-22 03:14:33,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2055cbb0/2de7baa72a424da9a30d07f306e7203a/FLAG0760be501 [2022-07-22 03:14:33,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2055cbb0/2de7baa72a424da9a30d07f306e7203a [2022-07-22 03:14:33,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 03:14:33,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 03:14:33,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 03:14:33,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 03:14:33,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 03:14:33,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:14:33" (1/1) ... [2022-07-22 03:14:33,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be80a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:33, skipping insertion in model container [2022-07-22 03:14:33,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:14:33" (1/1) ... [2022-07-22 03:14:33,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 03:14:33,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 03:14:34,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:14:34,100 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 03:14:34,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:14:34,169 INFO L208 MainTranslator]: Completed translation [2022-07-22 03:14:34,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34 WrapperNode [2022-07-22 03:14:34,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 03:14:34,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 03:14:34,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 03:14:34,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 03:14:34,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,235 INFO L137 Inliner]: procedures = 164, calls = 72, calls flagged for inlining = 28, calls inlined = 5, statements flattened = 65 [2022-07-22 03:14:34,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 03:14:34,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 03:14:34,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 03:14:34,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 03:14:34,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 03:14:34,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 03:14:34,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 03:14:34,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 03:14:34,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (1/1) ... [2022-07-22 03:14:34,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:34,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:34,336 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-22 03:14:34,364 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-22 03:14:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 03:14:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 03:14:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 03:14:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 03:14:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 03:14:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 03:14:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 03:14:34,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 03:14:34,528 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 03:14:34,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 03:14:34,703 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 03:14:34,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 03:14:34,708 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 03:14:34,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:14:34 BoogieIcfgContainer [2022-07-22 03:14:34,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 03:14:34,712 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 03:14:34,712 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 03:14:34,715 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 03:14:34,715 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:14:34,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 03:14:33" (1/3) ... [2022-07-22 03:14:34,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ec6e671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:14:34, skipping insertion in model container [2022-07-22 03:14:34,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:14:34,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:34" (2/3) ... [2022-07-22 03:14:34,718 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ec6e671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:14:34, skipping insertion in model container [2022-07-22 03:14:34,718 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:14:34,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:14:34" (3/3) ... [2022-07-22 03:14:34,720 INFO L354 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_1.i [2022-07-22 03:14:34,776 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 03:14:34,777 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 03:14:34,777 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 03:14:34,777 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 03:14:34,777 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 03:14:34,777 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 03:14:34,777 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 03:14:34,777 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 03:14:34,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:34,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-22 03:14:34,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:34,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:34,804 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 03:14:34,805 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 03:14:34,805 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 03:14:34,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:34,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-22 03:14:34,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:34,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:34,807 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 03:14:34,807 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 03:14:34,811 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;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 12#L526true assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 6#L529true entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 7#L766true assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 10#L767-3true [2022-07-22 03:14:34,812 INFO L754 eck$LassoCheckResult]: Loop: 10#L767-3true assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 15#L526-1true assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 16#L529-1true entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 14#L769true assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 11#L767-2true entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; 10#L767-3true [2022-07-22 03:14:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-07-22 03:14:34,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:34,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124529505] [2022-07-22 03:14:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:35,001 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-22 03:14:35,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:35,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124529505] [2022-07-22 03:14:35,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124529505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:35,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:35,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 03:14:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771389029] [2022-07-22 03:14:35,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:35,009 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:14:35,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2022-07-22 03:14:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:35,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277715902] [2022-07-22 03:14:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:35,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:35,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:35,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:35,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 03:14:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 03:14:35,465 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:35,514 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-07-22 03:14:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 03:14:35,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2022-07-22 03:14:35,525 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-07-22 03:14:35,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 20 states and 25 transitions. [2022-07-22 03:14:35,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 03:14:35,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:14:35,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2022-07-22 03:14:35,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:35,532 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 03:14:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2022-07-22 03:14:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2022-07-22 03:14:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-07-22 03:14:35,558 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-07-22 03:14:35,558 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-07-22 03:14:35,558 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 03:14:35,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-07-22 03:14:35,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-22 03:14:35,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:35,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:35,561 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 03:14:35,562 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 03:14:35,563 INFO L752 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 70#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 75#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 74#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 72#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 73#L767-3 [2022-07-22 03:14:35,563 INFO L754 eck$LassoCheckResult]: Loop: 73#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 76#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 79#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 78#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 77#L767-2 entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; 73#L767-3 [2022-07-22 03:14:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2022-07-22 03:14:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:35,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710976374] [2022-07-22 03:14:35,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:35,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:35,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:35,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:35,603 INFO L85 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2022-07-22 03:14:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:35,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032505323] [2022-07-22 03:14:35,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:35,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:35,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:35,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:35,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2022-07-22 03:14:35,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:35,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147081270] [2022-07-22 03:14:35,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:35,694 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:35,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:36,271 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:14:36,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:14:36,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:14:36,273 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:14:36,273 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:14:36,273 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:36,273 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:14:36,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:14:36,273 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration2_Lasso [2022-07-22 03:14:36,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:14:36,273 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:14:36,289 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-22 03:14:36,294 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-22 03:14:36,297 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-22 03:14:36,308 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-22 03:14:36,310 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-22 03:14:36,683 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-22 03:14:36,686 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-22 03:14:36,688 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-22 03:14:36,690 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-22 03:14:36,696 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-22 03:14:36,698 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-22 03:14:36,700 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-22 03:14:36,702 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-22 03:14:36,705 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-22 03:14:36,707 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-22 03:14:36,709 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-22 03:14:36,711 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-22 03:14:36,713 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-22 03:14:36,715 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-22 03:14:36,718 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-22 03:14:37,215 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:14:37,221 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:14:37,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,228 INFO L229 MonitoredProcess]: Starting monitored process 2 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-22 03:14:37,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 03:14:37,233 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-22 03:14:37,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:37,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:37,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:37,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:37,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,292 INFO L229 MonitoredProcess]: Starting monitored process 3 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-22 03:14:37,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 03:14:37,295 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-22 03:14:37,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:37,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:37,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:37,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:37,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,338 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-22 03:14:37,346 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-22 03:14:37,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:37,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:37,361 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-22 03:14:37,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,396 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-22 03:14:37,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,398 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-22 03:14:37,399 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-22 03:14:37,400 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-22 03:14:37,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:37,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:37,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:37,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,438 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-22 03:14:37,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,439 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-22 03:14:37,440 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-22 03:14:37,444 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-22 03:14:37,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:37,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:37,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,499 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-22 03:14:37,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,502 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-22 03:14:37,503 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-22 03:14:37,529 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-22 03:14:37,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:37,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:37,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:37,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,560 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-22 03:14:37,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,562 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-22 03:14:37,563 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-22 03:14:37,564 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-22 03:14:37,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:37,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:37,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,617 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-22 03:14:37,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,619 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-22 03:14:37,626 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-22 03:14:37,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,634 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 03:14:37,634 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 03:14:37,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,645 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-07-22 03:14:37,646 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 03:14:37,650 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-22 03:14:37,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-22 03:14:37,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,692 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-22 03:14:37,693 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-22 03:14:37,694 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-22 03:14:37,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:37,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:37,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:37,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 03:14:37,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,724 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-22 03:14:37,724 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-22 03:14:37,725 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-22 03:14:37,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:37,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:37,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,763 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-22 03:14:37,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,764 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-22 03:14:37,765 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-22 03:14:37,766 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-22 03:14:37,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:37,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:37,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,806 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-22 03:14:37,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,807 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-22 03:14:37,809 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-22 03:14:37,809 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-22 03:14:37,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:37,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:37,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:37,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,875 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-22 03:14:37,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,876 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-22 03:14:37,878 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-22 03:14:37,878 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-22 03:14:37,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:37,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:37,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:37,925 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-22 03:14:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:37,926 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-22 03:14:37,927 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-22 03:14:37,929 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-22 03:14:37,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:37,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:37,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:37,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:37,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:37,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:37,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:14:37,997 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 03:14:37,997 INFO L444 ModelExtractionUtils]: 27 out of 40 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-22 03:14:37,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:38,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:38,043 INFO L229 MonitoredProcess]: Starting monitored process 16 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-22 03:14:38,090 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:14:38,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 03:14:38,108 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:14:38,108 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:14:38,109 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0#1, ULTIMATE.start_entry_point_~i~0#1) = 1*ULTIMATE.start_entry_point_~len~0#1 - 1*ULTIMATE.start_entry_point_~i~0#1 Supporting invariants [] [2022-07-22 03:14:38,144 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-22 03:14:38,159 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-22 03:14:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:38,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 03:14:38,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:38,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:14:38,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:38,268 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-22 03:14:38,272 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 03:14:38,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:38,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 36 transitions. Complement of second has 6 states. [2022-07-22 03:14:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 03:14:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-07-22 03:14:38,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2022-07-22 03:14:38,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:38,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2022-07-22 03:14:38,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:38,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2022-07-22 03:14:38,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:38,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2022-07-22 03:14:38,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-22 03:14:38,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2022-07-22 03:14:38,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-22 03:14:38,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 03:14:38,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-07-22 03:14:38,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:14:38,330 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 03:14:38,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-07-22 03:14:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-07-22 03:14:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-07-22 03:14:38,333 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-22 03:14:38,333 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-22 03:14:38,333 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 03:14:38,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-07-22 03:14:38,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 03:14:38,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:38,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:38,336 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:38,336 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:14:38,336 INFO L752 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 187#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 192#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 189#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 190#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 191#L767-3 assume !(entry_point_~i~0#1 < entry_point_~len~0#1); 188#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 184#L773-3 [2022-07-22 03:14:38,336 INFO L754 eck$LassoCheckResult]: Loop: 184#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; 185#L773-2 entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; 184#L773-3 [2022-07-22 03:14:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1804968475, now seen corresponding path program 1 times [2022-07-22 03:14:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:38,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951624896] [2022-07-22 03:14:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:38,407 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-22 03:14:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951624896] [2022-07-22 03:14:38,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951624896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:38,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 03:14:38,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564702267] [2022-07-22 03:14:38,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:38,409 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:14:38,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2022-07-22 03:14:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:38,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517039934] [2022-07-22 03:14:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:38,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:38,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:38,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:38,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:38,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 03:14:38,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 03:14:38,468 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:38,497 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-07-22 03:14:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 03:14:38,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-07-22 03:14:38,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-22 03:14:38,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2022-07-22 03:14:38,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-22 03:14:38,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-22 03:14:38,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2022-07-22 03:14:38,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:14:38,503 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-22 03:14:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2022-07-22 03:14:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2022-07-22 03:14:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-07-22 03:14:38,506 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-07-22 03:14:38,506 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-07-22 03:14:38,506 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 03:14:38,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2022-07-22 03:14:38,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 03:14:38,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:38,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:38,508 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:38,509 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:14:38,509 INFO L752 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 243#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 240#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 241#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 242#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 245#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 250#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 248#L769 assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; 239#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 237#L773-3 [2022-07-22 03:14:38,509 INFO L754 eck$LassoCheckResult]: Loop: 237#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; 238#L773-2 entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; 237#L773-3 [2022-07-22 03:14:38,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:38,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1173218535, now seen corresponding path program 1 times [2022-07-22 03:14:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:38,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065874257] [2022-07-22 03:14:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:38,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:38,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 2 times [2022-07-22 03:14:38,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:38,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970374510] [2022-07-22 03:14:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:38,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:38,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:38,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2113388251, now seen corresponding path program 1 times [2022-07-22 03:14:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:38,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743333102] [2022-07-22 03:14:38,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:38,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:38,592 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-22 03:14:38,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:38,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743333102] [2022-07-22 03:14:38,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743333102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:38,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:38,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 03:14:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410428868] [2022-07-22 03:14:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:38,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 03:14:38,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 03:14:38,638 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:38,663 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-07-22 03:14:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 03:14:38,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2022-07-22 03:14:38,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 03:14:38,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2022-07-22 03:14:38,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-22 03:14:38,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-22 03:14:38,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2022-07-22 03:14:38,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:14:38,667 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-07-22 03:14:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2022-07-22 03:14:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2022-07-22 03:14:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-07-22 03:14:38,670 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-22 03:14:38,670 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-22 03:14:38,670 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 03:14:38,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-07-22 03:14:38,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 03:14:38,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:38,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:38,672 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:38,672 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:14:38,672 INFO L752 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 297#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 294#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 295#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 296#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 300#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 305#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 303#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 298#L767-2 entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; 299#L767-3 assume !(entry_point_~i~0#1 < entry_point_~len~0#1); 293#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 291#L773-3 [2022-07-22 03:14:38,672 INFO L754 eck$LassoCheckResult]: Loop: 291#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; 292#L773-2 entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; 291#L773-3 [2022-07-22 03:14:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2113443111, now seen corresponding path program 1 times [2022-07-22 03:14:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:38,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646497291] [2022-07-22 03:14:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:38,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:38,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:38,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646497291] [2022-07-22 03:14:38,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646497291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:38,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:38,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 03:14:38,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155455438] [2022-07-22 03:14:38,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:38,732 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:14:38,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:38,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 3 times [2022-07-22 03:14:38,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:38,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834890031] [2022-07-22 03:14:38,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:38,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:38,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:38,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:38,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:38,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 03:14:38,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 03:14:38,776 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:38,798 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-07-22 03:14:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 03:14:38,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2022-07-22 03:14:38,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-07-22 03:14:38,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2022-07-22 03:14:38,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 03:14:38,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:14:38,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2022-07-22 03:14:38,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:14:38,801 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-22 03:14:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2022-07-22 03:14:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-07-22 03:14:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-22 03:14:38,802 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-22 03:14:38,802 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-22 03:14:38,803 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 03:14:38,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-07-22 03:14:38,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 03:14:38,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:38,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:38,804 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:38,804 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:14:38,804 INFO L752 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 345#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 350#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 347#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 348#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 349#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 353#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 358#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 356#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 351#L767-2 entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; 352#L767-3 assume !(entry_point_~i~0#1 < entry_point_~len~0#1); 346#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 342#L773-3 [2022-07-22 03:14:38,804 INFO L754 eck$LassoCheckResult]: Loop: 342#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; 343#L773-2 entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; 342#L773-3 [2022-07-22 03:14:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2056184809, now seen corresponding path program 1 times [2022-07-22 03:14:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:38,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72013447] [2022-07-22 03:14:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72013447] [2022-07-22 03:14:38,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72013447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 03:14:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745309777] [2022-07-22 03:14:38,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:38,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:14:38,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:38,839 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:14:38,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 03:14:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:38,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:14:38,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:38,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 03:14:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:39,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745309777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 03:14:39,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 03:14:39,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-22 03:14:39,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495293423] [2022-07-22 03:14:39,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 03:14:39,023 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:14:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:39,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 4 times [2022-07-22 03:14:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:39,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170706828] [2022-07-22 03:14:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:39,033 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:39,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 03:14:39,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-22 03:14:39,071 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:39,134 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-22 03:14:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 03:14:39,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 55 transitions. [2022-07-22 03:14:39,137 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-22 03:14:39,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 55 transitions. [2022-07-22 03:14:39,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-22 03:14:39,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-22 03:14:39,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2022-07-22 03:14:39,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 03:14:39,138 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-22 03:14:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2022-07-22 03:14:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-07-22 03:14:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-22 03:14:39,142 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-22 03:14:39,143 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-22 03:14:39,143 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 03:14:39,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2022-07-22 03:14:39,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 03:14:39,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:39,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:39,145 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:39,145 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:14:39,145 INFO L752 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_#t~post39#1, entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset, entry_point_#t~post41#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~i~0#1, entry_point_~j~0#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 497#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 494#L529 entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_~p~0#1.base, entry_point_~p~0#1.offset;entry_point_~i~0#1 := 0;havoc entry_point_~j~0#1; 495#L766 assume !(entry_point_~array~0#1.base == 0 && entry_point_~array~0#1.offset == 0); 496#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 498#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 507#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 508#L769 assume !(entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0);call write~$Pointer$(entry_point_~p~0#1.base, entry_point_~p~0#1.offset, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~0#1, 4); 519#L767-2 entry_point_#t~post39#1 := entry_point_~i~0#1;entry_point_~i~0#1 := 1 + entry_point_#t~post39#1;havoc entry_point_#t~post39#1; 499#L767-3 assume !!(entry_point_~i~0#1 < entry_point_~len~0#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 501#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 506#L529-1 entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;entry_point_~p~0#1.base, entry_point_~p~0#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset; 504#L769 assume entry_point_~p~0#1.base == 0 && entry_point_~p~0#1.offset == 0; 493#L772 entry_point_~j~0#1 := entry_point_~i~0#1 - 1; 489#L773-3 [2022-07-22 03:14:39,145 INFO L754 eck$LassoCheckResult]: Loop: 489#L773-3 assume !!(entry_point_~j~0#1 >= 0);call entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset := read~$Pointer$(entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~j~0#1, 4);call ULTIMATE.dealloc(entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset);havoc entry_point_#t~mem42#1.base, entry_point_#t~mem42#1.offset; 490#L773-2 entry_point_#t~post41#1 := entry_point_~j~0#1;entry_point_~j~0#1 := entry_point_#t~post41#1 - 1;havoc entry_point_#t~post41#1; 489#L773-3 [2022-07-22 03:14:39,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash 979558027, now seen corresponding path program 1 times [2022-07-22 03:14:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:39,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917447530] [2022-07-22 03:14:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:39,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:39,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:39,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 5 times [2022-07-22 03:14:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:39,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190786276] [2022-07-22 03:14:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:39,178 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:39,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash 757427661, now seen corresponding path program 1 times [2022-07-22 03:14:39,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:39,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460534730] [2022-07-22 03:14:39,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:39,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:39,202 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:39,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:39,884 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:14:39,884 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:14:39,884 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:14:39,884 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:14:39,884 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:14:39,884 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:39,884 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:14:39,884 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:14:39,884 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration7_Lasso [2022-07-22 03:14:39,884 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:14:39,885 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:14:39,887 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-22 03:14:39,889 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-22 03:14:39,891 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-22 03:14:39,893 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-22 03:14:39,895 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-22 03:14:39,897 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-22 03:14:40,096 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-22 03:14:40,098 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-22 03:14:40,100 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-22 03:14:40,102 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-22 03:14:40,104 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-22 03:14:40,108 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-22 03:14:40,110 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-22 03:14:40,112 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-22 03:14:40,114 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-22 03:14:40,116 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-22 03:14:40,118 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-22 03:14:40,120 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-22 03:14:40,121 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-22 03:14:40,125 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-22 03:14:40,130 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-22 03:14:40,132 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-22 03:14:40,506 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:14:40,506 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:14:40,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,508 INFO L229 MonitoredProcess]: Starting monitored process 18 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-22 03:14:40,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 03:14:40,510 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-22 03:14:40,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:40,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:40,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:40,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:40,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,557 INFO L229 MonitoredProcess]: Starting monitored process 19 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-22 03:14:40,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 03:14:40,559 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-22 03:14:40,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:40,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:40,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:40,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,583 INFO L229 MonitoredProcess]: Starting monitored process 20 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-22 03:14:40,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 03:14:40,587 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-22 03:14:40,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:40,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:40,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:40,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,627 INFO L229 MonitoredProcess]: Starting monitored process 21 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-22 03:14:40,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 03:14:40,629 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-22 03:14:40,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:40,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:40,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:40,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-22 03:14:40,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,655 INFO L229 MonitoredProcess]: Starting monitored process 22 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-22 03:14:40,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 03:14:40,657 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-22 03:14:40,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:40,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:40,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:40,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,684 INFO L229 MonitoredProcess]: Starting monitored process 23 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-22 03:14:40,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 03:14:40,686 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-22 03:14:40,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:40,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:40,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:40,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 03:14:40,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,716 INFO L229 MonitoredProcess]: Starting monitored process 24 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-22 03:14:40,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 03:14:40,718 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-22 03:14:40,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:40,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:40,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:40,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,780 INFO L229 MonitoredProcess]: Starting monitored process 25 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-22 03:14:40,783 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-22 03:14:40,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:40,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:40,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 03:14:40,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:40,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,833 INFO L229 MonitoredProcess]: Starting monitored process 26 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-22 03:14:40,836 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-22 03:14:40,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,845 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 03:14:40,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,852 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-22 03:14:40,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:40,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 03:14:40,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,903 INFO L229 MonitoredProcess]: Starting monitored process 27 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-22 03:14:40,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 03:14:40,906 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-22 03:14:40,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:40,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:40,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:40,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:40,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:40,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:40,962 INFO L229 MonitoredProcess]: Starting monitored process 28 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-22 03:14:40,968 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-22 03:14:40,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:40,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:40,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:40,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:40,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:40,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:40,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:40,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 03:14:40,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:41,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:41,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:41,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:41,025 INFO L229 MonitoredProcess]: Starting monitored process 29 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-22 03:14:41,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 03:14:41,029 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-22 03:14:41,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:41,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:41,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:41,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:41,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:41,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:41,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:41,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:41,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:41,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:41,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:41,077 INFO L229 MonitoredProcess]: Starting monitored process 30 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-22 03:14:41,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 03:14:41,080 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-22 03:14:41,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:41,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:41,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:41,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:41,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:41,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:41,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:41,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:41,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:41,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:41,115 INFO L229 MonitoredProcess]: Starting monitored process 31 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-22 03:14:41,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 03:14:41,117 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-22 03:14:41,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:41,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:41,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:41,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:41,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:41,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:41,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:41,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 03:14:41,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:41,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:41,151 INFO L229 MonitoredProcess]: Starting monitored process 32 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-22 03:14:41,156 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-22 03:14:41,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 03:14:41,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:41,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:41,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:41,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:41,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:41,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:41,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:41,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 03:14:41,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:41,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:41,183 INFO L229 MonitoredProcess]: Starting monitored process 33 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-22 03:14:41,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 03:14:41,184 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-22 03:14:41,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:41,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:14:41,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:41,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:41,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:41,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:14:41,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:14:41,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:14:41,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:41,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:41,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:41,240 INFO L229 MonitoredProcess]: Starting monitored process 34 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-22 03:14:41,243 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-22 03:14:41,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 03:14:41,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:14:41,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:14:41,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:14:41,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:14:41,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:14:41,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:14:41,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:14:41,294 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 03:14:41,294 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-07-22 03:14:41,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:41,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:41,300 INFO L229 MonitoredProcess]: Starting monitored process 35 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-22 03:14:41,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 03:14:41,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:14:41,328 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:14:41,328 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:14:41,328 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0#1) = 2*ULTIMATE.start_entry_point_~j~0#1 + 1 Supporting invariants [] [2022-07-22 03:14:41,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:41,367 INFO L293 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-07-22 03:14:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:41,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 03:14:41,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:41,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:14:41,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:14:41,434 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-22 03:14:41,435 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 03:14:41,435 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:41,442 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 41 transitions. Complement of second has 4 states. [2022-07-22 03:14:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 03:14:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:14:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-07-22 03:14:41,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2022-07-22 03:14:41,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:41,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2022-07-22 03:14:41,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:41,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2022-07-22 03:14:41,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:14:41,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2022-07-22 03:14:41,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 03:14:41,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2022-07-22 03:14:41,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 03:14:41,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 03:14:41,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 03:14:41,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:41,446 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 03:14:41,446 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 03:14:41,447 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 03:14:41,447 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 03:14:41,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 03:14:41,447 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 03:14:41,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 03:14:41,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 03:14:41 BoogieIcfgContainer [2022-07-22 03:14:41,453 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 03:14:41,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 03:14:41,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 03:14:41,454 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 03:14:41,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:14:34" (3/4) ... [2022-07-22 03:14:41,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 03:14:41,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 03:14:41,458 INFO L158 Benchmark]: Toolchain (without parser) took 7807.96ms. Allocated memory was 56.6MB in the beginning and 111.1MB in the end (delta: 54.5MB). Free memory was 34.0MB in the beginning and 68.5MB in the end (delta: -34.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-07-22 03:14:41,458 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:14:41,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.35ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 28.5MB in the end (delta: 5.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 03:14:41,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.35ms. Allocated memory is still 56.6MB. Free memory was 28.5MB in the beginning and 26.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 03:14:41,459 INFO L158 Benchmark]: Boogie Preprocessor took 51.13ms. Allocated memory is still 56.6MB. Free memory was 26.1MB in the beginning and 24.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:14:41,459 INFO L158 Benchmark]: RCFGBuilder took 422.16ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 24.8MB in the beginning and 48.8MB in the end (delta: -24.0MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-07-22 03:14:41,459 INFO L158 Benchmark]: BuchiAutomizer took 6741.63ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 48.5MB in the beginning and 69.4MB in the end (delta: -20.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2022-07-22 03:14:41,460 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 111.1MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:14:41,461 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.17ms. Allocated memory is still 56.6MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.35ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 28.5MB in the end (delta: 5.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.35ms. Allocated memory is still 56.6MB. Free memory was 28.5MB in the beginning and 26.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.13ms. Allocated memory is still 56.6MB. Free memory was 26.1MB in the beginning and 24.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 422.16ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 24.8MB in the beginning and 48.8MB in the end (delta: -24.0MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 6741.63ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 48.5MB in the beginning and 69.4MB in the end (delta: -20.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 111.1MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 117 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax113 hnf100 lsp82 ukn60 mio100 lsp50 div100 bol100 ite100 ukn100 eq187 hnf89 smp100 dnf126 smp91 tf100 neg96 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 03:14:41,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 03:14:41,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-22 03:14:41,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE