./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_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-tmp.no-commuhash-c3fed41 [2021-12-16 10:17:58,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 10:17:58,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 10:17:58,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 10:17:58,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 10:17:58,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 10:17:58,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 10:17:58,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 10:17:58,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 10:17:58,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 10:17:58,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 10:17:58,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 10:17:58,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 10:17:58,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 10:17:58,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 10:17:58,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 10:17:58,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 10:17:58,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 10:17:58,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 10:17:58,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 10:17:58,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 10:17:58,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 10:17:58,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 10:17:58,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 10:17:58,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 10:17:58,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 10:17:58,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 10:17:58,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 10:17:58,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 10:17:58,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 10:17:58,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 10:17:58,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 10:17:58,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 10:17:58,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 10:17:58,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 10:17:58,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 10:17:58,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 10:17:58,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 10:17:58,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 10:17:58,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 10:17:58,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 10:17:58,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 10:17:58,555 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 10:17:58,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 10:17:58,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 10:17:58,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 10:17:58,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 10:17:58,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 10:17:58,559 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 10:17:58,560 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 10:17:58,560 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 10:17:58,560 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 10:17:58,561 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 10:17:58,561 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 10:17:58,561 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 10:17:58,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 10:17:58,561 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 10:17:58,561 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 10:17:58,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 10:17:58,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 10:17:58,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 10:17:58,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 10:17:58,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 10:17:58,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 10:17:58,562 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 10:17:58,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 10:17:58,563 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 10:17:58,563 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 10:17:58,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 10:17:58,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 10:17:58,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 10:17:58,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 10:17:58,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 10:17:58,564 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 10:17:58,564 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 10:17:58,565 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 [2021-12-16 10:17:58,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 10:17:58,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 10:17:58,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 10:17:58,805 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 10:17:58,805 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 10:17:58,806 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 [2021-12-16 10:17:58,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3ab9d2f/efa55578ef284732adfa028d48720c35/FLAGcf3a7b0f2 [2021-12-16 10:17:59,288 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 10:17:59,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2021-12-16 10:17:59,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3ab9d2f/efa55578ef284732adfa028d48720c35/FLAGcf3a7b0f2 [2021-12-16 10:17:59,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3ab9d2f/efa55578ef284732adfa028d48720c35 [2021-12-16 10:17:59,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 10:17:59,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 10:17:59,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 10:17:59,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 10:17:59,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 10:17:59,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:17:59" (1/1) ... [2021-12-16 10:17:59,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7d2559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:17:59, skipping insertion in model container [2021-12-16 10:17:59,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:17:59" (1/1) ... [2021-12-16 10:17:59,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 10:17:59,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 10:18:00,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:18:00,041 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 10:18:00,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:18:00,123 INFO L208 MainTranslator]: Completed translation [2021-12-16 10:18:00,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00 WrapperNode [2021-12-16 10:18:00,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 10:18:00,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 10:18:00,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 10:18:00,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 10:18:00,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,175 INFO L137 Inliner]: procedures = 166, calls = 79, calls flagged for inlining = 30, calls inlined = 7, statements flattened = 98 [2021-12-16 10:18:00,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 10:18:00,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 10:18:00,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 10:18:00,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 10:18:00,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 10:18:00,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 10:18:00,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 10:18:00,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 10:18:00,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (1/1) ... [2021-12-16 10:18:00,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:00,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:00,236 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) [2021-12-16 10:18:00,237 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 [2021-12-16 10:18:00,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 10:18:00,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 10:18:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 10:18:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 10:18:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 10:18:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 10:18:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 10:18:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 10:18:00,325 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 10:18:00,327 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 10:18:00,447 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 10:18:00,451 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 10:18:00,452 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 10:18:00,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:18:00 BoogieIcfgContainer [2021-12-16 10:18:00,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 10:18:00,453 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 10:18:00,453 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 10:18:00,461 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 10:18:00,462 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:18:00,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 10:17:59" (1/3) ... [2021-12-16 10:18:00,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@487d34f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:18:00, skipping insertion in model container [2021-12-16 10:18:00,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:18:00,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:18:00" (2/3) ... [2021-12-16 10:18:00,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@487d34f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:18:00, skipping insertion in model container [2021-12-16 10:18:00,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:18:00,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:18:00" (3/3) ... [2021-12-16 10:18:00,464 INFO L388 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2021-12-16 10:18:00,518 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 10:18:00,518 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 10:18:00,518 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 10:18:00,519 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 10:18:00,519 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 10:18:00,519 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 10:18:00,519 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 10:18:00,519 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 10:18:00,532 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) [2021-12-16 10:18:00,555 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:18:00,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:18:00,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:18:00,558 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-16 10:18:00,559 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:18:00,559 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 10:18:00,560 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) [2021-12-16 10:18:00,563 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:18:00,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:18:00,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:18:00,563 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-16 10:18:00,564 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:18:00,566 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 [2021-12-16 10:18:00,567 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 [2021-12-16 10:18:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2021-12-16 10:18:00,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:00,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331816291] [2021-12-16 10:18:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:00,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:18:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:18:00,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:18:00,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331816291] [2021-12-16 10:18:00,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331816291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:18:00,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:18:00,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:18:00,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325471733] [2021-12-16 10:18:00,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:18:00,748 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:18:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2021-12-16 10:18:00,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:00,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890248984] [2021-12-16 10:18:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:00,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:00,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:00,790 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:18:00,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:18:00,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 10:18:00,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 10:18:00,869 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) [2021-12-16 10:18:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:18:00,922 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2021-12-16 10:18:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 10:18:00,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 61 transitions. [2021-12-16 10:18:00,934 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2021-12-16 10:18:00,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 33 states and 41 transitions. [2021-12-16 10:18:00,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-16 10:18:00,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-16 10:18:00,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2021-12-16 10:18:00,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:18:00,940 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-16 10:18:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2021-12-16 10:18:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2021-12-16 10:18:00,957 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) [2021-12-16 10:18:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-12-16 10:18:00,959 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-12-16 10:18:00,959 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-12-16 10:18:00,959 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 10:18:00,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2021-12-16 10:18:00,962 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:18:00,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:18:00,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:18:00,963 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-16 10:18:00,963 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:18:00,963 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 [2021-12-16 10:18:00,963 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 [2021-12-16 10:18:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:00,965 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2021-12-16 10:18:00,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:00,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509167329] [2021-12-16 10:18:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:00,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:01,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:01,013 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:18:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2021-12-16 10:18:01,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:01,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500119506] [2021-12-16 10:18:01,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:01,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:01,020 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:01,026 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:18:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2021-12-16 10:18:01,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:01,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218018180] [2021-12-16 10:18:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:01,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:01,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:01,061 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:18:01,375 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:18:01,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:18:01,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:18:01,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:18:01,376 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:18:01,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:01,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:18:01,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:18:01,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2021-12-16 10:18:01,377 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:18:01,377 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:18:01,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:18:01,863 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:18:01,866 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:18:01,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:01,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:01,869 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) [2021-12-16 10:18:01,874 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 [2021-12-16 10:18:01,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:01,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:18:01,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:01,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:01,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:01,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:18:01,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:18:01,902 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 [2021-12-16 10:18:01,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:01,934 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 [2021-12-16 10:18:01,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:01,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:01,936 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) [2021-12-16 10:18:01,938 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 [2021-12-16 10:18:01,939 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 [2021-12-16 10:18:01,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:01,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:18:01,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:01,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:01,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:01,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:18:01,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:18:01,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:01,983 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 [2021-12-16 10:18:01,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:01,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:01,985 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) [2021-12-16 10:18:01,986 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 [2021-12-16 10:18:01,987 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 [2021-12-16 10:18:01,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:01,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:01,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:01,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:01,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:18:01,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:18:02,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:02,032 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 [2021-12-16 10:18:02,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,047 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) [2021-12-16 10:18:02,048 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 [2021-12-16 10:18:02,050 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 [2021-12-16 10:18:02,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:02,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:18:02,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:02,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:02,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:02,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:18:02,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:18:02,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:02,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-16 10:18:02,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,076 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) [2021-12-16 10:18:02,077 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 [2021-12-16 10:18:02,078 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 [2021-12-16 10:18:02,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:02,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:02,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:02,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:02,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:18:02,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:18:02,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:02,108 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 [2021-12-16 10:18:02,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,109 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) [2021-12-16 10:18:02,110 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 [2021-12-16 10:18:02,114 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 [2021-12-16 10:18:02,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:02,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:18:02,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:02,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:02,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:02,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:18:02,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:18:02,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:02,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-16 10:18:02,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,141 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) [2021-12-16 10:18:02,143 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 [2021-12-16 10:18:02,144 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 [2021-12-16 10:18:02,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:02,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:18:02,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:02,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:02,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:02,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:18:02,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:18:02,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:02,185 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 [2021-12-16 10:18:02,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,186 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) [2021-12-16 10:18:02,187 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 [2021-12-16 10:18:02,189 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 [2021-12-16 10:18:02,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:02,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:02,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:02,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:02,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:18:02,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:18:02,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:02,223 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 [2021-12-16 10:18:02,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,224 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) [2021-12-16 10:18:02,225 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 [2021-12-16 10:18:02,226 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 [2021-12-16 10:18:02,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:02,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:02,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:02,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:02,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:18:02,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:18:02,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:02,273 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 [2021-12-16 10:18:02,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,274 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) [2021-12-16 10:18:02,278 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 [2021-12-16 10:18:02,279 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 [2021-12-16 10:18:02,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:02,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:02,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:02,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:02,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:18:02,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:18:02,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:02,318 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 [2021-12-16 10:18:02,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,319 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) [2021-12-16 10:18:02,320 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 [2021-12-16 10:18:02,321 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 [2021-12-16 10:18:02,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:02,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:02,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:02,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:02,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:18:02,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:18:02,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:18:02,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-16 10:18:02,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,357 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) [2021-12-16 10:18:02,358 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 [2021-12-16 10:18:02,360 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 [2021-12-16 10:18:02,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:18:02,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:18:02,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:18:02,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:18:02,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:18:02,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:18:02,388 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:18:02,416 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2021-12-16 10:18:02,416 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 20 variables to zero. [2021-12-16 10:18:02,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:18:02,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:02,419 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:18:02,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:18:02,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-16 10:18:02,448 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-16 10:18:02,449 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:18:02,449 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_ldv_malloc_#res#1.base)_1, ULTIMATE.start_entry_point_~i~2#1) = 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#res#1.base)_1 - 2*ULTIMATE.start_entry_point_~i~2#1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_entry_point_~array~0#1.base)_1 - 2*ULTIMATE.start_entry_point_~len~0#1 >= 0] [2021-12-16 10:18:02,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-16 10:18:02,497 INFO L297 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2021-12-16 10:18:02,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:18:02,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 10:18:02,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:18:02,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 10:18:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:18:02,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 10:18:02,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:18:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:18:02,725 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2021-12-16 10:18:02,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) [2021-12-16 10:18:02,807 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 34 states and 44 transitions. Complement of second has 10 states. [2021-12-16 10:18:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 10:18:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) [2021-12-16 10:18:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2021-12-16 10:18:02,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-16 10:18:02,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:18:02,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2021-12-16 10:18:02,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:18:02,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2021-12-16 10:18:02,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:18:02,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2021-12-16 10:18:02,812 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:18:02,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 34 transitions. [2021-12-16 10:18:02,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-16 10:18:02,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-16 10:18:02,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2021-12-16 10:18:02,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:18:02,813 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-16 10:18:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2021-12-16 10:18:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-16 10:18:02,815 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) [2021-12-16 10:18:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2021-12-16 10:18:02,815 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-12-16 10:18:02,815 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-12-16 10:18:02,815 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 10:18:02,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2021-12-16 10:18:02,816 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-16 10:18:02,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:18:02,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:18:02,816 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:18:02,816 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-16 10:18:02,816 INFO L791 eck$LassoCheckResult]: Stem: 247#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); 248#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; 257#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; 253#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; 245#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 246#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 262#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; 258#L764-3 [2021-12-16 10:18:02,817 INFO L793 eck$LassoCheckResult]: Loop: 258#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; 263#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; 264#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; 254#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); 256#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; 258#L764-3 [2021-12-16 10:18:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2021-12-16 10:18:02,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892956942] [2021-12-16 10:18:02,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:02,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:18:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:18:02,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:18:02,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892956942] [2021-12-16 10:18:02,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892956942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:18:02,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:18:02,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 10:18:02,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264062063] [2021-12-16 10:18:02,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:18:02,844 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:18:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2021-12-16 10:18:02,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:02,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650228852] [2021-12-16 10:18:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:02,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:02,852 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:02,883 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:18:02,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-16 10:18:03,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:18:03,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 10:18:03,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 10:18:03,055 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) [2021-12-16 10:18:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:18:03,068 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-12-16 10:18:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 10:18:03,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2021-12-16 10:18:03,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-16 10:18:03,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2021-12-16 10:18:03,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-16 10:18:03,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-16 10:18:03,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2021-12-16 10:18:03,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:18:03,070 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-12-16 10:18:03,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2021-12-16 10:18:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-12-16 10:18:03,071 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) [2021-12-16 10:18:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-16 10:18:03,071 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-16 10:18:03,071 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-16 10:18:03,071 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 10:18:03,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-12-16 10:18:03,072 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-16 10:18:03,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:18:03,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:18:03,072 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:18:03,072 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-16 10:18:03,072 INFO L791 eck$LassoCheckResult]: Stem: 297#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); 298#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; 309#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; 308#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; 299#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 300#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); 295#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; 296#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 314#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; 310#L764-3 [2021-12-16 10:18:03,072 INFO L793 eck$LassoCheckResult]: Loop: 310#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; 315#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; 316#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; 305#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); 307#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; 310#L764-3 [2021-12-16 10:18:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2021-12-16 10:18:03,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:03,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569870548] [2021-12-16 10:18:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:03,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:18:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:18:03,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:18:03,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569870548] [2021-12-16 10:18:03,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569870548] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:18:03,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605190441] [2021-12-16 10:18:03,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:03,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:18:03,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:03,132 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) [2021-12-16 10:18:03,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-16 10:18:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:18:03,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 10:18:03,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:18:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:18:03,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:18:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:18:03,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605190441] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:18:03,249 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:18:03,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-16 10:18:03,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909611004] [2021-12-16 10:18:03,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:18:03,250 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:18:03,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:03,250 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2021-12-16 10:18:03,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:03,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217824048] [2021-12-16 10:18:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:03,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:03,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:03,277 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:18:03,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:18:03,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 10:18:03,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-12-16 10:18:03,466 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) [2021-12-16 10:18:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:18:03,506 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2021-12-16 10:18:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 10:18:03,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2021-12-16 10:18:03,508 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-16 10:18:03,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 33 transitions. [2021-12-16 10:18:03,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-16 10:18:03,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-16 10:18:03,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-12-16 10:18:03,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:18:03,508 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-16 10:18:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-12-16 10:18:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-16 10:18:03,509 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) [2021-12-16 10:18:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-16 10:18:03,510 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-16 10:18:03,510 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-16 10:18:03,510 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 10:18:03,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2021-12-16 10:18:03,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-16 10:18:03,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:18:03,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:18:03,510 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:18:03,511 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-16 10:18:03,511 INFO L791 eck$LassoCheckResult]: Stem: 412#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); 413#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; 424#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; 423#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; 414#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 415#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); 429#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; 430#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); 410#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; 411#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); 437#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; 436#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); 435#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; 434#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 431#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; 425#L764-3 [2021-12-16 10:18:03,511 INFO L793 eck$LassoCheckResult]: Loop: 425#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; 432#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; 433#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; 420#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); 422#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; 425#L764-3 [2021-12-16 10:18:03,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 2 times [2021-12-16 10:18:03,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:03,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353737939] [2021-12-16 10:18:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:03,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:18:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:18:03,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:18:03,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353737939] [2021-12-16 10:18:03,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353737939] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:18:03,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865396780] [2021-12-16 10:18:03,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 10:18:03,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:18:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:18:03,584 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:18:03,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-16 10:18:03,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 10:18:03,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 10:18:03,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 10:18:03,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:18:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:18:03,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:18:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:18:03,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865396780] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:18:03,779 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:18:03,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2021-12-16 10:18:03,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775332803] [2021-12-16 10:18:03,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:18:03,780 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:18:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2021-12-16 10:18:03,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:03,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28336561] [2021-12-16 10:18:03,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:03,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:03,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:03,790 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:18:03,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:18:03,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 10:18:03,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2021-12-16 10:18:03,943 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) [2021-12-16 10:18:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:18:04,067 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-12-16 10:18:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 10:18:04,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2021-12-16 10:18:04,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-16 10:18:04,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 45 transitions. [2021-12-16 10:18:04,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-16 10:18:04,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-16 10:18:04,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 45 transitions. [2021-12-16 10:18:04,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:18:04,071 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-16 10:18:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 45 transitions. [2021-12-16 10:18:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-12-16 10:18:04,073 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) [2021-12-16 10:18:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-16 10:18:04,074 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-16 10:18:04,074 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-16 10:18:04,074 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 10:18:04,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2021-12-16 10:18:04,074 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-16 10:18:04,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:18:04,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:18:04,082 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:18:04,086 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-16 10:18:04,086 INFO L791 eck$LassoCheckResult]: Stem: 596#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); 597#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; 608#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; 607#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; 598#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 599#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); 613#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; 614#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); 594#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; 595#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); 633#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; 632#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); 631#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; 630#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); 629#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; 628#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); 627#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; 626#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); 625#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; 624#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); 623#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; 622#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); 621#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; 620#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); 619#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; 618#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 615#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; 609#L764-3 [2021-12-16 10:18:04,086 INFO L793 eck$LassoCheckResult]: Loop: 609#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; 616#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; 617#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; 604#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); 606#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; 609#L764-3 [2021-12-16 10:18:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 3 times [2021-12-16 10:18:04,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:04,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976904239] [2021-12-16 10:18:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:04,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:04,175 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:04,249 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:18:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2021-12-16 10:18:04,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:04,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505152686] [2021-12-16 10:18:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:04,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:04,276 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:04,286 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:18:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:18:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2021-12-16 10:18:04,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:18:04,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790087306] [2021-12-16 10:18:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:18:04,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:18:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:04,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:18:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:18:04,460 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace