./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.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 bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:54:43,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:54:43,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:54:43,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:54:43,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:54:43,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:54:43,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:54:43,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:54:43,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:54:43,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:54:43,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:54:43,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:54:43,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:54:43,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:54:43,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:54:43,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:54:43,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:54:43,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:54:43,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:54:43,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:54:43,592 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:54:43,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:54:43,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:54:43,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:54:43,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:54:43,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:54:43,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:54:43,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:54:43,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:54:43,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:54:43,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:54:43,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:54:43,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:54:43,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:54:43,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:54:43,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:54:43,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:54:43,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:54:43,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:54:43,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:54:43,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:54:43,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:54:43,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:54:43,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:54:43,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:54:43,645 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:54:43,646 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:54:43,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:54:43,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:54:43,647 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:54:43,647 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:54:43,647 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:54:43,648 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:54:43,648 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:54:43,648 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:54:43,648 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:54:43,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:54:43,649 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:54:43,649 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:54:43,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:54:43,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:54:43,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:54:43,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:54:43,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:54:43,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:54:43,650 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:54:43,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:54:43,651 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:54:43,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:54:43,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:54:43,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:54:43,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:54:43,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:54:43,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:54:43,653 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:54:43,653 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2022-07-13 04:54:43,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:54:43,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:54:43,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:54:43,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:54:43,855 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:54:43,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-07-13 04:54:43,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957ab1ba0/9b4c5459901a4549869b4a515b7ac66c/FLAGddfff724f [2022-07-13 04:54:44,301 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:54:44,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-07-13 04:54:44,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957ab1ba0/9b4c5459901a4549869b4a515b7ac66c/FLAGddfff724f [2022-07-13 04:54:44,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957ab1ba0/9b4c5459901a4549869b4a515b7ac66c [2022-07-13 04:54:44,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:54:44,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:54:44,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:44,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:54:44,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:54:44,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:44" (1/1) ... [2022-07-13 04:54:44,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab164ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:44, skipping insertion in model container [2022-07-13 04:54:44,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:54:44" (1/1) ... [2022-07-13 04:54:44,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:54:44,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:54:44,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:44,994 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:54:45,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:54:45,086 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:54:45,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45 WrapperNode [2022-07-13 04:54:45,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:54:45,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:45,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:54:45,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:54:45,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,121 INFO L137 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 31, calls inlined = 8, statements flattened = 109 [2022-07-13 04:54:45,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:54:45,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:54:45,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:54:45,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:54:45,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:54:45,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:54:45,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:54:45,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:54:45,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (1/1) ... [2022-07-13 04:54:45,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:45,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:45,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 04:54:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 04:54:45,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:54:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 04:54:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 04:54:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:54:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 04:54:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:54:45,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:54:45,327 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:54:45,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:54:45,532 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:54:45,536 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:54:45,537 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:54:45,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:45 BoogieIcfgContainer [2022-07-13 04:54:45,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:54:45,539 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:54:45,539 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:54:45,543 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:54:45,544 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:45,544 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:54:44" (1/3) ... [2022-07-13 04:54:45,545 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461e9c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:45, skipping insertion in model container [2022-07-13 04:54:45,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:45,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:54:45" (2/3) ... [2022-07-13 04:54:45,545 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461e9c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:54:45, skipping insertion in model container [2022-07-13 04:54:45,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:54:45,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:54:45" (3/3) ... [2022-07-13 04:54:45,547 INFO L354 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2-2.i [2022-07-13 04:54:45,592 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:54:45,592 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:54:45,592 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:54:45,593 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:54:45,593 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:54:45,593 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:54:45,593 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:54:45,593 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:54:45,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 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-13 04:54:45,620 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-13 04:54:45,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:45,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:45,624 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:45,624 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:54:45,624 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:54:45,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 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-13 04:54:45,629 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-13 04:54:45,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:45,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:45,630 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:45,630 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:54:45,633 INFO L752 eck$LassoCheckResult]: Stem: 19#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); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~post46#1, entry_point_#t~ret47#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;assume { :begin_inline_ldv_positive } true;havoc ldv_positive_#res#1;havoc ldv_positive_#t~nondet4#1, ldv_positive_~r~1#1;ldv_positive_~r~1#1 := ldv_positive_#t~nondet4#1;havoc ldv_positive_#t~nondet4#1; 8#L520true assume !(ldv_positive_~r~1#1 > 0);ldv_positive_#res#1 := 1; 25#L521true entry_point_#t~ret44#1 := ldv_positive_#res#1;assume { :end_inline_ldv_positive } true;entry_point_~len~0#1 := entry_point_#t~ret44#1;havoc entry_point_#t~ret44#1; 20#L787true assume !!(entry_point_~len~0#1 < 16777216); 23#L787-2true 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; 26#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; 24#L529true entry_point_#t~ret45#1.base, entry_point_#t~ret45#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~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; 4#L789true assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 30#L790-3true [2022-07-13 04:54:45,634 INFO L754 eck$LassoCheckResult]: Loop: 30#L790-3true assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 21#L790-2true entry_point_#t~post46#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post46#1;havoc entry_point_#t~post46#1; 30#L790-3true [2022-07-13 04:54:45,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:45,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1182787569, now seen corresponding path program 1 times [2022-07-13 04:54:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:45,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894070765] [2022-07-13 04:54:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:45,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894070765] [2022-07-13 04:54:45,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894070765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:45,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:45,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:54:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408846814] [2022-07-13 04:54:45,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:45,823 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:54:45,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:45,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2022-07-13 04:54:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:45,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229471308] [2022-07-13 04:54:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:45,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:45,860 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:45,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:45,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:54:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:54:45,981 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 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 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-13 04:54:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:46,021 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-07-13 04:54:46,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:54:46,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2022-07-13 04:54:46,027 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2022-07-13 04:54:46,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 37 states and 46 transitions. [2022-07-13 04:54:46,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-13 04:54:46,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-13 04:54:46,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2022-07-13 04:54:46,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:46,031 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-07-13 04:54:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2022-07-13 04:54:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-07-13 04:54:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-13 04:54:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-07-13 04:54:46,051 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-13 04:54:46,051 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-13 04:54:46,051 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:54:46,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2022-07-13 04:54:46,052 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-13 04:54:46,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:46,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:46,053 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:46,053 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:54:46,053 INFO L752 eck$LassoCheckResult]: Stem: 118#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); 109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~post46#1, entry_point_#t~ret47#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;assume { :begin_inline_ldv_positive } true;havoc ldv_positive_#res#1;havoc ldv_positive_#t~nondet4#1, ldv_positive_~r~1#1;ldv_positive_~r~1#1 := ldv_positive_#t~nondet4#1;havoc ldv_positive_#t~nondet4#1; 110#L520 assume !(ldv_positive_~r~1#1 > 0);ldv_positive_#res#1 := 1; 111#L521 entry_point_#t~ret44#1 := ldv_positive_#res#1;assume { :end_inline_ldv_positive } true;entry_point_~len~0#1 := entry_point_#t~ret44#1;havoc entry_point_#t~ret44#1; 119#L787 assume !!(entry_point_~len~0#1 < 16777216); 120#L787-2 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; 122#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; 123#L529 entry_point_#t~ret45#1.base, entry_point_#t~ret45#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~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; 101#L789 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 102#L790-3 [2022-07-13 04:54:46,053 INFO L754 eck$LassoCheckResult]: Loop: 102#L790-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 121#L790-2 entry_point_#t~post46#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post46#1;havoc entry_point_#t~post46#1; 102#L790-3 [2022-07-13 04:54:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1182785647, now seen corresponding path program 1 times [2022-07-13 04:54:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:46,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504027944] [2022-07-13 04:54:46,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:46,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:46,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 2 times [2022-07-13 04:54:46,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:46,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427114557] [2022-07-13 04:54:46,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:46,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:46,113 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:46,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1509325583, now seen corresponding path program 1 times [2022-07-13 04:54:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:46,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064022454] [2022-07-13 04:54:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:46,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:46,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:46,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:46,572 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:54:46,572 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:54:46,572 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:54:46,572 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:54:46,573 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:54:46,573 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:46,573 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:54:46,573 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:54:46,573 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration2_Lasso [2022-07-13 04:54:46,573 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:54:46,573 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:54:46,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:46,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:47,105 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:54:47,108 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:54:47,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,111 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-13 04:54:47,114 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-13 04:54:47,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:47,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:47,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:47,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,155 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-13 04:54:47,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,157 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-13 04:54:47,158 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-13 04:54:47,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:47,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:47,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-13 04:54:47,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 04:54:47,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:47,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:47,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:47,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:47,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 04:54:47,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:47,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:47,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-13 04:54:47,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 04:54:47,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:47,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:47,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:47,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:47,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 04:54:47,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:47,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:47,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:47,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:47,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 04:54:47,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:47,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:47,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-13 04:54:47,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 04:54:47,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:47,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:47,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:47,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,479 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 04:54:47,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:47,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:47,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:47,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:47,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,554 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 04:54:47,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:54:47,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:54:47,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:54:47,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:47,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,594 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 04:54:47,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:47,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:47,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:54:47,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,661 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 04:54:47,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:54:47,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:54:47,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:54:47,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:54:47,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:54:47,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:54:47,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:54:47,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:54:47,722 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-07-13 04:54:47,722 INFO L444 ModelExtractionUtils]: 25 out of 40 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-13 04:54:47,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:47,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:54:47,725 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:54:47,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 04:54:47,726 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:54:47,748 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:54:47,748 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:54:47,748 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_ldv_malloc_#res#1.base)_1, ULTIMATE.start_entry_point_~array~0#1.offset, ULTIMATE.start_entry_point_~i~2#1) = 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#res#1.base)_1 - 1*ULTIMATE.start_entry_point_~array~0#1.offset - 4*ULTIMATE.start_entry_point_~i~2#1 Supporting invariants [] [2022-07-13 04:54:47,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:47,787 INFO L293 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2022-07-13 04:54:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:47,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:54:47,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:47,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 04:54:47,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:54:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:47,863 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-07-13 04:54:47,863 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-13 04:54:47,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 38 states and 49 transitions. Complement of second has 8 states. [2022-07-13 04:54:47,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:54:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-13 04:54:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-07-13 04:54:47,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-13 04:54:47,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:47,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-13 04:54:47,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:47,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-13 04:54:47,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:54:47,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2022-07-13 04:54:47,912 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-13 04:54:47,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 31 states and 39 transitions. [2022-07-13 04:54:47,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-13 04:54:47,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-13 04:54:47,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2022-07-13 04:54:47,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:47,913 INFO L369 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 04:54:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2022-07-13 04:54:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-07-13 04:54:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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-13 04:54:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-07-13 04:54:47,914 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-13 04:54:47,914 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-13 04:54:47,914 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:54:47,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-07-13 04:54:47,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 04:54:47,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:47,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:47,915 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:47,915 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 04:54:47,915 INFO L752 eck$LassoCheckResult]: Stem: 277#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); 262#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~post46#1, entry_point_#t~ret47#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;assume { :begin_inline_ldv_positive } true;havoc ldv_positive_#res#1;havoc ldv_positive_#t~nondet4#1, ldv_positive_~r~1#1;ldv_positive_~r~1#1 := ldv_positive_#t~nondet4#1;havoc ldv_positive_#t~nondet4#1; 263#L520 assume !(ldv_positive_~r~1#1 > 0);ldv_positive_#res#1 := 1; 270#L521 entry_point_#t~ret44#1 := ldv_positive_#res#1;assume { :end_inline_ldv_positive } true;entry_point_~len~0#1 := entry_point_#t~ret44#1;havoc entry_point_#t~ret44#1; 278#L787 assume !!(entry_point_~len~0#1 < 16777216); 279#L787-2 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; 282#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; 283#L529 entry_point_#t~ret45#1.base, entry_point_#t~ret45#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~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; 260#L789 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 261#L790-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 273#L790-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 274#L765-3 [2022-07-13 04:54:47,916 INFO L754 eck$LassoCheckResult]: Loop: 274#L765-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#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; 271#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; 272#L529-1 alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; 264#L767 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 266#L765-2 alloc_17_#t~post38#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post38#1;havoc alloc_17_#t~post38#1; 274#L765-3 [2022-07-13 04:54:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1509325641, now seen corresponding path program 1 times [2022-07-13 04:54:47,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:47,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770526067] [2022-07-13 04:54:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:47,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:47,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770526067] [2022-07-13 04:54:47,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770526067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:47,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:47,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:54:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010329951] [2022-07-13 04:54:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:47,962 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:54:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 74532277, now seen corresponding path program 1 times [2022-07-13 04:54:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370389977] [2022-07-13 04:54:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:47,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:47,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:48,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:54:48,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:54:48,150 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-13 04:54:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:48,203 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-13 04:54:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:54:48,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2022-07-13 04:54:48,204 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-07-13 04:54:48,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 62 transitions. [2022-07-13 04:54:48,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-13 04:54:48,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-13 04:54:48,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2022-07-13 04:54:48,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:48,205 INFO L369 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-07-13 04:54:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2022-07-13 04:54:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2022-07-13 04:54:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 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-13 04:54:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-13 04:54:48,207 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-13 04:54:48,207 INFO L374 stractBuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-13 04:54:48,207 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:54:48,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2022-07-13 04:54:48,208 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 04:54:48,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:48,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:48,208 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:48,208 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 04:54:48,208 INFO L752 eck$LassoCheckResult]: Stem: 366#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); 350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~post46#1, entry_point_#t~ret47#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;assume { :begin_inline_ldv_positive } true;havoc ldv_positive_#res#1;havoc ldv_positive_#t~nondet4#1, ldv_positive_~r~1#1;ldv_positive_~r~1#1 := ldv_positive_#t~nondet4#1;havoc ldv_positive_#t~nondet4#1; 351#L520 assume ldv_positive_~r~1#1 > 0;ldv_positive_#res#1 := ldv_positive_~r~1#1; 358#L521 entry_point_#t~ret44#1 := ldv_positive_#res#1;assume { :end_inline_ldv_positive } true;entry_point_~len~0#1 := entry_point_#t~ret44#1;havoc entry_point_#t~ret44#1; 375#L787 assume !!(entry_point_~len~0#1 < 16777216); 371#L787-2 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; 372#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; 373#L529 entry_point_#t~ret45#1.base, entry_point_#t~ret45#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~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; 374#L789 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 378#L790-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 362#L790-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 363#L765-3 [2022-07-13 04:54:48,208 INFO L754 eck$LassoCheckResult]: Loop: 363#L765-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#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; 360#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; 361#L529-1 alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; 352#L767 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 354#L765-2 alloc_17_#t~post38#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post38#1;havoc alloc_17_#t~post38#1; 363#L765-3 [2022-07-13 04:54:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:48,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2105583285, now seen corresponding path program 1 times [2022-07-13 04:54:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:48,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961714220] [2022-07-13 04:54:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:54:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:54:48,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:54:48,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961714220] [2022-07-13 04:54:48,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961714220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:54:48,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:54:48,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:54:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554029705] [2022-07-13 04:54:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:54:48,235 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:54:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:48,235 INFO L85 PathProgramCache]: Analyzing trace with hash 74532277, now seen corresponding path program 2 times [2022-07-13 04:54:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:48,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051328524] [2022-07-13 04:54:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:48,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:48,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:48,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 04:54:48,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:54:48,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:54:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:54:48,422 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-13 04:54:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:54:48,459 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-07-13 04:54:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:54:48,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2022-07-13 04:54:48,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 04:54:48,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions. [2022-07-13 04:54:48,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-13 04:54:48,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-13 04:54:48,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2022-07-13 04:54:48,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:54:48,465 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-13 04:54:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2022-07-13 04:54:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-07-13 04:54:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-13 04:54:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-13 04:54:48,469 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-13 04:54:48,469 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-13 04:54:48,469 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:54:48,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2022-07-13 04:54:48,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 04:54:48,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:54:48,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:54:48,472 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:54:48,472 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 04:54:48,472 INFO L752 eck$LassoCheckResult]: Stem: 444#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); 429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~post46#1, entry_point_#t~ret47#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;assume { :begin_inline_ldv_positive } true;havoc ldv_positive_#res#1;havoc ldv_positive_#t~nondet4#1, ldv_positive_~r~1#1;ldv_positive_~r~1#1 := ldv_positive_#t~nondet4#1;havoc ldv_positive_#t~nondet4#1; 430#L520 assume !(ldv_positive_~r~1#1 > 0);ldv_positive_#res#1 := 1; 437#L521 entry_point_#t~ret44#1 := ldv_positive_#res#1;assume { :end_inline_ldv_positive } true;entry_point_~len~0#1 := entry_point_#t~ret44#1;havoc entry_point_#t~ret44#1; 445#L787 assume !!(entry_point_~len~0#1 < 16777216); 446#L787-2 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; 449#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; 450#L529 entry_point_#t~ret45#1.base, entry_point_#t~ret45#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~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; 427#L789 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 428#L790-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 447#L790-2 entry_point_#t~post46#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post46#1;havoc entry_point_#t~post46#1; 448#L790-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 440#L790-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 441#L765-3 [2022-07-13 04:54:48,472 INFO L754 eck$LassoCheckResult]: Loop: 441#L765-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#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; 438#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; 439#L529-1 alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; 431#L767 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 433#L765-2 alloc_17_#t~post38#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post38#1;havoc alloc_17_#t~post38#1; 441#L765-3 [2022-07-13 04:54:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1237061817, now seen corresponding path program 1 times [2022-07-13 04:54:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:48,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2498055] [2022-07-13 04:54:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:48,492 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:48,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:48,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:48,509 INFO L85 PathProgramCache]: Analyzing trace with hash 74532277, now seen corresponding path program 3 times [2022-07-13 04:54:48,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:48,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285833632] [2022-07-13 04:54:48,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:48,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:48,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:48,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:48,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:54:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash -138745859, now seen corresponding path program 1 times [2022-07-13 04:54:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:54:48,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916049128] [2022-07-13 04:54:48,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:54:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:54:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:48,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:54:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:54:48,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:54:49,296 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:54:49,296 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:54:49,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:54:49,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:54:49,297 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:54:49,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:54:49,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:54:49,297 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:54:49,297 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration5_Lasso [2022-07-13 04:54:49,297 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:54:49,297 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:54:49,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,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-13 04:54:49,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:54:49,396 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 04:54:49,402 INFO L158 Benchmark]: Toolchain (without parser) took 4734.33ms. Allocated memory was 113.2MB in the beginning and 142.6MB in the end (delta: 29.4MB). Free memory was 78.4MB in the beginning and 95.7MB in the end (delta: -17.3MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2022-07-13 04:54:49,403 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 79.7MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:54:49,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.23ms. Allocated memory is still 113.2MB. Free memory was 78.2MB in the beginning and 75.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 04:54:49,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.37ms. Allocated memory is still 113.2MB. Free memory was 75.5MB in the beginning and 73.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:49,408 INFO L158 Benchmark]: Boogie Preprocessor took 19.00ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 71.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:49,408 INFO L158 Benchmark]: RCFGBuilder took 397.03ms. Allocated memory is still 113.2MB. Free memory was 71.9MB in the beginning and 58.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 04:54:49,409 INFO L158 Benchmark]: BuchiAutomizer took 3862.11ms. Allocated memory was 113.2MB in the beginning and 142.6MB in the end (delta: 29.4MB). Free memory was 58.8MB in the beginning and 95.7MB in the end (delta: -36.9MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2022-07-13 04:54:49,412 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.13ms. Allocated memory is still 79.7MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.23ms. Allocated memory is still 113.2MB. Free memory was 78.2MB in the beginning and 75.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.37ms. Allocated memory is still 113.2MB. Free memory was 75.5MB in the beginning and 73.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.00ms. Allocated memory is still 113.2MB. Free memory was 73.1MB in the beginning and 71.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 397.03ms. Allocated memory is still 113.2MB. Free memory was 71.9MB in the beginning and 58.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3862.11ms. Allocated memory was 113.2MB in the beginning and 142.6MB in the end (delta: 29.4MB). Free memory was 58.8MB in the beginning and 95.7MB in the end (delta: -36.9MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 04:54:49,447 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null