./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 20ed64ec 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 5be2e30df948ebd6000c3afde848283ab7f83dcc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:40:35,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:40:35,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:40:35,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:40:35,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:40:35,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:40:35,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:40:35,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:40:35,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:40:35,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:40:35,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:40:35,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:40:35,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:40:35,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:40:35,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:40:35,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:40:35,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:40:35,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:40:35,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:40:35,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:40:35,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:40:35,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:40:35,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:40:35,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:40:35,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:40:35,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:40:35,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:40:35,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:40:35,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:40:35,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:40:35,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:40:35,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:40:35,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:40:35,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:40:35,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:40:35,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:40:35,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:40:35,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:40:35,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:40:35,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:40:35,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:40:35,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:40:35,579 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:40:35,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:40:35,580 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:40:35,580 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:40:35,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:40:35,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:40:35,582 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:40:35,582 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:40:35,582 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:40:35,582 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:40:35,583 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:40:35,583 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:40:35,583 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:40:35,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:40:35,583 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:40:35,584 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:40:35,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:40:35,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:40:35,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:40:35,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:40:35,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:40:35,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:40:35,585 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:40:35,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:40:35,585 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:40:35,585 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:40:35,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:40:35,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:40:35,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:40:35,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:40:35,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:40:35,586 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:40:35,587 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:40:35,587 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 -> 5be2e30df948ebd6000c3afde848283ab7f83dcc [2021-08-27 17:40:35,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:40:35,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:40:35,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:40:35,837 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:40:35,837 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:40:35,838 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-08-27 17:40:35,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7d17724/b16ca59ed6e54971b0e228bf027c9600/FLAG361a7c8c8 [2021-08-27 17:40:36,289 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:40:36,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2021-08-27 17:40:36,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7d17724/b16ca59ed6e54971b0e228bf027c9600/FLAG361a7c8c8 [2021-08-27 17:40:36,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7d17724/b16ca59ed6e54971b0e228bf027c9600 [2021-08-27 17:40:36,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:40:36,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:40:36,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:40:36,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:40:36,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:40:36,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dec23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36, skipping insertion in model container [2021-08-27 17:40:36,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:40:36,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:40:36,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:40:36,686 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:40:36,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:40:36,767 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:40:36,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36 WrapperNode [2021-08-27 17:40:36,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:40:36,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:40:36,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:40:36,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:40:36,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:40:36,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:40:36,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:40:36,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:40:36,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:40:36,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:40:36,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:40:36,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:40:36,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (1/1) ... [2021-08-27 17:40:36,866 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:36,879 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-08-27 17:40:36,880 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-08-27 17:40:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 17:40:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 17:40:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:40:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 17:40:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:40:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 17:40:36,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:40:36,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:40:37,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:40:37,245 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-08-27 17:40:37,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:40:37 BoogieIcfgContainer [2021-08-27 17:40:37,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:40:37,247 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:40:37,247 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:40:37,249 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:40:37,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:40:37,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:40:36" (1/3) ... [2021-08-27 17:40:37,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@746a1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:40:37, skipping insertion in model container [2021-08-27 17:40:37,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:40:37,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:40:36" (2/3) ... [2021-08-27 17:40:37,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@746a1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:40:37, skipping insertion in model container [2021-08-27 17:40:37,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:40:37,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:40:37" (3/3) ... [2021-08-27 17:40:37,251 INFO L389 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2021-08-27 17:40:37,289 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:40:37,289 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:40:37,290 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:40:37,290 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:40:37,290 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:40:37,290 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:40:37,290 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:40:37,290 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:40:37,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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-08-27 17:40:37,317 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:40:37,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:37,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:37,321 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:37,321 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:40:37,321 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:40:37,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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-08-27 17:40:37,324 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:40:37,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:37,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:37,325 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:37,325 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:40:37,328 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 12#L-1true havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 17#L526true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 10#L529true entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 6#L787true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 19#L788-3true [2021-08-27 17:40:37,329 INFO L793 eck$LassoCheckResult]: Loop: 19#L788-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 3#L788-2true entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 19#L788-3true [2021-08-27 17:40:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:37,333 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2021-08-27 17:40:37,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:37,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545021791] [2021-08-27 17:40:37,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:37,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:37,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:37,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545021791] [2021-08-27 17:40:37,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545021791] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:40:37,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:40:37,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:40:37,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372548271] [2021-08-27 17:40:37,487 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:37,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2021-08-27 17:40:37,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:37,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336929483] [2021-08-27 17:40:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:37,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:37,496 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:37,510 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:37,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:37,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:40:37,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:40:37,592 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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-08-27 17:40:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:37,629 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-08-27 17:40:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:40:37,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2021-08-27 17:40:37,632 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2021-08-27 17:40:37,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 33 states and 41 transitions. [2021-08-27 17:40:37,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-08-27 17:40:37,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-08-27 17:40:37,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2021-08-27 17:40:37,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:37,636 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-08-27 17:40:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2021-08-27 17:40:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2021-08-27 17:40:37,651 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-08-27 17:40:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-08-27 17:40:37,652 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-08-27 17:40:37,652 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-08-27 17:40:37,652 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:40:37,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2021-08-27 17:40:37,653 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:40:37,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:37,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:37,654 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:37,654 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:40:37,654 INFO L791 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 84#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 94#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 90#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 85#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 82#L788-3 [2021-08-27 17:40:37,654 INFO L793 eck$LassoCheckResult]: Loop: 82#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 81#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 82#L788-3 [2021-08-27 17:40:37,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2021-08-27 17:40:37,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:37,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087692635] [2021-08-27 17:40:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:37,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:37,664 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:37,672 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:37,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2021-08-27 17:40:37,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:37,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586208936] [2021-08-27 17:40:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:37,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:37,686 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:37,701 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:37,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2021-08-27 17:40:37,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:37,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706434295] [2021-08-27 17:40:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:37,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:37,716 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:37,728 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:38,101 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:40:38,102 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:40:38,102 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:40:38,102 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:40:38,102 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:40:38,102 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:38,102 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:40:38,102 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:40:38,103 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2021-08-27 17:40:38,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:40:38,103 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:40:38,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:40:38,717 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:40:38,720 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:40:38,721 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:38,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:38,733 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-08-27 17:40:38,736 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-08-27 17:40:38,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:38,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:40:38,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:38,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:38,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:38,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:40:38,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:40:38,745 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-08-27 17:40:38,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:38,778 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-08-27 17:40:38,778 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:38,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:38,779 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-08-27 17:40:38,781 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-08-27 17:40:38,782 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-08-27 17:40:38,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:38,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:40:38,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:38,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:38,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:38,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:40:38,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:40:38,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:38,809 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-08-27 17:40:38,809 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:38,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:38,810 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-08-27 17:40:38,811 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-08-27 17:40:38,812 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-08-27 17:40:38,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:38,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:40:38,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:38,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:38,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:38,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:40:38,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:40:38,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:38,845 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-08-27 17:40:38,846 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:38,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:38,846 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-08-27 17:40:38,847 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-08-27 17:40:38,851 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-08-27 17:40:38,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:38,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:38,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:38,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:38,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:40:38,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:38,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:38,900 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-08-27 17:40:38,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:38,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:38,901 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-08-27 17:40:38,902 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-08-27 17:40:38,904 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-08-27 17:40:38,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:38,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:40:38,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:38,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:38,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:38,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:40:38,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:40:38,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:38,952 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-08-27 17:40:38,953 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:38,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:38,958 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-08-27 17:40:38,959 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-08-27 17:40:38,960 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-08-27 17:40:38,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:38,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:38,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:38,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:38,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:40:38,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:38,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:38,997 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-08-27 17:40:38,997 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:38,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:38,998 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-08-27 17:40:38,999 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-08-27 17:40:39,000 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-08-27 17:40:39,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:39,007 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-08-27 17:40:39,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:39,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:39,014 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-08-27 17:40:39,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:39,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:39,040 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-08-27 17:40:39,041 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:39,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:39,041 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-08-27 17:40:39,042 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-08-27 17:40:39,044 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-08-27 17:40:39,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:39,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:40:39,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:39,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:39,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:39,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:40:39,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:40:39,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:39,067 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-08-27 17:40:39,068 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:39,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:39,069 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-08-27 17:40:39,071 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-08-27 17:40:39,072 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-08-27 17:40:39,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:39,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:39,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:39,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:39,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:40:39,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:39,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:40:39,105 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-08-27 17:40:39,105 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:39,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:39,106 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-08-27 17:40:39,107 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-08-27 17:40:39,108 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-08-27 17:40:39,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:40:39,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:40:39,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:40:39,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:40:39,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:40:39,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:40:39,141 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:40:39,199 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-08-27 17:40:39,199 INFO L444 ModelExtractionUtils]: 21 out of 37 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-08-27 17:40:39,200 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:40:39,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:39,213 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-08-27 17:40:39,275 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-08-27 17:40:39,275 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:40:39,301 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:40:39,301 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:40:39,302 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~2) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2021-08-27 17:40:39,322 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-08-27 17:40:39,333 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-27 17:40:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:39,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:40:39,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:39,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:40:39,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:39,434 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-08-27 17:40:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:39,453 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:40:39,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:39,482 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 50 transitions. Complement of second has 6 states. [2021-08-27 17:40:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 17:40:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2021-08-27 17:40:39,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 2 letters. [2021-08-27 17:40:39,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:40:39,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 7 letters. Loop has 2 letters. [2021-08-27 17:40:39,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:40:39,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 4 letters. [2021-08-27 17:40:39,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:40:39,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2021-08-27 17:40:39,487 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:39,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 22 states and 28 transitions. [2021-08-27 17:40:39,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 17:40:39,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:39,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2021-08-27 17:40:39,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:39,488 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-08-27 17:40:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2021-08-27 17:40:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-27 17:40:39,490 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-08-27 17:40:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2021-08-27 17:40:39,490 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-08-27 17:40:39,490 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-08-27 17:40:39,490 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:40:39,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2021-08-27 17:40:39,491 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:39,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:39,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:39,491 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:39,492 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:39,492 INFO L791 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 214#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 225#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 224#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 215#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 216#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 230#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 226#L764-3 [2021-08-27 17:40:39,492 INFO L793 eck$LassoCheckResult]: Loop: 226#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 232#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 231#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 221#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 223#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 226#L764-3 [2021-08-27 17:40:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2021-08-27 17:40:39,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:39,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641128867] [2021-08-27 17:40:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:39,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:39,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:39,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641128867] [2021-08-27 17:40:39,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641128867] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:40:39,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:40:39,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:40:39,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540095691] [2021-08-27 17:40:39,523 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2021-08-27 17:40:39,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:39,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895521583] [2021-08-27 17:40:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:39,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:39,531 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:39,538 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:39,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:39,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:40:39,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:40:39,754 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-08-27 17:40:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:39,772 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-08-27 17:40:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:40:39,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2021-08-27 17:40:39,775 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:39,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2021-08-27 17:40:39,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:39,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:39,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2021-08-27 17:40:39,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:39,779 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-08-27 17:40:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2021-08-27 17:40:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-27 17:40:39,782 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-08-27 17:40:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-08-27 17:40:39,785 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-27 17:40:39,785 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-27 17:40:39,785 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:40:39,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-08-27 17:40:39,787 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:39,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:39,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:39,788 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:39,788 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:39,788 INFO L791 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 266#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 277#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 276#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 267#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 268#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 263#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 264#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 282#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 278#L764-3 [2021-08-27 17:40:39,788 INFO L793 eck$LassoCheckResult]: Loop: 278#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 283#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 284#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 273#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 275#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 278#L764-3 [2021-08-27 17:40:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2021-08-27 17:40:39,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:39,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640841943] [2021-08-27 17:40:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:39,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:39,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:39,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640841943] [2021-08-27 17:40:39,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640841943] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:39,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938425322] [2021-08-27 17:40:39,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:39,842 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:39,843 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:40:39,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-27 17:40:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:39,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:40:39,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:39,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938425322] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:39,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:39,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-08-27 17:40:39,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128080179] [2021-08-27 17:40:39,954 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2021-08-27 17:40:39,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:39,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095246267] [2021-08-27 17:40:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:39,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:39,973 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:39,986 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:40,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:40,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:40:40,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:40:40,204 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-08-27 17:40:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:40,224 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2021-08-27 17:40:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:40:40,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2021-08-27 17:40:40,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:40,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2021-08-27 17:40:40,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:40,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:40,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2021-08-27 17:40:40,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:40,225 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-08-27 17:40:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2021-08-27 17:40:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-08-27 17:40:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-08-27 17:40:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-08-27 17:40:40,227 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-08-27 17:40:40,227 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-08-27 17:40:40,227 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:40:40,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2021-08-27 17:40:40,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:40,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:40,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:40,228 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:40,228 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:40,228 INFO L791 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 349#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 358#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 354#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 346#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 347#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 363#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 364#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 344#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 345#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 365#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 359#L764-3 [2021-08-27 17:40:40,228 INFO L793 eck$LassoCheckResult]: Loop: 359#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 366#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 367#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 355#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 357#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 359#L764-3 [2021-08-27 17:40:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 447769425, now seen corresponding path program 2 times [2021-08-27 17:40:40,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:40,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998256469] [2021-08-27 17:40:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:40,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:40,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:40,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998256469] [2021-08-27 17:40:40,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998256469] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:40,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358569451] [2021-08-27 17:40:40,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:40:40,281 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:40,282 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:40:40,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-27 17:40:40,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:40:40,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:40:40,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:40:40,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:40,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358569451] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:40,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:40,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-27 17:40:40,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171333786] [2021-08-27 17:40:40,416 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:40,416 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2021-08-27 17:40:40,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:40,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870928320] [2021-08-27 17:40:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:40,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:40,433 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:40,450 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:40,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:40,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 17:40:40,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:40:40,635 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-08-27 17:40:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:40,670 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-08-27 17:40:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:40:40,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2021-08-27 17:40:40,671 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:40,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2021-08-27 17:40:40,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:40,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:40,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2021-08-27 17:40:40,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:40,673 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-08-27 17:40:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2021-08-27 17:40:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-08-27 17:40:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-08-27 17:40:40,677 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-08-27 17:40:40,677 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-08-27 17:40:40,677 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:40:40,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2021-08-27 17:40:40,678 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:40,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:40,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:40,678 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:40,678 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:40,678 INFO L791 eck$LassoCheckResult]: Stem: 439#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 440#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 451#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 447#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 441#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 442#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 437#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 438#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 462#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 456#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 457#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 461#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 458#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 452#L764-3 [2021-08-27 17:40:40,679 INFO L793 eck$LassoCheckResult]: Loop: 452#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 459#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 460#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 448#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 450#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 452#L764-3 [2021-08-27 17:40:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash 809744147, now seen corresponding path program 3 times [2021-08-27 17:40:40,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:40,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000811358] [2021-08-27 17:40:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:40,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:40,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:40,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000811358] [2021-08-27 17:40:40,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000811358] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:40,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029572113] [2021-08-27 17:40:40,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:40:40,742 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:40,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:40,745 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-08-27 17:40:40,765 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-08-27 17:40:40,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 17:40:40,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:40:40,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:40:40,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:40,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029572113] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:40,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:40,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-08-27 17:40:40,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970285270] [2021-08-27 17:40:40,920 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:40,920 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2021-08-27 17:40:40,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:40,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085078587] [2021-08-27 17:40:40,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:40,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:40,925 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:40,929 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:41,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:41,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:40:41,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:40:41,114 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 9 Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:41,158 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2021-08-27 17:40:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:40:41,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2021-08-27 17:40:41,164 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:41,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2021-08-27 17:40:41,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:41,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:41,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2021-08-27 17:40:41,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:41,165 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-08-27 17:40:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2021-08-27 17:40:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-08-27 17:40:41,166 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-08-27 17:40:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-08-27 17:40:41,167 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-08-27 17:40:41,167 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-08-27 17:40:41,167 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 17:40:41,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2021-08-27 17:40:41,167 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:41,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:41,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:41,168 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:41,168 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:41,168 INFO L791 eck$LassoCheckResult]: Stem: 544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 545#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 556#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 552#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 546#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 547#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 561#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 562#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 542#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 543#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 569#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 568#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 567#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 566#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 563#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 557#L764-3 [2021-08-27 17:40:41,168 INFO L793 eck$LassoCheckResult]: Loop: 557#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 564#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 565#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 553#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 555#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 557#L764-3 [2021-08-27 17:40:41,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:41,168 INFO L82 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 4 times [2021-08-27 17:40:41,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:41,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745546998] [2021-08-27 17:40:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:41,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:41,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:41,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745546998] [2021-08-27 17:40:41,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745546998] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:41,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671605713] [2021-08-27 17:40:41,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:40:41,214 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:41,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:41,215 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-08-27 17:40:41,216 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-08-27 17:40:41,296 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:40:41,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:40:41,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:40:41,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:41,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671605713] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:41,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:41,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-08-27 17:40:41,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656292744] [2021-08-27 17:40:41,407 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:41,408 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 5 times [2021-08-27 17:40:41,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:41,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872502848] [2021-08-27 17:40:41,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:41,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:41,412 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:41,416 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:41,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:41,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:40:41,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2021-08-27 17:40:41,606 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-08-27 17:40:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:41,639 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-08-27 17:40:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:40:41,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2021-08-27 17:40:41,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:41,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2021-08-27 17:40:41,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:41,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:41,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2021-08-27 17:40:41,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:41,640 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-08-27 17:40:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2021-08-27 17:40:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-08-27 17:40:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-08-27 17:40:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-08-27 17:40:41,642 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-08-27 17:40:41,642 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-08-27 17:40:41,642 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 17:40:41,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2021-08-27 17:40:41,642 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:41,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:41,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:41,643 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:41,643 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:41,643 INFO L791 eck$LassoCheckResult]: Stem: 661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 662#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 673#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 672#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 663#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 664#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 678#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 679#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 659#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 660#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 688#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 687#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 686#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 685#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 684#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 683#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 680#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 674#L764-3 [2021-08-27 17:40:41,643 INFO L793 eck$LassoCheckResult]: Loop: 674#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 681#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 682#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 669#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 671#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 674#L764-3 [2021-08-27 17:40:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1842787607, now seen corresponding path program 5 times [2021-08-27 17:40:41,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:41,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587233941] [2021-08-27 17:40:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:41,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:41,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:41,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587233941] [2021-08-27 17:40:41,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587233941] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:41,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809835887] [2021-08-27 17:40:41,697 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 17:40:41,697 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:41,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:41,698 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:40:41,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 17:40:41,805 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 17:40:41,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:40:41,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 17:40:41,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:41,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809835887] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:41,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:41,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-08-27 17:40:41,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954808828] [2021-08-27 17:40:41,965 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 6 times [2021-08-27 17:40:41,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:41,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664110450] [2021-08-27 17:40:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:41,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:41,970 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:41,973 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:42,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 17:40:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2021-08-27 17:40:42,152 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 9 Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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-08-27 17:40:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:42,194 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2021-08-27 17:40:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 17:40:42,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2021-08-27 17:40:42,195 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:42,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 38 transitions. [2021-08-27 17:40:42,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:42,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:42,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2021-08-27 17:40:42,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:42,196 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-08-27 17:40:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2021-08-27 17:40:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-08-27 17:40:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 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-08-27 17:40:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2021-08-27 17:40:42,197 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-08-27 17:40:42,197 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-08-27 17:40:42,197 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 17:40:42,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2021-08-27 17:40:42,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:42,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:42,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:42,198 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:42,198 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:42,199 INFO L791 eck$LassoCheckResult]: Stem: 790#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 791#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 802#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 801#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 792#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 793#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 807#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 808#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 788#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 789#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 819#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 818#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 817#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 816#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 815#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 814#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 813#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 812#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 809#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 803#L764-3 [2021-08-27 17:40:42,199 INFO L793 eck$LassoCheckResult]: Loop: 803#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 810#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 811#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 798#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 800#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 803#L764-3 [2021-08-27 17:40:42,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1392420697, now seen corresponding path program 6 times [2021-08-27 17:40:42,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:42,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515076439] [2021-08-27 17:40:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:42,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:42,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:42,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515076439] [2021-08-27 17:40:42,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515076439] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:42,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525014383] [2021-08-27 17:40:42,261 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 17:40:42,261 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:42,266 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:40:42,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 17:40:42,416 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-27 17:40:42,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:40:42,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 17:40:42,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:42,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525014383] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:42,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:42,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-08-27 17:40:42,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736171889] [2021-08-27 17:40:42,571 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:42,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:42,571 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 7 times [2021-08-27 17:40:42,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:42,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491106727] [2021-08-27 17:40:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:42,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:42,576 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:42,580 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:42,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 17:40:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2021-08-27 17:40:42,771 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 9 Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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-08-27 17:40:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:42,838 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-08-27 17:40:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 17:40:42,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2021-08-27 17:40:42,841 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:42,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 40 transitions. [2021-08-27 17:40:42,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:42,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:42,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2021-08-27 17:40:42,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:42,842 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-08-27 17:40:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2021-08-27 17:40:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-08-27 17:40:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-08-27 17:40:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-08-27 17:40:42,843 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-08-27 17:40:42,843 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-08-27 17:40:42,843 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 17:40:42,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2021-08-27 17:40:42,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:42,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:42,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:42,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:42,844 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:42,845 INFO L791 eck$LassoCheckResult]: Stem: 933#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 934#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 943#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 939#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 931#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 932#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 948#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 949#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 929#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 930#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 962#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 961#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 960#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 959#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 958#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 957#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 956#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 955#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 954#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 953#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 950#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 944#L764-3 [2021-08-27 17:40:42,845 INFO L793 eck$LassoCheckResult]: Loop: 944#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 951#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 952#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 940#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 942#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 944#L764-3 [2021-08-27 17:40:42,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1913450213, now seen corresponding path program 7 times [2021-08-27 17:40:42,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:42,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476193943] [2021-08-27 17:40:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:42,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:42,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:42,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476193943] [2021-08-27 17:40:42,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476193943] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:42,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662658823] [2021-08-27 17:40:42,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 17:40:42,913 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:42,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:42,924 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:40:42,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 17:40:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:43,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 17:40:43,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:43,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662658823] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:43,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:43,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-08-27 17:40:43,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212481891] [2021-08-27 17:40:43,213 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 8 times [2021-08-27 17:40:43,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:43,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330938513] [2021-08-27 17:40:43,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:43,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:43,218 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:43,222 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:43,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:43,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 17:40:43,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2021-08-27 17:40:43,397 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 9 Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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-08-27 17:40:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:43,443 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-08-27 17:40:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 17:40:43,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2021-08-27 17:40:43,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:43,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 42 transitions. [2021-08-27 17:40:43,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:43,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:43,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2021-08-27 17:40:43,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:43,445 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2021-08-27 17:40:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2021-08-27 17:40:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-08-27 17:40:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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-08-27 17:40:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-08-27 17:40:43,447 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-27 17:40:43,447 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-27 17:40:43,447 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 17:40:43,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2021-08-27 17:40:43,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:43,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:43,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:43,448 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:43,448 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:43,448 INFO L791 eck$LassoCheckResult]: Stem: 1084#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 1085#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1096#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1092#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1086#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1087#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1101#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1102#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1082#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1083#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1117#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1116#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1115#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1114#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1113#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1112#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1111#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1110#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1109#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1108#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1107#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1106#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1103#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1097#L764-3 [2021-08-27 17:40:43,448 INFO L793 eck$LassoCheckResult]: Loop: 1097#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1104#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1105#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1093#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1095#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1097#L764-3 [2021-08-27 17:40:43,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:43,449 INFO L82 PathProgramCache]: Analyzing trace with hash -579595683, now seen corresponding path program 8 times [2021-08-27 17:40:43,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:43,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345202195] [2021-08-27 17:40:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:43,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:43,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:43,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345202195] [2021-08-27 17:40:43,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345202195] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:43,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184760432] [2021-08-27 17:40:43,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:40:43,534 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:43,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:43,539 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:40:43,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-27 17:40:43,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:40:43,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:40:43,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 17:40:43,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:43,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184760432] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:43,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:43,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-08-27 17:40:43,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014642596] [2021-08-27 17:40:43,906 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:43,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:43,906 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 9 times [2021-08-27 17:40:43,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:43,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40049370] [2021-08-27 17:40:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:43,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:43,911 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:43,915 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:44,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:44,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 17:40:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2021-08-27 17:40:44,121 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 9 Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 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-08-27 17:40:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:44,163 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-08-27 17:40:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 17:40:44,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2021-08-27 17:40:44,164 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:44,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 44 transitions. [2021-08-27 17:40:44,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:44,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:44,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2021-08-27 17:40:44,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:44,165 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-08-27 17:40:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2021-08-27 17:40:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-08-27 17:40:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:40:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-08-27 17:40:44,166 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-08-27 17:40:44,167 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-08-27 17:40:44,167 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 17:40:44,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2021-08-27 17:40:44,167 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:44,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:44,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:44,168 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:44,168 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:44,168 INFO L791 eck$LassoCheckResult]: Stem: 1249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 1250#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1261#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1260#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1251#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1252#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1266#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1267#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1247#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1248#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1284#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1283#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1282#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1281#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1280#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1279#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1278#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1277#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1276#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1275#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1274#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1273#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1272#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1271#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1268#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1262#L764-3 [2021-08-27 17:40:44,168 INFO L793 eck$LassoCheckResult]: Loop: 1262#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1269#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1270#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1257#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1259#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1262#L764-3 [2021-08-27 17:40:44,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1354353439, now seen corresponding path program 9 times [2021-08-27 17:40:44,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:44,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483745614] [2021-08-27 17:40:44,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:44,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:40:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:44,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:40:44,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483745614] [2021-08-27 17:40:44,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483745614] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:44,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182585408] [2021-08-27 17:40:44,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:40:44,264 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:40:44,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:40:44,266 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:40:44,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-27 17:40:44,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-08-27 17:40:44,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:40:44,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 17:40:44,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:40:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:40:45,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182585408] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:40:45,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:40:45,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-08-27 17:40:45,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405811894] [2021-08-27 17:40:45,059 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:40:45,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:45,060 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 10 times [2021-08-27 17:40:45,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:45,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122953178] [2021-08-27 17:40:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:45,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:45,064 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:45,067 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:45,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:40:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 17:40:45,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2021-08-27 17:40:45,273 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 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-08-27 17:40:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:40:45,335 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2021-08-27 17:40:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 17:40:45,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2021-08-27 17:40:45,336 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:45,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 46 transitions. [2021-08-27 17:40:45,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:40:45,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:40:45,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2021-08-27 17:40:45,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:40:45,337 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2021-08-27 17:40:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2021-08-27 17:40:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-08-27 17:40:45,338 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-08-27 17:40:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-08-27 17:40:45,338 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-08-27 17:40:45,338 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-08-27 17:40:45,338 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 17:40:45,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2021-08-27 17:40:45,339 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-08-27 17:40:45,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:40:45,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:40:45,339 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:40:45,340 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:40:45,340 INFO L791 eck$LassoCheckResult]: Stem: 1428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 1429#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1440#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1439#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1430#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1431#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1445#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1446#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1426#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1427#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1465#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1464#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1463#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1462#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1461#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1460#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1459#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1458#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1457#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1456#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1455#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1454#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1453#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1452#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1451#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1450#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1447#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1441#L764-3 [2021-08-27 17:40:45,340 INFO L793 eck$LassoCheckResult]: Loop: 1441#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1448#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1449#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1436#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1438#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1441#L764-3 [2021-08-27 17:40:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 10 times [2021-08-27 17:40:45,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:45,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961193430] [2021-08-27 17:40:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:45,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:45,352 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:45,374 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:45,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:45,375 INFO L82 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 11 times [2021-08-27 17:40:45,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:45,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038044794] [2021-08-27 17:40:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:45,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:45,382 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:45,392 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:40:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:40:45,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2021-08-27 17:40:45,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:40:45,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842524115] [2021-08-27 17:40:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:40:45,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:40:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:45,414 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:40:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:40:45,433 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:42:03,386 WARN L207 SmtUtils]: Spent 1.30 m on a formula simplification. DAG size of input: 368 DAG size of output: 302 [2021-08-27 17:42:08,312 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:42:08,312 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:42:08,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:42:08,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:42:08,312 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:42:08,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:08,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:42:08,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:42:08,312 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration13_Lasso [2021-08-27 17:42:08,312 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:42:08,312 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:42:08,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:08,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:42:09,436 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:42:09,436 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:42:09,436 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,440 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 17:42:09,442 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-08-27 17:42:09,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,468 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,469 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 17:42:09,472 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-08-27 17:42:09,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,498 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,499 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 17:42:09,501 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-08-27 17:42:09,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:42:09,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:42:09,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,531 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,532 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-27 17:42:09,534 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-08-27 17:42:09,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:42:09,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:42:09,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,562 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,563 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 17:42:09,565 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-08-27 17:42:09,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-08-27 17:42:09,588 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,588 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 17:42:09,590 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-08-27 17:42:09,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,620 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,621 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-27 17:42:09,623 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-08-27 17:42:09,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,647 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,648 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 17:42:09,651 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-08-27 17:42:09,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,675 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,676 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-27 17:42:09,678 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-08-27 17:42:09,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:42:09,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:42:09,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,710 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,710 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-27 17:42:09,712 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-08-27 17:42:09,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,740 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,741 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-27 17:42:09,743 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-08-27 17:42:09,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,767 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,768 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 17:42:09,770 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-08-27 17:42:09,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,798 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,799 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 17:42:09,801 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-08-27 17:42:09,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:42:09,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:42:09,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,829 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,829 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:42:09,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-27 17:42:09,831 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-08-27 17:42:09,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:42:09,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:42:09,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,856 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,857 INFO L229 MonitoredProcess]: Starting monitored process 36 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-08-27 17:42:09,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-27 17:42:09,859 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-08-27 17:42:09,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,884 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,885 INFO L229 MonitoredProcess]: Starting monitored process 37 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-08-27 17:42:09,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-27 17:42:09,888 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-08-27 17:42:09,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:42:09,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:42:09,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:42:09,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:42:09,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:09,912 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,913 INFO L229 MonitoredProcess]: Starting monitored process 38 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-08-27 17:42:09,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 17:42:09,915 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-08-27 17:42:09,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:42:09,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:42:09,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:42:09,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:42:09,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:42:09,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:42:09,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:42:09,980 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-08-27 17:42:09,980 INFO L444 ModelExtractionUtils]: 41 out of 52 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-08-27 17:42:09,980 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:42:09,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:42:09,985 INFO L229 MonitoredProcess]: Starting monitored process 39 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-08-27 17:42:09,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-27 17:42:09,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:42:10,019 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:42:10,020 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:42:10,020 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2021-08-27 17:42:10,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:10,058 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-27 17:42:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:42:10,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:42:10,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:42:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:42:10,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:42:10,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:42:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:42:10,198 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:42:10,198 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-08-27 17:42:10,214 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 59 states and 71 transitions. Complement of second has 6 states. [2021-08-27 17:42:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 17:42:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-08-27 17:42:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2021-08-27 17:42:10,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 5 letters. [2021-08-27 17:42:10,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:42:10,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 5 letters. [2021-08-27 17:42:10,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:42:10,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 10 letters. [2021-08-27 17:42:10,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:42:10,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2021-08-27 17:42:10,217 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:42:10,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 47 states and 55 transitions. [2021-08-27 17:42:10,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:42:10,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-08-27 17:42:10,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2021-08-27 17:42:10,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:42:10,218 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2021-08-27 17:42:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2021-08-27 17:42:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2021-08-27 17:42:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 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-08-27 17:42:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-08-27 17:42:10,219 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-08-27 17:42:10,219 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-08-27 17:42:10,219 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 17:42:10,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2021-08-27 17:42:10,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-27 17:42:10,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:42:10,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:42:10,221 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:42:10,221 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:42:10,221 INFO L791 eck$LassoCheckResult]: Stem: 1674#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 1675#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1687#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1682#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1676#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1677#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1672#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1673#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1692#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1715#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1714#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1713#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1712#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1711#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1710#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1709#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1708#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1707#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1706#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1705#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1704#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1703#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1702#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1701#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1700#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1699#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1693#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1694#L764-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1681#L764-4 alloc_17_#res := 0; 1678#L775 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1679#L779-3 [2021-08-27 17:42:10,221 INFO L793 eck$LassoCheckResult]: Loop: 1679#L779-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1680#L779-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1679#L779-3 [2021-08-27 17:42:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash 999709617, now seen corresponding path program 1 times [2021-08-27 17:42:10,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852662272] [2021-08-27 17:42:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:42:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:42:10,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:42:10,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852662272] [2021-08-27 17:42:10,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852662272] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:42:10,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:42:10,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:42:10,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118751897] [2021-08-27 17:42:10,256 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:42:10,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,256 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2021-08-27 17:42:10,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676912074] [2021-08-27 17:42:10,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,259 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:42:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,261 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:42:10,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-08-27 17:42:10,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:42:10,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:42:10,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:42:10,326 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:42:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:42:10,349 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2021-08-27 17:42:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:42:10,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2021-08-27 17:42:10,350 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:42:10,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2021-08-27 17:42:10,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-08-27 17:42:10,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-27 17:42:10,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2021-08-27 17:42:10,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:42:10,351 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2021-08-27 17:42:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2021-08-27 17:42:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2021-08-27 17:42:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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-08-27 17:42:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2021-08-27 17:42:10,357 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2021-08-27 17:42:10,357 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2021-08-27 17:42:10,357 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 17:42:10,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2021-08-27 17:42:10,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-27 17:42:10,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:42:10,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:42:10,359 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:42:10,359 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:42:10,360 INFO L791 eck$LassoCheckResult]: Stem: 1783#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 1784#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1796#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1791#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1785#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1786#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1801#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1802#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1781#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1782#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1824#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1823#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1822#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1821#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1820#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1819#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1818#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1817#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1816#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1815#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1814#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1813#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1812#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1811#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1810#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1809#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1803#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1804#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1805#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1806#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1792#L766 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1793#L766-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1800#L771-3 [2021-08-27 17:42:10,360 INFO L793 eck$LassoCheckResult]: Loop: 1800#L771-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1799#L771-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1800#L771-3 [2021-08-27 17:42:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1350299059, now seen corresponding path program 1 times [2021-08-27 17:42:10,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929381941] [2021-08-27 17:42:10,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,370 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:42:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,381 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:42:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2021-08-27 17:42:10,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014159039] [2021-08-27 17:42:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,385 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:42:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,386 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:42:10,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash -557270321, now seen corresponding path program 1 times [2021-08-27 17:42:10,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117813737] [2021-08-27 17:42:10,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:42:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:42:10,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:42:10,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117813737] [2021-08-27 17:42:10,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117813737] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:42:10,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:42:10,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:42:10,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521775895] [2021-08-27 17:42:10,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:42:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:42:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:42:10,492 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:42:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:42:10,512 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-08-27 17:42:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:42:10,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 69 transitions. [2021-08-27 17:42:10,513 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:42:10,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 69 transitions. [2021-08-27 17:42:10,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-08-27 17:42:10,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-08-27 17:42:10,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 69 transitions. [2021-08-27 17:42:10,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:42:10,514 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2021-08-27 17:42:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 69 transitions. [2021-08-27 17:42:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2021-08-27 17:42:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 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-08-27 17:42:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2021-08-27 17:42:10,515 INFO L704 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2021-08-27 17:42:10,515 INFO L587 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2021-08-27 17:42:10,515 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 17:42:10,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2021-08-27 17:42:10,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-27 17:42:10,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:42:10,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:42:10,516 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:42:10,516 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:42:10,517 INFO L791 eck$LassoCheckResult]: Stem: 1898#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 1899#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1911#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1906#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 1900#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1901#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1896#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1897#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1916#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1944#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1943#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1942#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1941#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1940#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1939#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1938#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1936#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1935#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1933#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1932#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1931#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1930#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1929#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1928#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1927#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 1926#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1917#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1918#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1921#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1922#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1909#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1910#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1912#L764-3 assume !(alloc_17_~i~0 < alloc_17_~len); 1905#L764-4 alloc_17_#res := 0; 1902#L775 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 1903#L779-3 [2021-08-27 17:42:10,517 INFO L793 eck$LassoCheckResult]: Loop: 1903#L779-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 1904#L779-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 1903#L779-3 [2021-08-27 17:42:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash -93871603, now seen corresponding path program 1 times [2021-08-27 17:42:10,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861316425] [2021-08-27 17:42:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:42:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:42:10,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:42:10,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861316425] [2021-08-27 17:42:10,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861316425] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:42:10,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:42:10,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:42:10,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310475432] [2021-08-27 17:42:10,550 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:42:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2021-08-27 17:42:10,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163266044] [2021-08-27 17:42:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,553 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:42:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,555 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:42:10,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:42:10,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:42:10,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:42:10,586 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-08-27 17:42:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:42:10,603 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-08-27 17:42:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:42:10,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 75 transitions. [2021-08-27 17:42:10,604 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2021-08-27 17:42:10,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 73 transitions. [2021-08-27 17:42:10,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-08-27 17:42:10,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-08-27 17:42:10,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 73 transitions. [2021-08-27 17:42:10,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:42:10,608 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 73 transitions. [2021-08-27 17:42:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 73 transitions. [2021-08-27 17:42:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2021-08-27 17:42:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 48 states have internal predecessors, (56), 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-08-27 17:42:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2021-08-27 17:42:10,609 INFO L704 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2021-08-27 17:42:10,609 INFO L587 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2021-08-27 17:42:10,609 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 17:42:10,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2021-08-27 17:42:10,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-27 17:42:10,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:42:10,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:42:10,610 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:42:10,610 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:42:10,610 INFO L791 eck$LassoCheckResult]: Stem: 2023#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 2024#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 2036#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 2031#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2025#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2026#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2021#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2022#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2041#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2066#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2065#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2064#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2063#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2062#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2061#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2060#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2059#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2058#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2057#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2056#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2055#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2054#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2053#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2052#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2051#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2050#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2043#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 2044#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 2045#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2046#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2032#L766 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2033#L766-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2042#L771-3 assume !(alloc_17_~j~0 >= 0); 2038#L771-4 alloc_17_#res := 3; 2027#L775 entry_point_#t~ret46 := alloc_17_#res;havoc entry_point_#t~ret46;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 2028#L779-3 [2021-08-27 17:42:10,610 INFO L793 eck$LassoCheckResult]: Loop: 2028#L779-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 2029#L779-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 2028#L779-3 [2021-08-27 17:42:10,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash -95512495, now seen corresponding path program 1 times [2021-08-27 17:42:10,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307975117] [2021-08-27 17:42:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,619 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:42:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:42:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 3 times [2021-08-27 17:42:10,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734384759] [2021-08-27 17:42:10,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,634 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:42:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,635 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:42:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:42:10,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1593191981, now seen corresponding path program 1 times [2021-08-27 17:42:10,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:42:10,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497809865] [2021-08-27 17:42:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:42:10,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:42:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,646 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:42:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:42:10,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:43:36,188 WARN L207 SmtUtils]: Spent 1.42 m on a formula simplification. DAG size of input: 408 DAG size of output: 337 [2021-08-27 17:43:39,351 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:43:39,351 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:43:39,351 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:43:39,351 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:43:39,351 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:43:39,351 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:39,351 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:43:39,351 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:43:39,351 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration17_Lasso [2021-08-27 17:43:39,351 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:43:39,351 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:43:39,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:39,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:43:40,332 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:43:40,332 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:43:40,332 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,333 INFO L229 MonitoredProcess]: Starting monitored process 40 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-08-27 17:43:40,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-27 17:43:40,335 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-08-27 17:43:40,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:43:40,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:43:40,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,361 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,361 INFO L229 MonitoredProcess]: Starting monitored process 41 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-08-27 17:43:40,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 17:43:40,363 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-08-27 17:43:40,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:43:40,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:43:40,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,395 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,396 INFO L229 MonitoredProcess]: Starting monitored process 42 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-08-27 17:43:40,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-27 17:43:40,398 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-08-27 17:43:40,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:43:40,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:43:40,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,427 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,428 INFO L229 MonitoredProcess]: Starting monitored process 43 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-08-27 17:43:40,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-27 17:43:40,430 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-08-27 17:43:40,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:43:40,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:43:40,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-08-27 17:43:40,455 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,456 INFO L229 MonitoredProcess]: Starting monitored process 44 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-08-27 17:43:40,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-27 17:43:40,458 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-08-27 17:43:40,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:43:40,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:43:40,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:43:40,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,481 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,482 INFO L229 MonitoredProcess]: Starting monitored process 45 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-08-27 17:43:40,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-27 17:43:40,484 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-08-27 17:43:40,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:43:40,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:43:40,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,513 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,513 INFO L229 MonitoredProcess]: Starting monitored process 46 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-08-27 17:43:40,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-27 17:43:40,516 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-08-27 17:43:40,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:43:40,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:43:40,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:43:40,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-08-27 17:43:40,539 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,540 INFO L229 MonitoredProcess]: Starting monitored process 47 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-08-27 17:43:40,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-27 17:43:40,542 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-08-27 17:43:40,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:43:40,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:43:40,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:43:40,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,564 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,565 INFO L229 MonitoredProcess]: Starting monitored process 48 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-08-27 17:43:40,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-08-27 17:43:40,567 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-08-27 17:43:40,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:43:40,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:43:40,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:43:40,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,590 INFO L229 MonitoredProcess]: Starting monitored process 49 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-08-27 17:43:40,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-27 17:43:40,593 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-08-27 17:43:40,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:43:40,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:43:40,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:43:40,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,619 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,620 INFO L229 MonitoredProcess]: Starting monitored process 50 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-08-27 17:43:40,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-27 17:43:40,622 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-08-27 17:43:40,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:43:40,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:43:40,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:43:40,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:43:40,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:43:40,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:43:40,660 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:43:40,679 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-27 17:43:40,680 INFO L444 ModelExtractionUtils]: 10 out of 49 variables were initially zero. Simplification set additionally 36 variables to zero. [2021-08-27 17:43:40,680 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:43:40,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:43:40,685 INFO L229 MonitoredProcess]: Starting monitored process 51 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-08-27 17:43:40,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-27 17:43:40,687 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:43:40,696 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:43:40,696 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:43:40,696 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~len) = -1*ULTIMATE.start_free_17_~i~1 + 1*ULTIMATE.start_free_17_~len Supporting invariants [] [2021-08-27 17:43:40,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,724 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-27 17:43:40,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:43:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:43:40,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:43:40,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:43:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:43:40,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:43:40,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:43:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:43:40,866 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:43:40,866 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08-27 17:43:40,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 51 states and 59 transitions. Complement of second has 4 states. [2021-08-27 17:43:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:43:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08-27 17:43:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2021-08-27 17:43:40,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 2 letters. [2021-08-27 17:43:40,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:43:40,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 37 letters. Loop has 2 letters. [2021-08-27 17:43:40,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:43:40,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 35 letters. Loop has 4 letters. [2021-08-27 17:43:40,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:43:40,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2021-08-27 17:43:40,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:43:40,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 42 transitions. [2021-08-27 17:43:40,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-08-27 17:43:40,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-08-27 17:43:40,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2021-08-27 17:43:40,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:43:40,881 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-08-27 17:43:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2021-08-27 17:43:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-08-27 17:43:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-08-27 17:43:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-08-27 17:43:40,886 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-08-27 17:43:40,886 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-08-27 17:43:40,886 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-27 17:43:40,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2021-08-27 17:43:40,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:43:40,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:43:40,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:43:40,887 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:43:40,887 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:43:40,888 INFO L791 eck$LassoCheckResult]: Stem: 2282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);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); 2283#L-1 havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset, entry_point_#t~post45, entry_point_#t~ret46, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 2291#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 2290#L529 entry_point_#t~ret44.base, entry_point_#t~ret44.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret44.base, entry_point_#t~ret44.offset;havoc entry_point_#t~ret44.base, entry_point_#t~ret44.offset; 2284#L787 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 2285#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2295#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2296#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2280#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2281#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2318#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2317#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2316#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2315#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2314#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2313#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2312#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2311#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2310#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2309#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2308#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2307#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2306#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2305#L788-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 2304#L788-2 entry_point_#t~post45 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post45;havoc entry_point_#t~post45; 2303#L788-3 assume !(entry_point_~i~2 < entry_point_~len~0); 2297#L788-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 2298#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 2301#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 2302#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2288#L766 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 2289#L764-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 2292#L764-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 2299#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 2300#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 2286#L766 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 2287#L766-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 2294#L771-3 [2021-08-27 17:43:40,888 INFO L793 eck$LassoCheckResult]: Loop: 2294#L771-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 2293#L771-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 2294#L771-3 [2021-08-27 17:43:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:43:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash -694922329, now seen corresponding path program 1 times [2021-08-27 17:43:40,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:43:40,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384808741] [2021-08-27 17:43:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:43:40,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:43:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:43:40,913 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:43:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:43:40,929 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:43:40,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:43:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 2 times [2021-08-27 17:43:40,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:43:40,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657200338] [2021-08-27 17:43:40,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:43:40,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:43:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:43:40,933 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:43:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:43:40,936 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:43:40,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:43:40,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2100425303, now seen corresponding path program 1 times [2021-08-27 17:43:40,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:43:40,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66311463] [2021-08-27 17:43:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:43:40,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:43:40,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-08-27 17:43:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:43:40,971 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:43:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:43:40,985 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:45:51,761 WARN L207 SmtUtils]: Spent 2.18 m on a formula simplification. DAG size of input: 450 DAG size of output: 362 [2021-08-27 17:45:53,499 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:45:53,499 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:45:53,499 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:45:53,499 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:45:53,499 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:45:53,499 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:53,500 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:45:53,500 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:45:53,500 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration18_Lasso [2021-08-27 17:45:53,500 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:45:53,500 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:45:53,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:53,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:45:54,749 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:45:54,750 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:45:54,750 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:54,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:54,755 INFO L229 MonitoredProcess]: Starting monitored process 52 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-08-27 17:45:54,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-27 17:45:54,756 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-08-27 17:45:54,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:54,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:45:54,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:54,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:54,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:54,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:45:54,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:45:54,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:54,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:54,782 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:54,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:54,782 INFO L229 MonitoredProcess]: Starting monitored process 53 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-08-27 17:45:54,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-27 17:45:54,784 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-08-27 17:45:54,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:54,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:54,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:54,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:54,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:45:54,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:45:54,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:54,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:54,812 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:54,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:54,813 INFO L229 MonitoredProcess]: Starting monitored process 54 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-08-27 17:45:54,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-08-27 17:45:54,815 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-08-27 17:45:54,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:54,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:45:54,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:54,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:54,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:54,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:45:54,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:45:54,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:54,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:54,840 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:54,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:54,841 INFO L229 MonitoredProcess]: Starting monitored process 55 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-08-27 17:45:54,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-08-27 17:45:54,843 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-08-27 17:45:54,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:54,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:45:54,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:54,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:54,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:54,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:45:54,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:45:54,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:54,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:54,867 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:54,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:54,867 INFO L229 MonitoredProcess]: Starting monitored process 56 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-08-27 17:45:54,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-08-27 17:45:54,870 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-08-27 17:45:54,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:54,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:54,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:54,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:54,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:45:54,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:45:54,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:54,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:54,898 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:54,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:54,899 INFO L229 MonitoredProcess]: Starting monitored process 57 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-08-27 17:45:54,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-08-27 17:45:54,901 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-08-27 17:45:54,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:54,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:45:54,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:54,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:54,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:54,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:45:54,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:45:54,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:54,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:54,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:54,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:54,926 INFO L229 MonitoredProcess]: Starting monitored process 58 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-08-27 17:45:54,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-08-27 17:45:54,928 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-08-27 17:45:54,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:54,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:54,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:54,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:54,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:45:54,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:45:54,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:54,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:54,962 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:54,963 INFO L229 MonitoredProcess]: Starting monitored process 59 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-08-27 17:45:54,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-08-27 17:45:54,965 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-08-27 17:45:54,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:54,971 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2021-08-27 17:45:54,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:54,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:54,978 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2021-08-27 17:45:54,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:45:54,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:55,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:55,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:55,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:55,006 INFO L229 MonitoredProcess]: Starting monitored process 60 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-08-27 17:45:55,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-08-27 17:45:55,008 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-08-27 17:45:55,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:55,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:45:55,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:55,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:55,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:55,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:45:55,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:45:55,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:55,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:55,033 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:55,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:55,034 INFO L229 MonitoredProcess]: Starting monitored process 61 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-08-27 17:45:55,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-08-27 17:45:55,036 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-08-27 17:45:55,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:55,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:55,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:55,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:55,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:45:55,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:45:55,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:45:55,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:55,065 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:55,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:55,066 INFO L229 MonitoredProcess]: Starting monitored process 62 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-08-27 17:45:55,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-08-27 17:45:55,068 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-08-27 17:45:55,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:45:55,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:45:55,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:45:55,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:45:55,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:45:55,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:45:55,093 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:45:55,115 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-08-27 17:45:55,115 INFO L444 ModelExtractionUtils]: 22 out of 40 variables were initially zero. Simplification set additionally 15 variables to zero. [2021-08-27 17:45:55,115 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:45:55,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:45:55,116 INFO L229 MonitoredProcess]: Starting monitored process 63 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-08-27 17:45:55,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-08-27 17:45:55,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:45:55,129 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:45:55,129 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:45:55,130 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2021-08-27 17:45:55,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:55,164 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2021-08-27 17:45:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:45:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:45:55,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:45:55,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:45:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:45:55,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:45:55,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:45:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:45:55,329 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:45:55,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08-27 17:45:55,337 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 41 states and 45 transitions. Complement of second has 4 states. [2021-08-27 17:45:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:45:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08-27 17:45:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2021-08-27 17:45:55,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 37 letters. Loop has 2 letters. [2021-08-27 17:45:55,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:45:55,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 39 letters. Loop has 2 letters. [2021-08-27 17:45:55,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:45:55,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 37 letters. Loop has 4 letters. [2021-08-27 17:45:55,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:45:55,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2021-08-27 17:45:55,339 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:45:55,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2021-08-27 17:45:55,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:45:55,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:45:55,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:45:55,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:45:55,339 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:45:55,339 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:45:55,339 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:45:55,339 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-27 17:45:55,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 17:45:55,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:45:55,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 17:45:55,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:45:55 BoogieIcfgContainer [2021-08-27 17:45:55,344 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:45:55,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:45:55,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:45:55,344 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:45:55,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:40:37" (3/4) ... [2021-08-27 17:45:55,346 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 17:45:55,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:45:55,347 INFO L168 Benchmark]: Toolchain (without parser) took 319033.08 ms. Allocated memory was 58.7 MB in the beginning and 220.2 MB in the end (delta: 161.5 MB). Free memory was 36.8 MB in the beginning and 54.6 MB in the end (delta: -17.8 MB). Peak memory consumption was 143.3 MB. Max. memory is 16.1 GB. [2021-08-27 17:45:55,347 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 58.7 MB. Free memory was 41.8 MB in the beginning and 41.8 MB in the end (delta: 42.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:45:55,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.26 ms. Allocated memory is still 58.7 MB. Free memory was 36.6 MB in the beginning and 30.5 MB in the end (delta: 6.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:45:55,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.46 ms. Allocated memory is still 58.7 MB. Free memory was 30.5 MB in the beginning and 28.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:45:55,347 INFO L168 Benchmark]: Boogie Preprocessor took 32.35 ms. Allocated memory is still 58.7 MB. Free memory was 28.3 MB in the beginning and 26.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:45:55,348 INFO L168 Benchmark]: RCFGBuilder took 391.97 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 26.8 MB in the beginning and 52.5 MB in the end (delta: -25.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:45:55,348 INFO L168 Benchmark]: BuchiAutomizer took 318096.85 ms. Allocated memory was 71.3 MB in the beginning and 220.2 MB in the end (delta: 148.9 MB). Free memory was 52.5 MB in the beginning and 54.6 MB in the end (delta: -2.1 MB). Peak memory consumption was 146.0 MB. Max. memory is 16.1 GB. [2021-08-27 17:45:55,348 INFO L168 Benchmark]: Witness Printer took 2.26 ms. Allocated memory is still 220.2 MB. Free memory is still 54.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:45:55,349 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 58.7 MB. Free memory was 41.8 MB in the beginning and 41.8 MB in the end (delta: 42.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 454.26 ms. Allocated memory is still 58.7 MB. Free memory was 36.6 MB in the beginning and 30.5 MB in the end (delta: 6.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.46 ms. Allocated memory is still 58.7 MB. Free memory was 30.5 MB in the beginning and 28.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.35 ms. Allocated memory is still 58.7 MB. Free memory was 28.3 MB in the beginning and 26.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 391.97 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 26.8 MB in the beginning and 52.5 MB in the end (delta: -25.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 318096.85 ms. Allocated memory was 71.3 MB in the beginning and 220.2 MB in the end (delta: 148.9 MB). Free memory was 52.5 MB in the beginning and 54.6 MB in the end (delta: -2.1 MB). Peak memory consumption was 146.0 MB. Max. memory is 16.1 GB. * Witness Printer took 2.26 ms. Allocated memory is still 220.2 MB. Free memory is still 54.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (14 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 318.0s and 19 iterations. TraceHistogramMax:10. Analysis of lassos took 316.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 5. Automata minimization 43.7ms AutomataMinimizationTime, 17 MinimizatonAttempts, 66 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 15. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 422 SDtfs, 506 SDslu, 804 SDs, 0 SdLazy, 432 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 325.1ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU13 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital450 mio100 ax108 hnf100 lsp88 ukn40 mio100 lsp56 div100 bol100 ite100 ukn100 eq186 hnf89 smp97 dnf108 smp97 tf100 neg98 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 8 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 17:45:55,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:55,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-08-27 17:45:55,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:55,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:56,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:56,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:56,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:56,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-08-27 17:45:56,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-08-27 17:45:57,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-27 17:45:57,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...