./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.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-regression/ex3_forlist.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 78f95c70d702e3726c098ef8eec3c10bcd690c4e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 15:15:32,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 15:15:32,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 15:15:32,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 15:15:32,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 15:15:32,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 15:15:32,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 15:15:32,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 15:15:32,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 15:15:32,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 15:15:32,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 15:15:32,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 15:15:32,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 15:15:32,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 15:15:32,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 15:15:32,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 15:15:32,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 15:15:32,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 15:15:32,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 15:15:32,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 15:15:32,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 15:15:32,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 15:15:32,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 15:15:32,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 15:15:32,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 15:15:32,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 15:15:32,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 15:15:32,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 15:15:32,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 15:15:32,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 15:15:32,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 15:15:32,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 15:15:32,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 15:15:32,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 15:15:32,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 15:15:32,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 15:15:32,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 15:15:32,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 15:15:32,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 15:15:32,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 15:15:32,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 15:15:32,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 15:15:32,616 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 15:15:32,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 15:15:32,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 15:15:32,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 15:15:32,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 15:15:32,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 15:15:32,619 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 15:15:32,619 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 15:15:32,619 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 15:15:32,619 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 15:15:32,620 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 15:15:32,620 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 15:15:32,620 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 15:15:32,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 15:15:32,620 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 15:15:32,620 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 15:15:32,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 15:15:32,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 15:15:32,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 15:15:32,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 15:15:32,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 15:15:32,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 15:15:32,623 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 15:15:32,623 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 -> 78f95c70d702e3726c098ef8eec3c10bcd690c4e [2021-08-27 15:15:32,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 15:15:32,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 15:15:32,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 15:15:32,902 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 15:15:32,902 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 15:15:32,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-08-27 15:15:32,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c76ae69/90ec1316e8cb4b3ea2347502fdbba6ae/FLAG6a21a6f1d [2021-08-27 15:15:33,304 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 15:15:33,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-08-27 15:15:33,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c76ae69/90ec1316e8cb4b3ea2347502fdbba6ae/FLAG6a21a6f1d [2021-08-27 15:15:33,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c76ae69/90ec1316e8cb4b3ea2347502fdbba6ae [2021-08-27 15:15:33,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 15:15:33,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 15:15:33,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 15:15:33,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 15:15:33,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 15:15:33,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aefd8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33, skipping insertion in model container [2021-08-27 15:15:33,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 15:15:33,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 15:15:33,417 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-08-27 15:15:33,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:15:33,447 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 15:15:33,456 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-08-27 15:15:33,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 15:15:33,477 INFO L208 MainTranslator]: Completed translation [2021-08-27 15:15:33,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33 WrapperNode [2021-08-27 15:15:33,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 15:15:33,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 15:15:33,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 15:15:33,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 15:15:33,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 15:15:33,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 15:15:33,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 15:15:33,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 15:15:33,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 15:15:33,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 15:15:33,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 15:15:33,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 15:15:33,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (1/1) ... [2021-08-27 15:15:33,544 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:33,558 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 15:15:33,561 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 15:15:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 15:15:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 15:15:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 15:15:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 15:15:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 15:15:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 15:15:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 15:15:33,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 15:15:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 15:15:33,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 15:15:33,868 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-08-27 15:15:33,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:15:33 BoogieIcfgContainer [2021-08-27 15:15:33,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 15:15:33,869 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 15:15:33,869 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 15:15:33,871 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 15:15:33,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:15:33,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 03:15:33" (1/3) ... [2021-08-27 15:15:33,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745d8e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:15:33, skipping insertion in model container [2021-08-27 15:15:33,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:15:33,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:15:33" (2/3) ... [2021-08-27 15:15:33,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745d8e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 03:15:33, skipping insertion in model container [2021-08-27 15:15:33,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 15:15:33,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:15:33" (3/3) ... [2021-08-27 15:15:33,874 INFO L389 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2021-08-27 15:15:33,918 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 15:15:33,919 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 15:15:33,919 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 15:15:33,919 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 15:15:33,919 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 15:15:33,919 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 15:15:33,919 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 15:15:33,919 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 15:15:33,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 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 15:15:33,939 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2021-08-27 15:15:33,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:15:33,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:15:33,942 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:15:33,942 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:15:33,942 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 15:15:33,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 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 15:15:33,944 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2021-08-27 15:15:33,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:15:33,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:15:33,945 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 15:15:33,945 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 15:15:33,949 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 7#L-1true havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 34#L19-3true [2021-08-27 15:15:33,949 INFO L793 eck$LassoCheckResult]: Loop: 34#L19-3true assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 3#L19-2true init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 34#L19-3true [2021-08-27 15:15:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:33,953 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 15:15:33,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:33,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682390154] [2021-08-27 15:15:33,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:33,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:34,023 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:34,061 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:34,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:34,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 15:15:34,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:34,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885696269] [2021-08-27 15:15:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:34,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:34,087 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:34,095 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 15:15:34,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:34,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241905085] [2021-08-27 15:15:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:34,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:34,116 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:34,137 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:34,879 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:15:34,880 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:15:34,880 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:15:34,880 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:15:34,880 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:15:34,880 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:34,880 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:15:34,880 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:15:34,880 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2021-08-27 15:15:34,880 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:15:34,880 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:15:34,892 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 15:15:34,898 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 15:15:34,902 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 15:15:34,903 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 15:15:34,905 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 15:15:34,908 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 15:15:34,909 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 15:15:34,911 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 15:15:34,913 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 15:15:34,915 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 15:15:34,917 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 15:15:34,919 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 15:15:34,920 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 15:15:34,923 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 15:15:34,925 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 15:15:35,308 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 15:15:35,612 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:15:35,614 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:15:35,615 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:35,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:35,620 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 15:15:35,627 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 15:15:35,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:15:35,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:35,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:35,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:35,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:35,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:35,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:35,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:35,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:35,672 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 15:15:35,673 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:35,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:35,674 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 15:15:35,674 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 15:15:35,676 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 15:15:35,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:35,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:35,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:35,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:35,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:35,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:35,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:35,715 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 15:15:35,716 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:35,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:35,716 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 15:15:35,717 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 15:15:35,719 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 15:15:35,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:35,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:35,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:35,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:35,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:35,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:35,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:35,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:35,753 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 15:15:35,753 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:35,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:35,754 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 15:15:35,755 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 15:15:35,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 15:15:35,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:35,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:35,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:35,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:35,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:35,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:35,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:35,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:35,795 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 15:15:35,796 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:35,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:35,797 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 15:15:35,797 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 15:15:35,798 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 15:15:35,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:35,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:35,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:35,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:35,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:35,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:35,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:35,848 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 15:15:35,848 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:35,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:35,856 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 15:15:35,857 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 15:15:35,858 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 15:15:35,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:35,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:35,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:35,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:35,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:35,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:35,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:35,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:35,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-08-27 15:15:35,882 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:35,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:35,883 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 15:15:35,886 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 15:15:35,886 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 15:15:35,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:35,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:35,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:35,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:35,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:35,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:35,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:35,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:35,931 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 15:15:35,931 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:35,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:35,932 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 15:15:35,932 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 15:15:35,934 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 15:15:35,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:35,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:35,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:35,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:35,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:35,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:35,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:35,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:35,966 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 15:15:35,967 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:35,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:35,967 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 15:15:35,968 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 15:15:35,969 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 15:15:35,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:35,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:35,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:35,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:35,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:35,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:35,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,004 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 15:15:36,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,006 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 15:15:36,006 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 15:15:36,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 15:15:36,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,033 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 15:15:36,034 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,035 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 15:15:36,035 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 15:15:36,039 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 15:15:36,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:36,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:36,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:36,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,070 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 15:15:36,070 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,071 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:15:36,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 15:15:36,073 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 15:15:36,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:36,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:36,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:36,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 15:15:36,098 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,099 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:15:36,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 15:15:36,135 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 15:15:36,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 15:15:36,172 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,172 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:15:36,192 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 15:15:36,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:36,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:36,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:36,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 15:15:36,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 15:15:36,224 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,225 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:15:36,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 15:15:36,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 15:15:36,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 15:15:36,254 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,254 INFO L229 MonitoredProcess]: Starting monitored process 17 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 15:15:36,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 15:15:36,257 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 15:15:36,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 15:15:36,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,307 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:15:36,319 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 15:15:36,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 15:15:36,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 15:15:36,356 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,356 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:15:36,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 15:15:36,358 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 15:15:36,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 15:15:36,384 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,384 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:15:36,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 15:15:36,388 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 15:15:36,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 15:15:36,416 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,417 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 15:15:36,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 15:15:36,420 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 15:15:36,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 15:15:36,450 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,452 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 15:15:36,453 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 15:15:36,454 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 15:15:36,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,495 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 15:15:36,496 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,496 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 15:15:36,497 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 15:15:36,500 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 15:15:36,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,543 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 15:15:36,543 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,544 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 15:15:36,544 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 15:15:36,546 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 15:15:36,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:36,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:36,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:36,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-08-27 15:15:36,588 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,588 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 15:15:36,589 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 15:15:36,621 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 15:15:36,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-08-27 15:15:36,651 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,652 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 15:15:36,653 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 15:15:36,654 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 15:15:36,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:36,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:36,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:36,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,689 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 15:15:36,689 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,690 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 15:15:36,690 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 15:15:36,691 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 15:15:36,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,727 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 15:15:36,728 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,728 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 15:15:36,730 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 15:15:36,730 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 15:15:36,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,761 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 15:15:36,761 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,762 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 15:15:36,763 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 15:15:36,764 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 15:15:36,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:15:36,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:15:36,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:15:36,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,785 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 15:15:36,786 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,786 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 15:15:36,787 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 15:15:36,788 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 15:15:36,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-08-27 15:15:36,813 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,813 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 15:15:36,814 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 15:15:36,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 15:15:36,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-08-27 15:15:36,852 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,852 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 15:15:36,853 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 15:15:36,854 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 15:15:36,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:15:36,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-08-27 15:15:36,906 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,906 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 15:15:36,907 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 15:15:36,908 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 15:15:36,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:15:36,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:15:36,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:15:36,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:15:36,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:15:36,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:15:36,927 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:15:36,948 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-08-27 15:15:36,948 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-08-27 15:15:36,949 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:15:36,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:36,973 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 15:15:37,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:15:37,017 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 15:15:37,049 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 15:15:37,049 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:15:37,049 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0) = 3*v_rep(select #length ~#pp~0.base)_1 - 8*ULTIMATE.start_init_~i~0 Supporting invariants [] [2021-08-27 15:15:37,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-08-27 15:15:37,124 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2021-08-27 15:15:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:15:37,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:15:37,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:15:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:15:37,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 15:15:37,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:15:37,218 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 15:15:37,227 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 15:15:37,229 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 15:15:37,305 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 93 states and 136 transitions. Complement of second has 7 states. [2021-08-27 15:15:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 15:15:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 15:15:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2021-08-27 15:15:37,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 15:15:37,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:15:37,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 15:15:37,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:15:37,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 15:15:37,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:15:37,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 136 transitions. [2021-08-27 15:15:37,321 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-27 15:15:37,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 28 states and 37 transitions. [2021-08-27 15:15:37,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-08-27 15:15:37,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-08-27 15:15:37,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-08-27 15:15:37,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:15:37,325 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-27 15:15:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-08-27 15:15:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-27 15:15:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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 15:15:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-08-27 15:15:37,341 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-27 15:15:37,341 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-27 15:15:37,341 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 15:15:37,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-08-27 15:15:37,343 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-27 15:15:37,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:15:37,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:15:37,343 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:15:37,343 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:15:37,344 INFO L791 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 264#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 265#L19-3 assume !(init_~i~0 < 2); 281#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 273#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 267#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 262#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 263#L27-3 [2021-08-27 15:15:37,344 INFO L793 eck$LassoCheckResult]: Loop: 263#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 284#L28 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 266#L27-2 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 263#L27-3 [2021-08-27 15:15:37,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:37,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2021-08-27 15:15:37,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:37,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057494775] [2021-08-27 15:15:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:37,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:15:37,406 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 15:15:37,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:15:37,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057494775] [2021-08-27 15:15:37,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057494775] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:15:37,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:15:37,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 15:15:37,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427369681] [2021-08-27 15:15:37,410 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:15:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2021-08-27 15:15:37,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:37,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884765390] [2021-08-27 15:15:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:37,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:37,420 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:37,429 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:37,469 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 15:15:37,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:15:37,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 15:15:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 15:15:37,498 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 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 15:15:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:15:37,509 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-08-27 15:15:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 15:15:37,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2021-08-27 15:15:37,511 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-27 15:15:37,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2021-08-27 15:15:37,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-08-27 15:15:37,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-08-27 15:15:37,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2021-08-27 15:15:37,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:15:37,513 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-08-27 15:15:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2021-08-27 15:15:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-08-27 15:15:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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 15:15:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-08-27 15:15:37,516 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-08-27 15:15:37,516 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-08-27 15:15:37,516 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 15:15:37,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2021-08-27 15:15:37,518 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-27 15:15:37,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:15:37,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:15:37,519 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:15:37,519 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:15:37,519 INFO L791 eck$LassoCheckResult]: Stem: 340#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 327#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 328#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 320#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 321#L19-3 assume !(init_~i~0 < 2); 344#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 333#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 330#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 322#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 323#L27-3 [2021-08-27 15:15:37,519 INFO L793 eck$LassoCheckResult]: Loop: 323#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 347#L28 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 329#L27-2 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 323#L27-3 [2021-08-27 15:15:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2021-08-27 15:15:37,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:37,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206838847] [2021-08-27 15:15:37,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:37,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:15:37,567 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 15:15:37,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:15:37,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206838847] [2021-08-27 15:15:37,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206838847] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:15:37,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711379374] [2021-08-27 15:15:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:37,568 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:15:37,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:37,573 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:15:37,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-08-27 15:15:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:15:37,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 15:15:37,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:15:37,666 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 15:15:37,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711379374] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:15:37,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:15:37,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 15:15:37,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674660918] [2021-08-27 15:15:37,667 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:15:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2021-08-27 15:15:37,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:37,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005765630] [2021-08-27 15:15:37,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:37,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:37,674 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:37,683 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:37,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:15:37,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 15:15:37,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 15:15:37,719 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 15:15:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:15:37,735 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-08-27 15:15:37,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 15:15:37,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2021-08-27 15:15:37,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-27 15:15:37,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2021-08-27 15:15:37,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-08-27 15:15:37,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-08-27 15:15:37,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2021-08-27 15:15:37,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:15:37,739 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-08-27 15:15:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2021-08-27 15:15:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-27 15:15:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:15:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-08-27 15:15:37,742 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-08-27 15:15:37,742 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-08-27 15:15:37,743 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 15:15:37,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2021-08-27 15:15:37,743 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-27 15:15:37,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:15:37,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:15:37,744 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:15:37,744 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:15:37,744 INFO L791 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 417#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 418#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 410#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 411#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 438#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 439#L19-3 assume !(init_~i~0 < 2); 434#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 423#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 420#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 412#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 413#L27-3 [2021-08-27 15:15:37,744 INFO L793 eck$LassoCheckResult]: Loop: 413#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 437#L28 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 419#L27-2 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 413#L27-3 [2021-08-27 15:15:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2021-08-27 15:15:37,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:37,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724736486] [2021-08-27 15:15:37,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:37,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:37,781 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:37,804 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:37,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:37,805 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2021-08-27 15:15:37,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:37,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717211551] [2021-08-27 15:15:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:37,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:37,808 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:37,810 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2021-08-27 15:15:37,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:37,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482743019] [2021-08-27 15:15:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:37,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:15:37,996 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 15:15:37,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:15:37,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482743019] [2021-08-27 15:15:37,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482743019] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:15:37,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704376899] [2021-08-27 15:15:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:37,997 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:15:37,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:15:38,008 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:15:38,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-27 15:15:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:15:38,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 15:15:38,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:15:38,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 309 [2021-08-27 15:15:38,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2021-08-27 15:15:38,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2021-08-27 15:15:38,238 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-08-27 15:15:38,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 83 [2021-08-27 15:15:38,266 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-08-27 15:15:38,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 47 [2021-08-27 15:15:38,511 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 15:15:38,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2021-08-27 15:15:38,515 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 15:15:38,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2021-08-27 15:15:38,530 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 15:15:38,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704376899] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:15:38,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:15:38,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-08-27 15:15:38,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259159221] [2021-08-27 15:15:38,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:15:38,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 15:15:38,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-27 15:15:38,566 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:15:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:15:38,977 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2021-08-27 15:15:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 15:15:38,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2021-08-27 15:15:38,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-08-27 15:15:38,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2021-08-27 15:15:38,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-08-27 15:15:38,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-08-27 15:15:38,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2021-08-27 15:15:38,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:15:38,978 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-08-27 15:15:38,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2021-08-27 15:15:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-08-27 15:15:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 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 15:15:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-08-27 15:15:38,979 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-08-27 15:15:38,979 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-08-27 15:15:38,979 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 15:15:38,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2021-08-27 15:15:38,980 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-08-27 15:15:38,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:15:38,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:15:38,980 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:15:38,980 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:15:38,980 INFO L791 eck$LassoCheckResult]: Stem: 555#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 543#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 544#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 536#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 537#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 563#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 564#L19-3 assume !(init_~i~0 < 2); 560#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 551#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 545#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 538#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 539#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 562#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 557#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 556#L27-7 [2021-08-27 15:15:38,980 INFO L793 eck$LassoCheckResult]: Loop: 556#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 548#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 550#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 556#L27-7 [2021-08-27 15:15:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2021-08-27 15:15:38,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:38,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791934129] [2021-08-27 15:15:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:38,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:38,996 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:39,013 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:39,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2021-08-27 15:15:39,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:39,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573740245] [2021-08-27 15:15:39,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:39,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:39,016 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:39,018 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:15:39,019 INFO L82 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2021-08-27 15:15:39,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:15:39,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801890840] [2021-08-27 15:15:39,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:15:39,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:15:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:39,035 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:15:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:15:39,054 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:15:55,611 WARN L207 SmtUtils]: Spent 16.52 s on a formula simplification. DAG size of input: 318 DAG size of output: 263 [2021-08-27 15:16:01,702 WARN L207 SmtUtils]: Spent 5.73 s on a formula simplification that was a NOOP. DAG size: 200 [2021-08-27 15:16:01,706 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 15:16:01,706 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 15:16:01,706 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 15:16:01,706 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 15:16:01,706 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 15:16:01,706 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:01,706 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 15:16:01,706 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 15:16:01,706 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2021-08-27 15:16:01,706 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 15:16:01,706 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 15:16:01,709 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 15:16:01,711 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 15:16:01,713 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 15:16:01,715 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 15:16:01,717 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 15:16:01,722 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 15:16:01,724 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 15:16:01,725 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 15:16:01,727 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 15:16:05,363 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 15:16:05,365 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 15:16:05,366 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 15:16:05,368 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 15:16:05,381 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 15:16:05,387 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 15:16:05,389 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 15:16:05,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 15:16:05,850 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 15:16:05,851 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 15:16:05,851 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:05,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:05,854 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 15:16:05,854 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 15:16:05,856 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 15:16:05,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:05,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:05,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:05,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:05,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:05,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:05,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:05,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:05,879 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 15:16:05,879 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:05,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:05,880 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 15:16:05,880 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 15:16:05,882 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 15:16:05,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:05,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:05,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:05,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:05,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:05,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:05,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:05,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-27 15:16:05,928 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:05,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:05,928 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 15:16:05,929 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 15:16:05,930 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 15:16:05,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:05,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:05,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:05,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:05,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:05,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:05,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:05,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:05,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-08-27 15:16:05,951 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:05,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:05,952 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 15:16:05,957 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 15:16:05,959 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 15:16:05,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:05,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:05,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:05,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:05,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:05,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:05,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:05,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-08-27 15:16:05,983 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:05,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:05,984 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 15:16:05,984 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 15:16:05,986 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 15:16:05,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:05,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:05,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:05,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:05,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:05,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:05,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,012 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 15:16:06,013 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,013 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 15:16:06,014 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 15:16:06,015 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 15:16:06,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:06,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:06,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:06,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,059 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 15:16:06,059 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,060 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 15:16:06,061 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 15:16:06,062 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 15:16:06,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:06,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:06,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:06,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:06,097 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,105 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 15:16:06,113 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 15:16:06,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:06,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,119 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 15:16:06,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:06,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:06,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,145 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 15:16:06,145 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,146 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 15:16:06,147 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 15:16:06,148 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 15:16:06,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-08-27 15:16:06,171 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,171 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 15:16:06,172 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 15:16:06,175 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 15:16:06,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,199 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 15:16:06,199 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,200 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 15:16:06,200 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 15:16:06,202 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 15:16:06,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-08-27 15:16:06,227 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,228 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 15:16:06,228 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 15:16:06,230 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 15:16:06,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,252 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 15:16:06,253 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,253 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 15:16:06,254 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 15:16:06,255 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 15:16:06,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,283 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 15:16:06,283 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,284 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 15:16:06,285 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 15:16:06,285 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 15:16:06,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 15:16:06,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 15:16:06,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 15:16:06,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,307 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 15:16:06,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,308 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 15:16:06,309 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 15:16:06,310 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 15:16:06,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,356 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 15:16:06,356 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,357 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 15:16:06,357 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 15:16:06,359 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 15:16:06,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-08-27 15:16:06,404 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,405 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 15:16:06,406 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 15:16:06,407 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 15:16:06,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-08-27 15:16:06,432 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,433 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 15:16:06,435 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 15:16:06,436 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 15:16:06,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,463 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 15:16:06,463 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,464 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 15:16:06,468 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 15:16:06,468 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 15:16:06,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-08-27 15:16:06,494 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,494 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 15:16:06,498 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 15:16:06,498 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 15:16:06,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 15:16:06,530 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 15:16:06,530 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,531 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 15:16:06,531 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 15:16:06,562 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 15:16:06,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 15:16:06,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 15:16:06,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 15:16:06,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 15:16:06,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 15:16:06,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 15:16:06,582 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 15:16:06,604 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-08-27 15:16:06,604 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-08-27 15:16:06,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 15:16:06,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:06,608 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 15:16:06,609 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 15:16:06,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 15:16:06,617 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 15:16:06,617 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 15:16:06,617 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1) = -2*ULTIMATE.start_f_~i~1 + 3 Supporting invariants [] [2021-08-27 15:16:06,632 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 15:16:06,795 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 15:16:06,811 INFO L297 tatePredicateManager]: 57 out of 57 supporting invariants were superfluous and have been removed [2021-08-27 15:16:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:06,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 15:16:06,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:06,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:16:06,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:06,926 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 15:16:06,927 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 15:16:06,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:06,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 88 transitions. Complement of second has 6 states. [2021-08-27 15:16:06,943 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 15:16:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-08-27 15:16:06,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2021-08-27 15:16:06,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:16:06,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2021-08-27 15:16:06,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:16:06,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2021-08-27 15:16:06,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 15:16:06,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2021-08-27 15:16:06,948 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-08-27 15:16:06,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2021-08-27 15:16:06,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-08-27 15:16:06,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-27 15:16:06,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2021-08-27 15:16:06,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:16:06,949 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2021-08-27 15:16:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2021-08-27 15:16:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2021-08-27 15:16:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 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 15:16:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-08-27 15:16:06,951 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-27 15:16:06,951 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-27 15:16:06,951 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 15:16:06,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2021-08-27 15:16:06,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-27 15:16:06,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:06,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:06,951 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:16:06,951 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:16:06,952 INFO L791 eck$LassoCheckResult]: Stem: 955#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 942#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 943#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 935#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 936#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 964#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 965#L19-3 assume !(init_~i~0 < 2); 961#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 947#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 946#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 940#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 941#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 963#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 957#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 958#L27-7 assume !(f_~i~1 < 2); 949#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 937#L38-3 [2021-08-27 15:16:06,952 INFO L793 eck$LassoCheckResult]: Loop: 937#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 939#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 953#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 937#L38-3 [2021-08-27 15:16:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2021-08-27 15:16:06,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:06,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462342486] [2021-08-27 15:16:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:06,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 15:16:06,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:06,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462342486] [2021-08-27 15:16:06,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462342486] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:16:06,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:16:06,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 15:16:06,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709618919] [2021-08-27 15:16:06,970 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:06,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:06,970 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 1 times [2021-08-27 15:16:06,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:06,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282238950] [2021-08-27 15:16:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:06,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:06,973 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:06,975 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:07,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 15:16:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 15:16:07,017 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 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 15:16:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:07,032 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-08-27 15:16:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 15:16:07,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-08-27 15:16:07,033 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-08-27 15:16:07,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-08-27 15:16:07,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-08-27 15:16:07,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-08-27 15:16:07,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-08-27 15:16:07,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:16:07,034 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-08-27 15:16:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-08-27 15:16:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2021-08-27 15:16:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2021-08-27 15:16:07,035 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-08-27 15:16:07,035 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-08-27 15:16:07,035 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 15:16:07,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2021-08-27 15:16:07,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-27 15:16:07,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:07,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:07,036 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:16:07,036 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:16:07,036 INFO L791 eck$LassoCheckResult]: Stem: 1038#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1025#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1026#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1018#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1019#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1047#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1048#L19-3 assume !(init_~i~0 < 2); 1043#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1030#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1027#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1020#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1021#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1046#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1040#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1041#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1031#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1032#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1022#L38-3 [2021-08-27 15:16:07,037 INFO L793 eck$LassoCheckResult]: Loop: 1022#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1024#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1036#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1022#L38-3 [2021-08-27 15:16:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2021-08-27 15:16:07,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:07,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902432943] [2021-08-27 15:16:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:07,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 15:16:07,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:07,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902432943] [2021-08-27 15:16:07,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902432943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:16:07,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 15:16:07,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 15:16:07,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500596284] [2021-08-27 15:16:07,217 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:07,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:07,218 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 2 times [2021-08-27 15:16:07,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:07,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334694894] [2021-08-27 15:16:07,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:07,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:07,220 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:07,222 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:07,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:07,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 15:16:07,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 15:16:07,263 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:07,434 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-08-27 15:16:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 15:16:07,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2021-08-27 15:16:07,435 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-08-27 15:16:07,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2021-08-27 15:16:07,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-08-27 15:16:07,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-27 15:16:07,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2021-08-27 15:16:07,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:16:07,436 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2021-08-27 15:16:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2021-08-27 15:16:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2021-08-27 15:16:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 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 15:16:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2021-08-27 15:16:07,437 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-08-27 15:16:07,437 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-08-27 15:16:07,437 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 15:16:07,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2021-08-27 15:16:07,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-27 15:16:07,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:07,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:07,438 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:16:07,438 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:16:07,438 INFO L791 eck$LassoCheckResult]: Stem: 1137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1124#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1125#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1117#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1118#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1146#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1147#L19-3 assume !(init_~i~0 < 2); 1143#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1133#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1128#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1122#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1123#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1145#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1139#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1140#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1131#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1132#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1138#L27-7 assume !(f_~i~1 < 2); 1130#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1119#L38-3 [2021-08-27 15:16:07,438 INFO L793 eck$LassoCheckResult]: Loop: 1119#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1121#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1135#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1119#L38-3 [2021-08-27 15:16:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2021-08-27 15:16:07,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:07,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075230938] [2021-08-27 15:16:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:07,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 15:16:07,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:07,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075230938] [2021-08-27 15:16:07,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075230938] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:07,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978423415] [2021-08-27 15:16:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:07,475 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:07,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:07,476 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:07,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-08-27 15:16:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:07,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 15:16:07,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 15:16:07,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978423415] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:07,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:07,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 15:16:07,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878232263] [2021-08-27 15:16:07,625 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:07,625 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 3 times [2021-08-27 15:16:07,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:07,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200417937] [2021-08-27 15:16:07,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:07,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:07,628 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:07,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:07,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:07,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 15:16:07,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 15:16:07,667 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 15:16:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:07,683 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-08-27 15:16:07,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 15:16:07,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-08-27 15:16:07,685 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-08-27 15:16:07,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-08-27 15:16:07,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-08-27 15:16:07,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-27 15:16:07,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-08-27 15:16:07,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:16:07,686 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-08-27 15:16:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-08-27 15:16:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2021-08-27 15:16:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 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 15:16:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-08-27 15:16:07,687 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-08-27 15:16:07,687 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-08-27 15:16:07,687 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 15:16:07,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2021-08-27 15:16:07,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-27 15:16:07,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:07,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:07,688 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:16:07,688 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:16:07,689 INFO L791 eck$LassoCheckResult]: Stem: 1276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1263#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1264#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1256#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1257#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1286#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1287#L19-3 assume !(init_~i~0 < 2); 1281#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1268#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1265#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1258#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1259#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1284#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1278#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1279#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1271#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1272#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1277#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1269#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1270#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1260#L38-3 [2021-08-27 15:16:07,689 INFO L793 eck$LassoCheckResult]: Loop: 1260#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1262#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1274#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1260#L38-3 [2021-08-27 15:16:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2021-08-27 15:16:07,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:07,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938098095] [2021-08-27 15:16:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:07,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:07,705 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:07,724 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:07,724 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 4 times [2021-08-27 15:16:07,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:07,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959188139] [2021-08-27 15:16:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:07,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:07,727 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:07,729 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash 951949666, now seen corresponding path program 1 times [2021-08-27 15:16:07,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:07,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443733530] [2021-08-27 15:16:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:07,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 15:16:08,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:08,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443733530] [2021-08-27 15:16:08,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443733530] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:08,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202231589] [2021-08-27 15:16:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:08,176 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:08,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:08,177 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:08,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-08-27 15:16:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:08,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-27 15:16:08,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:08,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 134 [2021-08-27 15:16:08,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2021-08-27 15:16:08,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2021-08-27 15:16:08,768 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-08-27 15:16:08,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 83 [2021-08-27 15:16:08,787 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-08-27 15:16:08,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 36 [2021-08-27 15:16:08,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-27 15:16:08,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-08-27 15:16:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 15:16:08,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202231589] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:08,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:08,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2021-08-27 15:16:08,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493145176] [2021-08-27 15:16:08,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:08,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 15:16:08,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-08-27 15:16:08,983 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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 15:16:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:09,282 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2021-08-27 15:16:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 15:16:09,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2021-08-27 15:16:09,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-27 15:16:09,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2021-08-27 15:16:09,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-08-27 15:16:09,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-27 15:16:09,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2021-08-27 15:16:09,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:16:09,284 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-08-27 15:16:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2021-08-27 15:16:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2021-08-27 15:16:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 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 15:16:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-08-27 15:16:09,285 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-08-27 15:16:09,286 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-08-27 15:16:09,286 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 15:16:09,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2021-08-27 15:16:09,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-27 15:16:09,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:09,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:09,287 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:16:09,287 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 15:16:09,287 INFO L791 eck$LassoCheckResult]: Stem: 1444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1432#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1433#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1426#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1427#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1457#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1459#L19-3 assume !(init_~i~0 < 2); 1453#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1437#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1436#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1430#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1431#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1455#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1446#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1447#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1440#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1441#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1445#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1438#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1439#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1428#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1429#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1443#L41 [2021-08-27 15:16:09,287 INFO L793 eck$LassoCheckResult]: Loop: 1443#L41 assume 1 == g_#t~mem12; 1452#L6 havoc g_#t~mem12;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1450#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1451#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1458#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1443#L41 [2021-08-27 15:16:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2021-08-27 15:16:09,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:09,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801934219] [2021-08-27 15:16:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:09,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:09,306 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:09,328 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:09,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:09,329 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 1 times [2021-08-27 15:16:09,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:09,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227187785] [2021-08-27 15:16:09,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:09,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:09,332 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:09,335 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:09,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:09,335 INFO L82 PathProgramCache]: Analyzing trace with hash -289378102, now seen corresponding path program 1 times [2021-08-27 15:16:09,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:09,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248376269] [2021-08-27 15:16:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:09,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 15:16:09,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:09,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248376269] [2021-08-27 15:16:09,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248376269] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:09,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444055093] [2021-08-27 15:16:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:09,577 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:09,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:09,578 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:09,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-08-27 15:16:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:09,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-27 15:16:09,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:09,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2021-08-27 15:16:09,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2021-08-27 15:16:10,085 INFO L354 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2021-08-27 15:16:10,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2021-08-27 15:16:10,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-27 15:16:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 15:16:10,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444055093] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:10,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:10,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-08-27 15:16:10,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226988452] [2021-08-27 15:16:10,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:10,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 15:16:10,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-08-27 15:16:10,300 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 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 15:16:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:10,815 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-08-27 15:16:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 15:16:10,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 63 transitions. [2021-08-27 15:16:10,832 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-08-27 15:16:10,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 63 transitions. [2021-08-27 15:16:10,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-08-27 15:16:10,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-08-27 15:16:10,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 63 transitions. [2021-08-27 15:16:10,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 15:16:10,833 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2021-08-27 15:16:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 63 transitions. [2021-08-27 15:16:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2021-08-27 15:16:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 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 15:16:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2021-08-27 15:16:10,838 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-08-27 15:16:10,838 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-08-27 15:16:10,838 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 15:16:10,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2021-08-27 15:16:10,839 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-08-27 15:16:10,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:10,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:10,840 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:16:10,840 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 15:16:10,840 INFO L791 eck$LassoCheckResult]: Stem: 1657#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1645#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1646#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1639#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1640#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1674#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1675#L19-3 assume !(init_~i~0 < 2); 1666#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1650#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1647#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1641#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1642#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1671#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1660#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1661#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1653#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1654#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1672#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1673#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1658#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1659#L27-7 assume !(f_~i~1 < 2); 1676#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1684#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1683#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1667#L41 [2021-08-27 15:16:10,841 INFO L793 eck$LassoCheckResult]: Loop: 1667#L41 assume 1 == g_#t~mem12; 1668#L6 havoc g_#t~mem12;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1670#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1678#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1681#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1667#L41 [2021-08-27 15:16:10,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:10,841 INFO L82 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2021-08-27 15:16:10,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:10,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72998387] [2021-08-27 15:16:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:10,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:11,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:11,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72998387] [2021-08-27 15:16:11,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72998387] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:11,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688807951] [2021-08-27 15:16:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:11,020 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:11,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:11,021 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:11,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-08-27 15:16:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:11,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 15:16:11,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:11,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 101 [2021-08-27 15:16:11,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2021-08-27 15:16:11,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2021-08-27 15:16:11,402 INFO L354 Elim1Store]: treesize reduction 140, result has 13.0 percent of original size [2021-08-27 15:16:11,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 87 [2021-08-27 15:16:11,420 INFO L354 Elim1Store]: treesize reduction 140, result has 13.0 percent of original size [2021-08-27 15:16:11,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 40 [2021-08-27 15:16:11,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-08-27 15:16:11,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-08-27 15:16:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 15:16:11,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688807951] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:11,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 15:16:11,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2021-08-27 15:16:11,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441408987] [2021-08-27 15:16:11,554 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 15:16:11,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:11,555 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 2 times [2021-08-27 15:16:11,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:11,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039807557] [2021-08-27 15:16:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:11,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:11,560 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:11,563 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:11,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 15:16:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-08-27 15:16:11,708 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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 15:16:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:11,933 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2021-08-27 15:16:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 15:16:11,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2021-08-27 15:16:11,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-27 15:16:11,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 38 transitions. [2021-08-27 15:16:11,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-27 15:16:11,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-08-27 15:16:11,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2021-08-27 15:16:11,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:11,935 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-08-27 15:16:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2021-08-27 15:16:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-08-27 15:16:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 15:16:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-08-27 15:16:11,936 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-08-27 15:16:11,936 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-08-27 15:16:11,936 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 15:16:11,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2021-08-27 15:16:11,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-27 15:16:11,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 15:16:11,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 15:16:11,937 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 15:16:11,937 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 15:16:11,937 INFO L791 eck$LassoCheckResult]: Stem: 1837#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1827#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1828#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1821#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1822#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1851#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1853#L19-3 assume !(init_~i~0 < 2); 1848#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1834#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1831#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1825#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1826#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1850#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1839#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1840#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1832#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1833#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1838#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1855#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1841#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1842#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1852#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1846#L41 assume 1 == g_#t~mem12; 1847#L6 havoc g_#t~mem12;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1845#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1823#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1824#L39 [2021-08-27 15:16:11,937 INFO L793 eck$LassoCheckResult]: Loop: 1824#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1836#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1854#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1824#L39 [2021-08-27 15:16:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash -147882112, now seen corresponding path program 2 times [2021-08-27 15:16:11,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:11,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055650570] [2021-08-27 15:16:11,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:11,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:11,964 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:11,993 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:11,993 INFO L82 PathProgramCache]: Analyzing trace with hash 115236, now seen corresponding path program 5 times [2021-08-27 15:16:11,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:11,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680873761] [2021-08-27 15:16:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:11,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:11,997 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 15:16:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 15:16:11,998 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 15:16:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 15:16:11,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1080532549, now seen corresponding path program 1 times [2021-08-27 15:16:11,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 15:16:11,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882070394] [2021-08-27 15:16:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:11,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 15:16:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 15:16:12,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 15:16:12,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882070394] [2021-08-27 15:16:12,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882070394] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 15:16:12,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450787477] [2021-08-27 15:16:12,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 15:16:12,026 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 15:16:12,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 15:16:12,053 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 15:16:12,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-08-27 15:16:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 15:16:12,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 15:16:12,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 15:16:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 15:16:12,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450787477] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 15:16:12,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 15:16:12,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-08-27 15:16:12,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173985756] [2021-08-27 15:16:12,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 15:16:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 15:16:12,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 15:16:12,420 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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 15:16:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 15:16:12,445 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2021-08-27 15:16:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 15:16:12,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2021-08-27 15:16:12,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 15:16:12,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2021-08-27 15:16:12,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 15:16:12,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 15:16:12,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 15:16:12,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 15:16:12,447 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 15:16:12,447 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 15:16:12,447 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 15:16:12,447 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 15:16:12,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 15:16:12,447 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 15:16:12,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 15:16:12,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 03:16:12 BoogieIcfgContainer [2021-08-27 15:16:12,451 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 15:16:12,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 15:16:12,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 15:16:12,452 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 15:16:12,452 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:15:33" (3/4) ... [2021-08-27 15:16:12,454 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 15:16:12,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 15:16:12,454 INFO L168 Benchmark]: Toolchain (without parser) took 39127.83 ms. Allocated memory was 56.6 MB in the beginning and 211.8 MB in the end (delta: 155.2 MB). Free memory was 34.5 MB in the beginning and 79.3 MB in the end (delta: -44.8 MB). Peak memory consumption was 109.3 MB. Max. memory is 16.1 GB. [2021-08-27 15:16:12,454 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory was 37.0 MB in the beginning and 37.0 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:16:12,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.25 ms. Allocated memory is still 56.6 MB. Free memory was 34.3 MB in the beginning and 39.5 MB in the end (delta: -5.2 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. [2021-08-27 15:16:12,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.47 ms. Allocated memory is still 56.6 MB. Free memory was 39.5 MB in the beginning and 37.7 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:16:12,455 INFO L168 Benchmark]: Boogie Preprocessor took 19.48 ms. Allocated memory is still 56.6 MB. Free memory was 37.7 MB in the beginning and 35.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 15:16:12,455 INFO L168 Benchmark]: RCFGBuilder took 339.88 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 37.9 MB in the end (delta: -2.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2021-08-27 15:16:12,455 INFO L168 Benchmark]: BuchiAutomizer took 38581.47 ms. Allocated memory was 69.2 MB in the beginning and 211.8 MB in the end (delta: 142.6 MB). Free memory was 37.7 MB in the beginning and 79.3 MB in the end (delta: -41.6 MB). Peak memory consumption was 100.6 MB. Max. memory is 16.1 GB. [2021-08-27 15:16:12,456 INFO L168 Benchmark]: Witness Printer took 2.51 ms. Allocated memory is still 211.8 MB. Free memory is still 79.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 15:16:12,457 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.15 ms. Allocated memory is still 56.6 MB. Free memory was 37.0 MB in the beginning and 37.0 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 150.25 ms. Allocated memory is still 56.6 MB. Free memory was 34.3 MB in the beginning and 39.5 MB in the end (delta: -5.2 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.47 ms. Allocated memory is still 56.6 MB. Free memory was 39.5 MB in the beginning and 37.7 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.48 ms. Allocated memory is still 56.6 MB. Free memory was 37.7 MB in the beginning and 35.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 339.88 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 37.9 MB in the end (delta: -2.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 38581.47 ms. Allocated memory was 69.2 MB in the beginning and 211.8 MB in the end (delta: 142.6 MB). Free memory was 37.7 MB in the beginning and 79.3 MB in the end (delta: -41.6 MB). Peak memory consumption was 100.6 MB. Max. memory is 16.1 GB. * Witness Printer took 2.51 ms. Allocated memory is still 211.8 MB. Free memory is still 79.3 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 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 3 * unknown-#length-unknown[pp] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function 3 + -2 * i and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.5s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 36.3s. Construction of modules took 0.6s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 29.0ms AutomataMinimizationTime, 11 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 295 SDtfs, 479 SDslu, 759 SDs, 0 SdLazy, 1071 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 633.5ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1582 mio100 ax100 hnf100 lsp97 ukn23 mio100 lsp35 div100 bol100 ite100 ukn100 eq178 hnf92 smp100 dnf107 smp100 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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 15:16:12,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2021-08-27 15:16:12,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2021-08-27 15:16:12,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:13,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:13,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2021-08-27 15:16:13,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2021-08-27 15:16:13,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-08-27 15:16:13,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...