./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_1-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 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:36:06,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:36:06,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:36:06,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:36:06,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:36:06,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:36:06,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:36:06,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:36:06,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:36:06,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:36:06,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:36:06,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:36:06,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:36:06,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:36:06,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:36:06,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:36:06,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:36:06,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:36:06,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:36:06,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:36:06,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:36:06,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:36:06,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:36:06,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:36:06,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:36:06,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:36:06,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:36:06,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:36:06,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:36:06,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:36:06,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:36:06,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:36:06,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:36:06,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:36:06,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:36:06,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:36:06,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:36:06,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:36:06,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:36:06,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:36:06,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:36:06,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:36:06,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:36:06,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:36:06,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:36:06,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:36:06,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:36:06,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:36:06,449 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:36:06,449 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:36:06,449 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:36:06,450 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:36:06,450 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:36:06,450 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:36:06,450 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:36:06,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:36:06,450 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:36:06,450 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:36:06,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:36:06,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:36:06,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:36:06,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:36:06,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:36:06,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:36:06,451 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:36:06,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:36:06,452 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:36:06,452 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:36:06,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:36:06,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:36:06,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:36:06,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:36:06,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:36:06,453 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:36:06,453 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 -> 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 [2022-02-21 04:36:06,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:36:06,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:36:06,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:36:06,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:36:06,709 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:36:06,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2022-02-21 04:36:06,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d90dad4/5182048b71934622b89cb3c131cdf56b/FLAGac1bcf28e [2022-02-21 04:36:07,139 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:36:07,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2022-02-21 04:36:07,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d90dad4/5182048b71934622b89cb3c131cdf56b/FLAGac1bcf28e [2022-02-21 04:36:07,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d90dad4/5182048b71934622b89cb3c131cdf56b [2022-02-21 04:36:07,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:36:07,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:36:07,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:36:07,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:36:07,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:36:07,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:36:07" (1/1) ... [2022-02-21 04:36:07,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263b7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:07, skipping insertion in model container [2022-02-21 04:36:07,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:36:07" (1/1) ... [2022-02-21 04:36:07,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:36:07,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:36:08,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:36:08,122 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:36:08,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:36:08,219 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:36:08,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08 WrapperNode [2022-02-21 04:36:08,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:36:08,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:36:08,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:36:08,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:36:08,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,262 INFO L137 Inliner]: procedures = 166, calls = 79, calls flagged for inlining = 30, calls inlined = 7, statements flattened = 98 [2022-02-21 04:36:08,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:36:08,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:36:08,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:36:08,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:36:08,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:36:08,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:36:08,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:36:08,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:36:08,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (1/1) ... [2022-02-21 04:36:08,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:08,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:08,386 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-02-21 04:36:08,412 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-02-21 04:36:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 04:36:08,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:36:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 04:36:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 04:36:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:36:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-21 04:36:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:36:08,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:36:08,518 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:36:08,519 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:36:08,718 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:36:08,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:36:08,723 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 04:36:08,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:36:08 BoogieIcfgContainer [2022-02-21 04:36:08,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:36:08,725 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:36:08,725 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:36:08,727 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:36:08,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:36:08,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:36:07" (1/3) ... [2022-02-21 04:36:08,729 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37ad9add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:36:08, skipping insertion in model container [2022-02-21 04:36:08,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:36:08,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:36:08" (2/3) ... [2022-02-21 04:36:08,730 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37ad9add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:36:08, skipping insertion in model container [2022-02-21 04:36:08,730 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:36:08,730 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:36:08" (3/3) ... [2022-02-21 04:36:08,731 INFO L388 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2022-02-21 04:36:08,760 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:36:08,760 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:36:08,761 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:36:08,761 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:36:08,761 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:36:08,761 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:36:08,761 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:36:08,761 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:36:08,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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-02-21 04:36:08,788 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-02-21 04:36:08,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:08,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:08,792 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:08,792 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:08,792 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:36:08,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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-02-21 04:36:08,795 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-02-21 04:36:08,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:08,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:08,796 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:08,796 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:08,799 INFO L791 eck$LassoCheckResult]: Stem: 15#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); 7#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.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 24#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; 20#L529true entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 16#L787true assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 9#L788-3true [2022-02-21 04:36:08,800 INFO L793 eck$LassoCheckResult]: Loop: 9#L788-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); 3#L788-2true entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 9#L788-3true [2022-02-21 04:36:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2022-02-21 04:36:08,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:08,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596846173] [2022-02-21 04:36:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:08,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:08,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} 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); {30#true} is VALID [2022-02-21 04:36:08,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {30#true} is VALID [2022-02-21 04:36:08,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} 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; {32#(and (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res#1.base| 0))} is VALID [2022-02-21 04:36:08,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#(and (= |ULTIMATE.start_ldv_malloc_#res#1.offset| 0) (= |ULTIMATE.start_ldv_malloc_#res#1.base| 0))} entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {33#(and (= |ULTIMATE.start_entry_point_~array~0#1.base| 0) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0))} is VALID [2022-02-21 04:36:08,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#(and (= |ULTIMATE.start_entry_point_~array~0#1.base| 0) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0))} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; {31#false} is VALID [2022-02-21 04:36:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:08,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:08,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596846173] [2022-02-21 04:36:08,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596846173] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:36:08,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:36:08,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:36:08,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787002321] [2022-02-21 04:36:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:36:08,986 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:08,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:08,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2022-02-21 04:36:08,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:08,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330016642] [2022-02-21 04:36:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:08,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:09,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:09,047 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:09,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:36:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:36:09,158 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:09,287 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-02-21 04:36:09,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:36:09,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:09,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:09,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 61 transitions. [2022-02-21 04:36:09,303 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2022-02-21 04:36:09,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 33 states and 41 transitions. [2022-02-21 04:36:09,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-02-21 04:36:09,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-02-21 04:36:09,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2022-02-21 04:36:09,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:36:09,311 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-02-21 04:36:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2022-02-21 04:36:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2022-02-21 04:36:09,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:09,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 41 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-02-21 04:36:09,327 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 41 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-02-21 04:36:09,328 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-02-21 04:36:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:09,331 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-21 04:36:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-21 04:36:09,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:09,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:09,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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 33 states and 41 transitions. [2022-02-21 04:36:09,333 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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 33 states and 41 transitions. [2022-02-21 04:36:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:09,338 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-21 04:36:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-21 04:36:09,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:09,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:09,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:09,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-02-21 04:36:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-02-21 04:36:09,344 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-21 04:36:09,345 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-21 04:36:09,345 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:36:09,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2022-02-21 04:36:09,345 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-02-21 04:36:09,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:09,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:09,346 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:09,346 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:36:09,346 INFO L791 eck$LassoCheckResult]: Stem: 93#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); 94#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.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 104#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; 103#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 95#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 92#L788-3 [2022-02-21 04:36:09,346 INFO L793 eck$LassoCheckResult]: Loop: 92#L788-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); 91#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 92#L788-3 [2022-02-21 04:36:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2022-02-21 04:36:09,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:09,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937775048] [2022-02-21 04:36:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:09,357 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:09,365 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2022-02-21 04:36:09,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:09,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136688587] [2022-02-21 04:36:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:09,375 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:09,380 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:09,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:09,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2022-02-21 04:36:09,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:09,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708865166] [2022-02-21 04:36:09,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:09,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:09,407 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:09,761 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:36:09,761 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:36:09,761 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:36:09,761 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:36:09,762 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:36:09,762 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:09,762 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:36:09,762 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:36:09,762 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2022-02-21 04:36:09,762 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:36:09,762 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:36:09,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:09,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:09,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:09,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:09,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:36:10,463 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:36:10,465 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:36:10,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,484 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-02-21 04:36:10,485 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-02-21 04:36:10,487 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-02-21 04:36:10,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:10,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:10,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:10,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:10,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:10,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:10,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:10,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:10,524 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-02-21 04:36:10,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,526 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-02-21 04:36:10,527 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-02-21 04:36:10,528 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-02-21 04:36:10,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:10,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:10,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:10,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:10,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:10,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:10,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:10,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:10,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:10,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,569 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-02-21 04:36:10,570 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-02-21 04:36:10,572 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-02-21 04:36:10,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:10,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:10,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:10,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:10,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:10,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:10,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:10,627 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-02-21 04:36:10,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,629 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-02-21 04:36:10,630 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-02-21 04:36:10,632 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-02-21 04:36:10,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:10,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:10,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:10,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:10,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:10,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:10,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:10,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:10,669 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-02-21 04:36:10,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,684 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-02-21 04:36:10,688 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-02-21 04:36:10,689 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-02-21 04:36:10,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:10,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:10,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:10,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:10,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:10,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:10,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:10,767 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-02-21 04:36:10,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,771 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-02-21 04:36:10,772 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-02-21 04:36:10,773 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-02-21 04:36:10,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:10,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:10,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:10,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:10,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:10,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:10,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:10,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:10,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 04:36:10,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,851 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-02-21 04:36:10,860 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-02-21 04:36:10,861 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-02-21 04:36:10,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:10,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:36:10,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:10,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:10,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:10,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:36:10,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:36:10,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:10,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:36:10,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,912 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-02-21 04:36:10,912 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-02-21 04:36:10,914 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-02-21 04:36:10,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:10,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:10,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:10,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:10,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:10,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:10,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:10,959 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-02-21 04:36:10,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:10,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:10,961 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-02-21 04:36:10,962 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-02-21 04:36:10,963 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-02-21 04:36:10,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:10,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:10,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:10,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:10,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:10,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:10,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:11,003 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-02-21 04:36:11,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:11,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:11,005 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-02-21 04:36:11,019 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-02-21 04:36:11,020 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-02-21 04:36:11,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:11,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:11,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:11,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:11,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:11,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:11,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:36:11,060 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-02-21 04:36:11,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:11,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:11,062 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-02-21 04:36:11,063 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-02-21 04:36:11,064 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-02-21 04:36:11,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:36:11,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:36:11,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:36:11,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:36:11,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:36:11,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:36:11,113 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:36:11,176 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 04:36:11,176 INFO L444 ModelExtractionUtils]: 19 out of 37 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-02-21 04:36:11,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:36:11,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:11,179 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-02-21 04:36:11,180 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-02-21 04:36:11,203 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:36:11,229 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:36:11,229 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:36:11,230 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0#1, ULTIMATE.start_entry_point_~i~2#1) = 1*ULTIMATE.start_entry_point_~len~0#1 - 1*ULTIMATE.start_entry_point_~i~2#1 Supporting invariants [] [2022-02-21 04:36:11,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:36:11,304 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-02-21 04:36:11,308 INFO L390 LassoCheck]: Loop: "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);" "entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1;" [2022-02-21 04:36:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:11,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:11,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:36:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:11,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:11,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call #Ultimate.allocInit(8, 1);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); {187#unseeded} is VALID [2022-02-21 04:36:11,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {187#unseeded} is VALID [2022-02-21 04:36:11,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {187#unseeded} 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; {187#unseeded} is VALID [2022-02-21 04:36:11,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {187#unseeded} entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {187#unseeded} is VALID [2022-02-21 04:36:11,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {187#unseeded} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; {187#unseeded} is VALID [2022-02-21 04:36:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:11,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:36:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:11,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:11,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|))} 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); {257#(and (< |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-21 04:36:11,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(and (< |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {240#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_entry_point_~i~2#1|) |ULTIMATE.start_entry_point_~len~0#1|))) unseeded)} is VALID [2022-02-21 04:36:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:11,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:11,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:11,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:36:11,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,504 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:36:11,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:11,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 50 transitions. Complement of second has 6 states. [2022-02-21 04:36:11,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:36:11,623 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:11,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. cyclomatic complexity: 9 [2022-02-21 04:36:11,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:11,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:11,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:11,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:11,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:11,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:11,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2022-02-21 04:36:11,625 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:36:11,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:11,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:11,627 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 26 transitions. cyclomatic complexity: 9 [2022-02-21 04:36:11,628 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2022-02-21 04:36:11,628 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:11,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:36:11,629 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:36:11,629 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 50 transitions. cyclomatic complexity: 20 [2022-02-21 04:36:11,630 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 04:36:11,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:36:11,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:36:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:36:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:11,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:11,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 37 letters. Loop has 37 letters. [2022-02-21 04:36:11,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 37 letters. [2022-02-21 04:36:11,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 37 letters. Loop has 37 letters. [2022-02-21 04:36:11,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:36:11,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:36:11,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:36:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:36:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:36:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:36:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:11,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:11,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:36:11,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:36:11,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:36:11,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:36:11,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:36:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:36:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:36:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:36:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:36:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:36:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:36:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:36:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:36:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:36:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:36:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:36:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:36:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:36:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:36:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:36:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:36:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:36:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:36:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:36:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:36:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:36:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:36:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 5 letters. [2022-02-21 04:36:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:36:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:36:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 5 letters. [2022-02-21 04:36:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 5 letters. [2022-02-21 04:36:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:36:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:36:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 5 letters. [2022-02-21 04:36:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:11,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:11,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 50 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 5 letters. [2022-02-21 04:36:11,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,642 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:36:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-21 04:36:11,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:36:11,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:36:11,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:36:11,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:36:11,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. cyclomatic complexity: 20 [2022-02-21 04:36:11,645 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:36:11,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 22 states and 28 transitions. [2022-02-21 04:36:11,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 04:36:11,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 04:36:11,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2022-02-21 04:36:11,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:36:11,646 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-21 04:36:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2022-02-21 04:36:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-21 04:36:11,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:11,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-02-21 04:36:11,663 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-02-21 04:36:11,663 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-02-21 04:36:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:11,664 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-21 04:36:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-21 04:36:11,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:11,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:11,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 22 states and 28 transitions. [2022-02-21 04:36:11,664 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 22 states and 28 transitions. [2022-02-21 04:36:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:11,665 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-21 04:36:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-21 04:36:11,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:11,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:11,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:11,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-02-21 04:36:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-21 04:36:11,666 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-21 04:36:11,666 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-21 04:36:11,666 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:36:11,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2022-02-21 04:36:11,666 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:36:11,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:11,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:11,667 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:11,667 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:11,667 INFO L791 eck$LassoCheckResult]: Stem: 309#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); 310#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.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 321#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; 320#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 311#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 312#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 326#L788-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; 322#L764-3 [2022-02-21 04:36:11,667 INFO L793 eck$LassoCheckResult]: Loop: 322#L764-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; 328#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; 327#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; 317#L766 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); 319#L764-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; 322#L764-3 [2022-02-21 04:36:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2022-02-21 04:36:11,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:11,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041468200] [2022-02-21 04:36:11,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:11,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:11,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {376#true} 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); {376#true} is VALID [2022-02-21 04:36:11,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {378#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:11,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#(<= 10 |ULTIMATE.start_entry_point_~len~0#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; {378#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:11,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {378#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {378#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:11,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {378#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; {379#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:11,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} assume !(entry_point_~i~2#1 < entry_point_~len~0#1); {377#false} is VALID [2022-02-21 04:36:11,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#false} 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; {377#false} is VALID [2022-02-21 04:36:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:11,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:11,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041468200] [2022-02-21 04:36:11,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041468200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:36:11,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:36:11,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:36:11,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591040686] [2022-02-21 04:36:11,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:36:11,738 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2022-02-21 04:36:11,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:11,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83038129] [2022-02-21 04:36:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:11,772 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:11,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 04:36:12,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:12,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:36:12,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:36:12,036 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:12,078 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-21 04:36:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:36:12,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:12,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:12,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2022-02-21 04:36:12,087 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:36:12,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2022-02-21 04:36:12,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 04:36:12,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 04:36:12,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2022-02-21 04:36:12,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:36:12,089 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-21 04:36:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2022-02-21 04:36:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-21 04:36:12,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:12,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-02-21 04:36:12,100 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-02-21 04:36:12,100 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-02-21 04:36:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:12,100 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-21 04:36:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-21 04:36:12,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:12,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:12,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 23 states and 28 transitions. [2022-02-21 04:36:12,101 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 23 states and 28 transitions. [2022-02-21 04:36:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:12,102 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-21 04:36:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-21 04:36:12,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:12,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:12,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:12,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-02-21 04:36:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 04:36:12,103 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 04:36:12,103 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 04:36:12,103 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:36:12,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-02-21 04:36:12,103 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:36:12,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:12,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:12,104 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:12,104 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:12,104 INFO L791 eck$LassoCheckResult]: Stem: 409#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); 410#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.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 419#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; 415#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 407#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 408#L788-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); 405#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 406#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 424#L788-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; 420#L764-3 [2022-02-21 04:36:12,104 INFO L793 eck$LassoCheckResult]: Loop: 420#L764-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; 425#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; 426#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; 416#L766 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); 418#L764-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; 420#L764-3 [2022-02-21 04:36:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2022-02-21 04:36:12,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:12,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949740857] [2022-02-21 04:36:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:12,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {476#true} 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); {476#true} is VALID [2022-02-21 04:36:12,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {476#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#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; {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; {479#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:12,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {479#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} 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); {479#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:12,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {479#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {480#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 9) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 9) |ULTIMATE.start_entry_point_~len~0#1|)} assume !(entry_point_~i~2#1 < entry_point_~len~0#1); {477#false} is VALID [2022-02-21 04:36:12,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#false} 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; {477#false} is VALID [2022-02-21 04:36:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:12,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:12,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949740857] [2022-02-21 04:36:12,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949740857] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:36:12,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432228213] [2022-02-21 04:36:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:12,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:36:12,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:12,193 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:36:12,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 04:36:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:12,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:36:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:12,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:12,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {476#true} 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); {476#true} is VALID [2022-02-21 04:36:12,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {476#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#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; {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {478#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; {496#(and (<= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:12,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {496#(and (<= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} 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); {496#(and (<= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:12,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {496#(and (<= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {503#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 1))} is VALID [2022-02-21 04:36:12,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 1))} assume !(entry_point_~i~2#1 < entry_point_~len~0#1); {477#false} is VALID [2022-02-21 04:36:12,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#false} 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; {477#false} is VALID [2022-02-21 04:36:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:12,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:36:12,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#false} 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; {477#false} is VALID [2022-02-21 04:36:12,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#(< |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} assume !(entry_point_~i~2#1 < entry_point_~len~0#1); {477#false} is VALID [2022-02-21 04:36:12,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {517#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {513#(< |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} 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); {517#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {524#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; {517#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {524#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {524#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#(< 1 |ULTIMATE.start_entry_point_~len~0#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; {524#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {476#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {524#(< 1 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {476#true} 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); {476#true} is VALID [2022-02-21 04:36:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:12,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432228213] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:36:12,380 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:36:12,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-21 04:36:12,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211279048] [2022-02-21 04:36:12,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:36:12,381 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2022-02-21 04:36:12,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:12,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336257984] [2022-02-21 04:36:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:12,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:12,396 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:12,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:12,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 04:36:12,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-02-21 04:36:12,569 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:12,656 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-21 04:36:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:36:12,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:12,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:12,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2022-02-21 04:36:12,672 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:36:12,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 33 transitions. [2022-02-21 04:36:12,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 04:36:12,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 04:36:12,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2022-02-21 04:36:12,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:36:12,673 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-21 04:36:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2022-02-21 04:36:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-21 04:36:12,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:12,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 33 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 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-02-21 04:36:12,674 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 33 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 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-02-21 04:36:12,674 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 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-02-21 04:36:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:12,675 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-21 04:36:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-21 04:36:12,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:12,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:12,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 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) Second operand 28 states and 33 transitions. [2022-02-21 04:36:12,675 INFO L87 Difference]: Start difference. First operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 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) Second operand 28 states and 33 transitions. [2022-02-21 04:36:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:12,676 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-21 04:36:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-21 04:36:12,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:12,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:12,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:12,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 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-02-21 04:36:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-02-21 04:36:12,677 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-21 04:36:12,677 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-21 04:36:12,677 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:36:12,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2022-02-21 04:36:12,678 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:36:12,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:12,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:12,678 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:12,678 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:12,679 INFO L791 eck$LassoCheckResult]: Stem: 570#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); 571#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.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 582#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; 578#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 572#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 573#L788-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); 587#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 588#L788-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); 568#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 569#L788-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); 595#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 594#L788-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); 593#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 592#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 589#L788-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; 583#L764-3 [2022-02-21 04:36:12,679 INFO L793 eck$LassoCheckResult]: Loop: 583#L764-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; 590#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; 591#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; 579#L766 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); 581#L764-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; 583#L764-3 [2022-02-21 04:36:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 2 times [2022-02-21 04:36:12,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:12,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101372327] [2022-02-21 04:36:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:12,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {655#true} 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); {655#true} is VALID [2022-02-21 04:36:12,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#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; {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; {658#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:12,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} 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); {658#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:12,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {658#(and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {659#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 9) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 9) |ULTIMATE.start_entry_point_~len~0#1|)} 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); {659#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 9) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 9) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {660#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 8) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {660#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 8) |ULTIMATE.start_entry_point_~len~0#1|)} 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); {660#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 8) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {660#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 8) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {661#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 7) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {661#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 7) |ULTIMATE.start_entry_point_~len~0#1|)} 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); {661#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 7) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {661#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 7) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {662#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 6) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:12,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {662#(<= (+ |ULTIMATE.start_entry_point_~i~2#1| 6) |ULTIMATE.start_entry_point_~len~0#1|)} assume !(entry_point_~i~2#1 < entry_point_~len~0#1); {656#false} is VALID [2022-02-21 04:36:12,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {656#false} 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; {656#false} is VALID [2022-02-21 04:36:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:12,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:36:12,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101372327] [2022-02-21 04:36:12,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101372327] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:36:12,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152790955] [2022-02-21 04:36:12,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 04:36:12,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:36:12,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:36:12,776 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:36:12,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 04:36:12,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 04:36:12,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 04:36:12,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:36:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:36:12,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:36:13,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {655#true} 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); {655#true} is VALID [2022-02-21 04:36:13,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#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; {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {657#(<= 10 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; {678#(and (<= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:13,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {678#(and (<= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} 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); {678#(and (<= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-21 04:36:13,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {678#(and (<= |ULTIMATE.start_entry_point_~i~2#1| 0) (<= 10 |ULTIMATE.start_entry_point_~len~0#1|))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {685#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 1))} is VALID [2022-02-21 04:36:13,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {685#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 1))} 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); {685#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 1))} is VALID [2022-02-21 04:36:13,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 1))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {692#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 2))} is VALID [2022-02-21 04:36:13,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {692#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 2))} 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); {692#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 2))} is VALID [2022-02-21 04:36:13,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {692#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 2))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {699#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 3))} is VALID [2022-02-21 04:36:13,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {699#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 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); {699#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 3))} is VALID [2022-02-21 04:36:13,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {699#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 3))} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {706#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 4))} is VALID [2022-02-21 04:36:13,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {706#(and (<= 10 |ULTIMATE.start_entry_point_~len~0#1|) (<= |ULTIMATE.start_entry_point_~i~2#1| 4))} assume !(entry_point_~i~2#1 < entry_point_~len~0#1); {656#false} is VALID [2022-02-21 04:36:13,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {656#false} 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; {656#false} is VALID [2022-02-21 04:36:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:13,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:36:13,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {656#false} 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; {656#false} is VALID [2022-02-21 04:36:13,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {716#(< |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} assume !(entry_point_~i~2#1 < entry_point_~len~0#1); {656#false} is VALID [2022-02-21 04:36:13,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {720#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {716#(< |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {720#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} 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); {720#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {727#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 2) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {720#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 1) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {727#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 2) |ULTIMATE.start_entry_point_~len~0#1|)} 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); {727#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 2) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {734#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 3) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {727#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 2) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {734#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 3) |ULTIMATE.start_entry_point_~len~0#1|)} 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); {734#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 3) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {741#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 4) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; {734#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 3) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {741#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 4) |ULTIMATE.start_entry_point_~len~0#1|)} 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); {741#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 4) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {748#(< 4 |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; {741#(< (+ |ULTIMATE.start_entry_point_~i~2#1| 4) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {748#(< 4 |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {748#(< 4 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {748#(< 4 |ULTIMATE.start_entry_point_~len~0#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; {748#(< 4 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; {748#(< 4 |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-21 04:36:13,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {655#true} 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); {655#true} is VALID [2022-02-21 04:36:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:36:13,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152790955] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:36:13,160 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:36:13,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-02-21 04:36:13,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926053751] [2022-02-21 04:36:13,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:36:13,160 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:36:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2022-02-21 04:36:13,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:13,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793232154] [2022-02-21 04:36:13,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,170 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,181 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:13,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:36:13,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 04:36:13,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2022-02-21 04:36:13,355 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:13,537 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-21 04:36:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 04:36:13,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:36:13,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:36:13,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2022-02-21 04:36:13,566 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:36:13,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 45 transitions. [2022-02-21 04:36:13,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 04:36:13,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 04:36:13,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 45 transitions. [2022-02-21 04:36:13,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:36:13,567 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-02-21 04:36:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 45 transitions. [2022-02-21 04:36:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-21 04:36:13,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:36:13,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states and 45 transitions. Second operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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-02-21 04:36:13,569 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states and 45 transitions. Second operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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-02-21 04:36:13,569 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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-02-21 04:36:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:13,569 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-21 04:36:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-02-21 04:36:13,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:13,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:13,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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 40 states and 45 transitions. [2022-02-21 04:36:13,570 INFO L87 Difference]: Start difference. First operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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 40 states and 45 transitions. [2022-02-21 04:36:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:36:13,570 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-21 04:36:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-02-21 04:36:13,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:36:13,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:36:13,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:36:13,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:36:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 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-02-21 04:36:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-02-21 04:36:13,572 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-02-21 04:36:13,572 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-02-21 04:36:13,572 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:36:13,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2022-02-21 04:36:13,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:36:13,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:36:13,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:36:13,575 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:36:13,575 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:36:13,575 INFO L791 eck$LassoCheckResult]: Stem: 812#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); 813#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.base, entry_point_#t~ret44#1.offset, entry_point_#t~post45#1, entry_point_#t~ret46#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;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1; 824#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; 823#L529 entry_point_#t~ret44#1.base, entry_point_#t~ret44#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~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; 814#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 815#L788-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); 829#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 830#L788-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); 810#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 811#L788-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); 849#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 848#L788-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); 847#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 846#L788-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); 845#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 844#L788-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); 843#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 842#L788-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); 841#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 840#L788-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); 839#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 838#L788-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); 837#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 836#L788-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); 835#L788-2 entry_point_#t~post45#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post45#1;havoc entry_point_#t~post45#1; 834#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 831#L788-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; 825#L764-3 [2022-02-21 04:36:13,575 INFO L793 eck$LassoCheckResult]: Loop: 825#L764-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; 832#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; 833#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; 820#L766 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); 822#L764-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; 825#L764-3 [2022-02-21 04:36:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 3 times [2022-02-21 04:36:13,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:13,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947255706] [2022-02-21 04:36:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,686 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2022-02-21 04:36:13,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:13,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197272391] [2022-02-21 04:36:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,725 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,730 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:36:13,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:36:13,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2022-02-21 04:36:13,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:36:13,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208873464] [2022-02-21 04:36:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:36:13,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:36:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:36:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:36:13,843 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace