./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sum05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:36:10,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:36:10,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:36:10,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:36:10,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:36:10,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:36:10,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:36:10,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:36:10,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:36:10,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:36:10,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:36:10,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:36:10,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:36:10,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:36:10,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:36:10,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:36:10,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:36:10,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:36:10,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:36:10,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:36:10,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:36:10,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:36:10,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:36:10,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:36:10,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:36:10,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:36:10,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:36:10,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:36:10,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:36:10,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:36:10,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:36:10,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:36:10,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:36:10,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:36:10,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:36:10,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:36:10,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:36:10,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:36:10,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:36:10,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:36:10,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:36:10,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:36:10,696 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:36:10,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:36:10,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:36:10,697 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:36:10,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:36:10,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:36:10,699 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:36:10,699 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:36:10,699 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:36:10,699 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:36:10,700 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:36:10,700 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:36:10,700 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:36:10,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:36:10,701 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:36:10,701 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:36:10,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:36:10,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:36:10,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:36:10,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:36:10,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:36:10,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:36:10,702 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:36:10,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:36:10,702 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:36:10,702 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:36:10,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:36:10,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:36:10,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:36:10,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:36:10,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:36:10,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:36:10,704 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:36:10,705 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 -> eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa [2021-08-27 17:36:10,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:36:10,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:36:10,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:36:10,997 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:36:10,998 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:36:10,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-08-27 17:36:11,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1428798/f5623ce8dc1144ecb68a20ad92446ecb/FLAG694d0d4d5 [2021-08-27 17:36:11,385 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:36:11,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-08-27 17:36:11,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1428798/f5623ce8dc1144ecb68a20ad92446ecb/FLAG694d0d4d5 [2021-08-27 17:36:11,403 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1428798/f5623ce8dc1144ecb68a20ad92446ecb [2021-08-27 17:36:11,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:36:11,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:36:11,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:36:11,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:36:11,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:36:11,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735a6850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11, skipping insertion in model container [2021-08-27 17:36:11,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:36:11,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:36:11,546 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/reducercommutativity/sum05-2.i[1271,1284] [2021-08-27 17:36:11,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:36:11,553 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:36:11,572 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/reducercommutativity/sum05-2.i[1271,1284] [2021-08-27 17:36:11,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:36:11,588 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:36:11,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11 WrapperNode [2021-08-27 17:36:11,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:36:11,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:36:11,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:36:11,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:36:11,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:36:11,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:36:11,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:36:11,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:36:11,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:36:11,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:36:11,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:36:11,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:36:11,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (1/1) ... [2021-08-27 17:36:11,675 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:11,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:11,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:11,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 17:36:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:36:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:36:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 17:36:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:36:11,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:36:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 17:36:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:36:11,942 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:36:11,942 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-08-27 17:36:11,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:36:11 BoogieIcfgContainer [2021-08-27 17:36:11,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:36:11,944 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:36:11,944 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:36:11,946 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:36:11,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:36:11,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:36:11" (1/3) ... [2021-08-27 17:36:11,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25b550f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:36:11, skipping insertion in model container [2021-08-27 17:36:11,947 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:36:11,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:36:11" (2/3) ... [2021-08-27 17:36:11,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25b550f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:36:11, skipping insertion in model container [2021-08-27 17:36:11,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:36:11,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:36:11" (3/3) ... [2021-08-27 17:36:11,948 INFO L389 chiAutomizerObserver]: Analyzing ICFG sum05-2.i [2021-08-27 17:36:11,973 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:36:11,973 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:36:11,973 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:36:11,973 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:36:11,974 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:36:11,974 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:36:11,974 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:36:11,974 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:36:11,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:12,000 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2021-08-27 17:36:12,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:12,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:12,013 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:36:12,013 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:12,013 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:36:12,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:12,015 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2021-08-27 17:36:12,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:12,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:12,016 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:36:12,016 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:12,019 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 15#L34-3true [2021-08-27 17:36:12,020 INFO L793 eck$LassoCheckResult]: Loop: 15#L34-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 11#L34-2true main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 15#L34-3true [2021-08-27 17:36:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:36:12,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:12,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644326807] [2021-08-27 17:36:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:12,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:12,082 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:12,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 17:36:12,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:12,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841906220] [2021-08-27 17:36:12,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:12,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:12,112 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:12,118 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:12,119 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 17:36:12,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:12,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792679714] [2021-08-27 17:36:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:12,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:12,134 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:12,149 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:12,526 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:36:12,526 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:36:12,526 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:36:12,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:36:12,527 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:36:12,527 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:12,527 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:36:12,527 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:36:12,527 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration1_Lasso [2021-08-27 17:36:12,527 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:36:12,527 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:36:12,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,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 17:36:12,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 17:36:12,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:12,950 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:36:12,953 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:36:12,954 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:12,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:12,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:12,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 17:36:12,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:12,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:12,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:12,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:12,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:12,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:12,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:12,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:12,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,001 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 17:36:13,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:13,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:13,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:13,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,044 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 17:36:13,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:13,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:13,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:13,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,085 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 17:36:13,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:13,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:13,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,124 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 17:36:13,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:13,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:13,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:13,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-08-27 17:36:13,166 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,167 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:13,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:13,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:13,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 17:36:13,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,206 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,207 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 17:36:13,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:13,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:13,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:13,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,249 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 17:36:13,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:13,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:13,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,291 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 17:36:13,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:13,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:13,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,337 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,338 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 17:36:13,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:13,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:13,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,379 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,380 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:13,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 17:36:13,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:13,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:13,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:13,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:13,423 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,424 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 17:36:13,424 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 17:36:13,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:13,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:13,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-08-27 17:36:13,467 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,467 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 17:36:13,468 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 17:36:13,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:13,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:13,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,508 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 17:36:13,508 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,509 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 17:36:13,510 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 17:36:13,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:13,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:13,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:13,550 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 17:36:13,550 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,551 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 17:36:13,552 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 17:36:13,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:13,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:13,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:13,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:13,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:13,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:13,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:13,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:36:13,595 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-27 17:36:13,596 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-27 17:36:13,597 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:13,598 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 17:36:13,599 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 17:36:13,599 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:36:13,615 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:36:13,616 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:36:13,616 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2021-08-27 17:36:13,634 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 17:36:13,648 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-27 17:36:13,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:13,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:36:13,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:13,751 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:36:13,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:13,821 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:36:13,822 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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 17:36:13,879 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 17:36:13,895 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 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 66 states and 92 transitions. Complement of second has 8 states. [2021-08-27 17:36:13,895 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 17:36:13,897 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 17:36:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2021-08-27 17:36:13,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 17:36:13,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:13,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 17:36:13,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:13,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 17:36:13,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:13,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2021-08-27 17:36:13,902 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:13,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2021-08-27 17:36:13,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-08-27 17:36:13,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:13,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2021-08-27 17:36:13,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:13,905 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 17:36:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2021-08-27 17:36:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-08-27 17:36:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 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 17:36:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-08-27 17:36:13,919 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 17:36:13,919 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 17:36:13,919 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:36:13,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2021-08-27 17:36:13,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:13,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:13,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:13,920 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 17:36:13,920 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:13,920 INFO L791 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 160#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 171#L34-3 assume !(main_~i~1 < 5); 163#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 164#L20-3 [2021-08-27 17:36:13,921 INFO L793 eck$LassoCheckResult]: Loop: 164#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 177#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 164#L20-3 [2021-08-27 17:36:13,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-27 17:36:13,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:13,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501405878] [2021-08-27 17:36:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:13,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:13,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:13,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501405878] [2021-08-27 17:36:13,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501405878] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:36:13,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:36:13,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:36:13,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987134716] [2021-08-27 17:36:13,951 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:13,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2021-08-27 17:36:13,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:13,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619926648] [2021-08-27 17:36:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:13,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:13,956 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:13,959 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:14,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:14,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:36:14,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:36:14,003 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 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 17:36:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:14,010 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-08-27 17:36:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:36:14,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2021-08-27 17:36:14,011 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2021-08-27 17:36:14,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:14,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:14,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2021-08-27 17:36:14,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:14,012 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-08-27 17:36:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2021-08-27 17:36:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-08-27 17:36:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-08-27 17:36:14,014 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-08-27 17:36:14,014 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-08-27 17:36:14,014 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:36:14,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2021-08-27 17:36:14,014 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:14,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:14,015 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:36:14,015 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:14,015 INFO L791 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 207#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 216#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 219#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 220#L34-3 assume !(main_~i~1 < 5); 208#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 209#L20-3 [2021-08-27 17:36:14,015 INFO L793 eck$LassoCheckResult]: Loop: 209#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 222#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 209#L20-3 [2021-08-27 17:36:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-27 17:36:14,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336533492] [2021-08-27 17:36:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:14,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:14,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336533492] [2021-08-27 17:36:14,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336533492] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:14,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122347957] [2021-08-27 17:36:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,039 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:14,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:14,040 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:14,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 17:36:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:14,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:36:14,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:14,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122347957] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:14,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:14,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:36:14,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208830332] [2021-08-27 17:36:14,099 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:14,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2021-08-27 17:36:14,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612509466] [2021-08-27 17:36:14,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,107 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,112 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:14,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:14,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:36:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:36:14,155 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:14,166 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-08-27 17:36:14,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:36:14,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2021-08-27 17:36:14,169 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2021-08-27 17:36:14,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:14,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:14,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2021-08-27 17:36:14,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:14,170 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-08-27 17:36:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2021-08-27 17:36:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-08-27 17:36:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-08-27 17:36:14,175 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-08-27 17:36:14,175 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-08-27 17:36:14,175 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:36:14,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2021-08-27 17:36:14,177 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:14,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:14,177 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-08-27 17:36:14,177 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:14,178 INFO L791 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 271#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 280#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 287#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 288#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 283#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 284#L34-3 assume !(main_~i~1 < 5); 272#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 273#L20-3 [2021-08-27 17:36:14,178 INFO L793 eck$LassoCheckResult]: Loop: 273#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 286#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 273#L20-3 [2021-08-27 17:36:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-08-27 17:36:14,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800859744] [2021-08-27 17:36:14,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:14,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:14,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800859744] [2021-08-27 17:36:14,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800859744] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:14,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736705779] [2021-08-27 17:36:14,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:36:14,226 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:14,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:14,226 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:14,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 17:36:14,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:36:14,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:14,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:36:14,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:14,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736705779] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:14,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:14,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:36:14,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075403288] [2021-08-27 17:36:14,299 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2021-08-27 17:36:14,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233564937] [2021-08-27 17:36:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,307 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,315 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:14,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:14,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:36:14,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:36:14,357 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:14,374 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-08-27 17:36:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:36:14,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2021-08-27 17:36:14,377 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2021-08-27 17:36:14,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:14,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:14,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2021-08-27 17:36:14,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:14,378 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-08-27 17:36:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2021-08-27 17:36:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-08-27 17:36:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-08-27 17:36:14,380 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-08-27 17:36:14,380 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-08-27 17:36:14,380 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:36:14,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2021-08-27 17:36:14,382 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:14,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:14,382 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-08-27 17:36:14,383 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:14,383 INFO L791 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 346#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 355#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 362#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 363#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 358#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 359#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 365#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 364#L34-3 assume !(main_~i~1 < 5); 347#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 348#L20-3 [2021-08-27 17:36:14,383 INFO L793 eck$LassoCheckResult]: Loop: 348#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 361#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 348#L20-3 [2021-08-27 17:36:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-08-27 17:36:14,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091347243] [2021-08-27 17:36:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:14,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:14,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091347243] [2021-08-27 17:36:14,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091347243] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:14,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143317068] [2021-08-27 17:36:14,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:36:14,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:14,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:14,441 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:14,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-27 17:36:14,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 17:36:14,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:14,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:36:14,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:14,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143317068] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:14,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:14,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:36:14,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463125529] [2021-08-27 17:36:14,536 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2021-08-27 17:36:14,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678461304] [2021-08-27 17:36:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,540 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,550 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:14,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:14,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:36:14,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:36:14,582 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:14,597 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-08-27 17:36:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:36:14,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2021-08-27 17:36:14,598 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2021-08-27 17:36:14,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:14,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:14,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2021-08-27 17:36:14,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:14,600 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-08-27 17:36:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2021-08-27 17:36:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-08-27 17:36:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-08-27 17:36:14,602 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-08-27 17:36:14,602 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-08-27 17:36:14,602 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:36:14,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2021-08-27 17:36:14,603 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:14,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:14,603 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-27 17:36:14,603 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:14,604 INFO L791 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 430#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 441#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 448#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 449#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 444#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 445#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 453#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 452#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 451#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 450#L34-3 assume !(main_~i~1 < 5); 433#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 434#L20-3 [2021-08-27 17:36:14,604 INFO L793 eck$LassoCheckResult]: Loop: 434#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 447#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 434#L20-3 [2021-08-27 17:36:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,604 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-08-27 17:36:14,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135834280] [2021-08-27 17:36:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:14,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:14,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135834280] [2021-08-27 17:36:14,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135834280] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:14,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383023520] [2021-08-27 17:36:14,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:36:14,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:14,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:14,663 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:14,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-27 17:36:14,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:36:14,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:14,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:36:14,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:14,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383023520] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:14,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:14,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:36:14,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42584560] [2021-08-27 17:36:14,760 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2021-08-27 17:36:14,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731473751] [2021-08-27 17:36:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,764 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,765 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:14,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:14,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:36:14,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:36:14,805 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 1.875) 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 17:36:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:14,821 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2021-08-27 17:36:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:36:14,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2021-08-27 17:36:14,821 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2021-08-27 17:36:14,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:36:14,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:36:14,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2021-08-27 17:36:14,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:14,822 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-08-27 17:36:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2021-08-27 17:36:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-08-27 17:36:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-08-27 17:36:14,824 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-08-27 17:36:14,824 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-08-27 17:36:14,824 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 17:36:14,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2021-08-27 17:36:14,824 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-08-27 17:36:14,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:14,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:14,825 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-08-27 17:36:14,825 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:14,825 INFO L791 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 528#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 537#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 544#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 545#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 540#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 541#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 551#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 550#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 549#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 548#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 547#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 546#L34-3 assume !(main_~i~1 < 5); 529#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 530#L20-3 [2021-08-27 17:36:14,825 INFO L793 eck$LassoCheckResult]: Loop: 530#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 543#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 530#L20-3 [2021-08-27 17:36:14,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-08-27 17:36:14,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264901384] [2021-08-27 17:36:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,832 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,840 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2021-08-27 17:36:14,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391772034] [2021-08-27 17:36:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,842 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,844 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2021-08-27 17:36:14,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:14,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941509857] [2021-08-27 17:36:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:14,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,852 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:14,861 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:15,820 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:36:15,820 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:36:15,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:36:15,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:36:15,820 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:36:15,820 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:15,820 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:36:15,820 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:36:15,820 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration7_Lasso [2021-08-27 17:36:15,820 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:36:15,820 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:36:15,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:15,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:15,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:15,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:15,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:15,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:16,319 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:36:16,319 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:36:16,319 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,340 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 17:36:16,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:16,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:16,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:16,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:16,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:16,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:16,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:16,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:16,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:16,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:16,366 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,367 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 17:36:16,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:16,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:16,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:16,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:16,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:16,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:16,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:16,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:16,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:16,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:16,393 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,393 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 17:36:16,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:16,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:16,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:16,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:16,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:16,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:16,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:16,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:16,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:16,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:16,442 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,443 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-27 17:36:16,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:16,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:16,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:16,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:16,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:16,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:16,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:16,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:16,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:16,487 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 17:36:16,487 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,488 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 17:36:16,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:16,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:16,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:16,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:16,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:16,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:16,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:16,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:16,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:16,549 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,550 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 17:36:16,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:16,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:16,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:16,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:16,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:16,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:16,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:16,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:16,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:16,592 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,593 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-27 17:36:16,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:16,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:16,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:16,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:16,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:16,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:16,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:16,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:16,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:16,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:16,633 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,634 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 17:36:16,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:16,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:16,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:16,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:16,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:16,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:16,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:16,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:16,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:16,677 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,678 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-27 17:36:16,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:16,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:16,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:16,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:16,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:16,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:16,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:16,708 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:36:16,721 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-08-27 17:36:16,721 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. [2021-08-27 17:36:16,721 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:16,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,722 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:16,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-27 17:36:16,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:36:16,731 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:36:16,731 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:36:16,731 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 9 Supporting invariants [] [2021-08-27 17:36:16,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:16,784 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-27 17:36:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:16,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:36:16,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:16,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:36:16,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:16,869 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:36:16,869 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:16,878 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 31 states and 38 transitions. Complement of second has 7 states. [2021-08-27 17:36:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 17:36:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-08-27 17:36:16,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2021-08-27 17:36:16,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:16,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2021-08-27 17:36:16,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:16,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2021-08-27 17:36:16,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:16,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2021-08-27 17:36:16,902 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:16,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2021-08-27 17:36:16,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-08-27 17:36:16,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-08-27 17:36:16,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-08-27 17:36:16,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:16,904 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-08-27 17:36:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-08-27 17:36:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-27 17:36:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-08-27 17:36:16,905 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-08-27 17:36:16,905 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-08-27 17:36:16,906 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 17:36:16,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2021-08-27 17:36:16,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:16,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:16,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:16,907 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:16,907 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:16,907 INFO L791 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 700#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 711#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 719#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 720#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 714#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 715#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 726#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 725#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 724#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 723#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 722#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 721#L34-3 assume !(main_~i~1 < 5); 703#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 704#L20-3 assume !(sum_~i~0 < 5); 712#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 713#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 709#L20-8 [2021-08-27 17:36:16,907 INFO L793 eck$LassoCheckResult]: Loop: 709#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 710#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 709#L20-8 [2021-08-27 17:36:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2021-08-27 17:36:16,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:16,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833255948] [2021-08-27 17:36:16,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:16,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:16,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 17:36:16,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:16,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833255948] [2021-08-27 17:36:16,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833255948] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:36:16,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:36:16,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:36:16,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458982218] [2021-08-27 17:36:16,924 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:16,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:16,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2021-08-27 17:36:16,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:16,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335723032] [2021-08-27 17:36:16,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:16,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:16,927 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:16,928 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:16,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:16,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:36:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:36:16,958 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:16,972 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-08-27 17:36:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:36:16,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2021-08-27 17:36:16,972 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:16,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2021-08-27 17:36:16,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:36:16,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:36:16,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2021-08-27 17:36:16,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:16,973 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-08-27 17:36:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2021-08-27 17:36:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-08-27 17:36:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-08-27 17:36:16,975 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-08-27 17:36:16,975 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-08-27 17:36:16,975 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 17:36:16,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2021-08-27 17:36:16,975 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:16,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:16,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:16,976 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:16,976 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:16,976 INFO L791 eck$LassoCheckResult]: Stem: 766#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 767#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 778#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 781#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 782#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 787#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 794#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 793#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 792#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 791#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 790#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 789#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 788#L34-3 assume !(main_~i~1 < 5); 770#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 771#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 784#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 785#L20-3 assume !(sum_~i~0 < 5); 779#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 780#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 776#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 777#L20-7 [2021-08-27 17:36:16,976 INFO L793 eck$LassoCheckResult]: Loop: 777#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 786#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 777#L20-7 [2021-08-27 17:36:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2021-08-27 17:36:16,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:16,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52024351] [2021-08-27 17:36:16,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:16,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 17:36:16,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:16,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52024351] [2021-08-27 17:36:16,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52024351] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:16,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807712764] [2021-08-27 17:36:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:16,999 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:16,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:16,999 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:17,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-08-27 17:36:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:17,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:36:17,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 17:36:17,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807712764] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:17,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:17,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:36:17,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719885468] [2021-08-27 17:36:17,113 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:17,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2021-08-27 17:36:17,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:17,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551783081] [2021-08-27 17:36:17,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:17,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:17,116 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:17,118 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:17,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:36:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:36:17,148 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 17:36:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:17,170 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2021-08-27 17:36:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:36:17,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2021-08-27 17:36:17,171 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:17,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2021-08-27 17:36:17,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-27 17:36:17,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 17:36:17,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2021-08-27 17:36:17,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:17,172 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2021-08-27 17:36:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2021-08-27 17:36:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2021-08-27 17:36:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-08-27 17:36:17,173 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-08-27 17:36:17,173 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-08-27 17:36:17,174 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 17:36:17,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2021-08-27 17:36:17,174 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:17,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:17,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:17,174 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:17,174 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:17,175 INFO L791 eck$LassoCheckResult]: Stem: 899#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 900#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 911#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 914#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 915#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 922#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 931#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 930#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 929#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 928#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 927#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 926#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 925#L34-3 assume !(main_~i~1 < 5); 903#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 904#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 917#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 918#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 919#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 924#L20-3 assume !(sum_~i~0 < 5); 912#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 913#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 920#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 921#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 909#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 910#L20-7 [2021-08-27 17:36:17,175 INFO L793 eck$LassoCheckResult]: Loop: 910#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 923#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 910#L20-7 [2021-08-27 17:36:17,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:17,175 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2021-08-27 17:36:17,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:17,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851629393] [2021-08-27 17:36:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:17,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 17:36:17,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:17,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851629393] [2021-08-27 17:36:17,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851629393] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:17,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876629169] [2021-08-27 17:36:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:17,201 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:17,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:17,202 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:17,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-27 17:36:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:17,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:36:17,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 17:36:17,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876629169] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:17,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:17,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:36:17,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472059059] [2021-08-27 17:36:17,341 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2021-08-27 17:36:17,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:17,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214297459] [2021-08-27 17:36:17,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:17,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:17,345 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:17,346 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:17,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:17,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:36:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:36:17,376 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:17,406 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2021-08-27 17:36:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:36:17,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2021-08-27 17:36:17,407 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:17,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2021-08-27 17:36:17,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-27 17:36:17,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-08-27 17:36:17,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2021-08-27 17:36:17,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:17,408 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-08-27 17:36:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2021-08-27 17:36:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2021-08-27 17:36:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2021-08-27 17:36:17,409 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2021-08-27 17:36:17,409 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2021-08-27 17:36:17,410 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 17:36:17,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2021-08-27 17:36:17,410 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:17,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:17,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:17,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:17,411 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:17,411 INFO L791 eck$LassoCheckResult]: Stem: 1057#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1058#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1067#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1070#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1071#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1078#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1088#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1087#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1086#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1085#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1084#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1083#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1082#L34-3 assume !(main_~i~1 < 5); 1059#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1060#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1073#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1076#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1089#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1074#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1075#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1081#L20-3 assume !(sum_~i~0 < 5); 1068#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1069#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1065#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1066#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1077#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1091#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1090#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1080#L20-7 [2021-08-27 17:36:17,411 INFO L793 eck$LassoCheckResult]: Loop: 1080#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1079#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1080#L20-7 [2021-08-27 17:36:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2021-08-27 17:36:17,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:17,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278213043] [2021-08-27 17:36:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:17,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-27 17:36:17,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:17,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278213043] [2021-08-27 17:36:17,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278213043] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:17,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247926704] [2021-08-27 17:36:17,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:36:17,443 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:17,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:17,444 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:36:17,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-08-27 17:36:17,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:36:17,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:17,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:36:17,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-27 17:36:17,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247926704] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:17,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:17,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:36:17,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160453285] [2021-08-27 17:36:17,608 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:17,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:17,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2021-08-27 17:36:17,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:17,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312178696] [2021-08-27 17:36:17,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:17,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:17,611 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:17,613 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:17,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:36:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:36:17,643 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:17,683 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2021-08-27 17:36:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:36:17,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2021-08-27 17:36:17,683 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:17,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2021-08-27 17:36:17,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-08-27 17:36:17,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-08-27 17:36:17,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2021-08-27 17:36:17,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:17,684 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-08-27 17:36:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2021-08-27 17:36:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2021-08-27 17:36:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2021-08-27 17:36:17,686 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-08-27 17:36:17,686 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-08-27 17:36:17,686 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 17:36:17,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2021-08-27 17:36:17,687 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:17,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:17,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:17,687 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:17,687 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:17,687 INFO L791 eck$LassoCheckResult]: Stem: 1234#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1235#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1246#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1249#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1250#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1257#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1268#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1267#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1266#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1265#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1264#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1263#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1262#L34-3 assume !(main_~i~1 < 5); 1238#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1239#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1252#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1253#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1254#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1274#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1273#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1272#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1261#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1260#L20-3 assume !(sum_~i~0 < 5); 1247#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1248#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1255#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1256#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1244#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1245#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1271#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1270#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1269#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1259#L20-7 [2021-08-27 17:36:17,687 INFO L793 eck$LassoCheckResult]: Loop: 1259#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1258#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1259#L20-7 [2021-08-27 17:36:17,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:17,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2021-08-27 17:36:17,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:17,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839980971] [2021-08-27 17:36:17,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:17,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-27 17:36:17,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:17,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839980971] [2021-08-27 17:36:17,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839980971] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:17,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169266482] [2021-08-27 17:36:17,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:36:17,724 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:17,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:17,725 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 17:36:17,726 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 17:36:17,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-27 17:36:17,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:17,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:36:17,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-27 17:36:17,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169266482] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:17,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:36:17,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:36:17,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879281074] [2021-08-27 17:36:17,921 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:36:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:17,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2021-08-27 17:36:17,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:17,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626747270] [2021-08-27 17:36:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:17,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:17,924 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:17,926 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:17,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:36:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:36:17,954 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:17,998 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2021-08-27 17:36:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:36:17,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2021-08-27 17:36:17,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:18,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2021-08-27 17:36:18,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-08-27 17:36:18,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-08-27 17:36:18,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2021-08-27 17:36:18,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:18,000 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-08-27 17:36:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2021-08-27 17:36:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2021-08-27 17:36:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 44 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 17:36:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-08-27 17:36:18,002 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-08-27 17:36:18,002 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-08-27 17:36:18,002 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 17:36:18,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2021-08-27 17:36:18,002 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-08-27 17:36:18,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:18,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:18,003 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:18,003 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:18,003 INFO L791 eck$LassoCheckResult]: Stem: 1435#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1436#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1445#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1455#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1456#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1448#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1449#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1477#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1476#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1475#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1474#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1473#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1472#L34-3 assume !(main_~i~1 < 5); 1437#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1438#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1451#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1452#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1453#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1471#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1470#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1469#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1468#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1467#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1464#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1463#L20-3 assume !(sum_~i~0 < 5); 1446#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1447#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1443#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1444#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1454#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1466#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1465#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1462#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1461#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1460#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1459#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1458#L20-7 [2021-08-27 17:36:18,003 INFO L793 eck$LassoCheckResult]: Loop: 1458#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1457#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1458#L20-7 [2021-08-27 17:36:18,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:18,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2021-08-27 17:36:18,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:18,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738081701] [2021-08-27 17:36:18,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:18,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,045 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,072 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:18,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:18,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2021-08-27 17:36:18,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:18,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489125304] [2021-08-27 17:36:18,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:18,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,075 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2021-08-27 17:36:18,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:18,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203440600] [2021-08-27 17:36:18,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:18,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-08-27 17:36:18,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:36:18,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203440600] [2021-08-27 17:36:18,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203440600] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:36:18,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877233238] [2021-08-27 17:36:18,147 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 17:36:18,148 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:36:18,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:18,169 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 17:36:18,170 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 17:36:18,329 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 17:36:18,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:36:18,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:36:18,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-08-27 17:36:18,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877233238] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:36:18,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 17:36:18,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2021-08-27 17:36:18,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648373238] [2021-08-27 17:36:18,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:36:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:36:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:36:18,524 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:36:18,607 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2021-08-27 17:36:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:36:18,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2021-08-27 17:36:18,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:36:18,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2021-08-27 17:36:18,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-08-27 17:36:18,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-08-27 17:36:18,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2021-08-27 17:36:18,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:18,612 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-08-27 17:36:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2021-08-27 17:36:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-08-27 17:36:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2021-08-27 17:36:18,613 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-08-27 17:36:18,613 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-08-27 17:36:18,613 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 17:36:18,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2021-08-27 17:36:18,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:36:18,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:36:18,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:36:18,614 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:36:18,614 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:36:18,615 INFO L791 eck$LassoCheckResult]: Stem: 1657#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1658#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1667#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1675#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1676#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1670#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1671#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1698#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1697#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1696#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1695#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1694#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1693#L34-3 assume !(main_~i~1 < 5); 1661#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1662#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1672#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1673#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1692#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1691#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1690#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1689#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1687#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1685#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1683#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1681#L20-3 assume !(sum_~i~0 < 5); 1668#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1669#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1665#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1666#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1674#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1688#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1686#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1684#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1682#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1680#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1679#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1678#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1677#L20-8 assume !(sum_~i~0 < 5); 1659#L20-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1660#L23-1 main_#t~ret10 := sum_#res;main_~ret2~0 := main_#t~ret10;havoc main_#t~ret10;call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~2 := 0; 1664#L43-3 [2021-08-27 17:36:18,615 INFO L793 eck$LassoCheckResult]: Loop: 1664#L43-3 assume !!(main_~i~2 < 4);call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem13, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem13; 1663#L43-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 1664#L43-3 [2021-08-27 17:36:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2021-08-27 17:36:18,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:18,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704576234] [2021-08-27 17:36:18,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:18,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,648 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,672 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:18,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2021-08-27 17:36:18,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:18,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116444619] [2021-08-27 17:36:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:18,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,674 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,676 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2021-08-27 17:36:18,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:36:18,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43855795] [2021-08-27 17:36:18,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:36:18,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:36:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,691 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:36:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:36:18,714 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:23,251 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:36:23,251 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:36:23,251 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:36:23,251 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:36:23,251 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:36:23,251 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:23,251 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:36:23,252 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:36:23,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration14_Lasso [2021-08-27 17:36:23,252 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:36:23,252 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:36:23,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:23,667 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2021-08-27 17:36:24,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:24,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:36:25,523 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:36:25,523 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:36:25,523 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,524 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-27 17:36:25,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:25,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:25,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:25,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,561 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,562 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 17:36:25,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:25,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:25,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:25,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,603 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,604 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-27 17:36:25,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:25,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:25,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:25,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,645 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,646 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:25,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:25,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-27 17:36:25,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,686 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,687 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 17:36:25,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:25,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:25,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:25,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,728 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,729 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-27 17:36:25,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:25,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:25,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:25,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,769 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,770 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-27 17:36:25,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:25,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:25,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:25,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,811 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 17:36:25,811 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,812 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-27 17:36:25,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:25,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:25,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-08-27 17:36:25,843 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,845 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:25,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:25,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-27 17:36:25,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,885 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,885 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-27 17:36:25,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:25,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:25,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:25,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,937 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,938 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-27 17:36:25,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,947 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-08-27 17:36:25,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,955 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-08-27 17:36:25,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:25,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:25,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:25,988 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:25,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:25,989 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:25,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-08-27 17:36:25,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:25,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:25,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:25,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:25,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:25,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:25,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:26,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:26,032 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,033 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-27 17:36:26,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:26,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:26,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:26,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:26,076 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,077 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-27 17:36:26,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:26,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:26,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:26,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:26,119 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,120 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-27 17:36:26,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:26,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:26,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:26,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:26,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:26,159 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,160 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-27 17:36:26,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:26,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:26,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:26,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:26,189 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,189 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-27 17:36:26,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:26,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:26,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:26,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:26,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:26,229 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,230 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:26,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-08-27 17:36:26,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:26,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:26,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:26,293 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,294 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-08-27 17:36:26,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:36:26,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:26,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:36:26,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:36:26,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:26,342 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,343 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-08-27 17:36:26,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:26,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:26,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:26,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-08-27 17:36:26,372 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,373 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-08-27 17:36:26,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,381 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-08-27 17:36:26,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,383 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-08-27 17:36:26,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:26,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:36:26,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:26,420 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,421 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-08-27 17:36:26,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:36:26,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:36:26,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:36:26,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:36:26,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:36:26,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:36:26,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:36:26,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:36:26,488 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-08-27 17:36:26,488 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. [2021-08-27 17:36:26,489 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:36:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:36:26,489 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:36:26,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-08-27 17:36:26,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:36:26,498 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:36:26,498 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:36:26,498 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2021-08-27 17:36:26,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-08-27 17:36:26,639 INFO L297 tatePredicateManager]: 53 out of 53 supporting invariants were superfluous and have been removed [2021-08-27 17:36:26,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:36:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:26,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:36:26,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:36:26,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:36:26,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:36:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:36:26,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:36:26,799 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:26,804 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 44 states and 46 transitions. Complement of second has 4 states. [2021-08-27 17:36:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:36:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:36:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2021-08-27 17:36:26,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2021-08-27 17:36:26,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:26,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2021-08-27 17:36:26,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:26,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2021-08-27 17:36:26,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:36:26,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2021-08-27 17:36:26,806 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:36:26,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2021-08-27 17:36:26,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:36:26,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:36:26,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:36:26,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:36:26,806 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:36:26,806 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:36:26,806 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:36:26,807 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 17:36:26,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 17:36:26,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:36:26,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 17:36:26,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:36:26 BoogieIcfgContainer [2021-08-27 17:36:26,811 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:36:26,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:36:26,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:36:26,811 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:36:26,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:36:11" (3/4) ... [2021-08-27 17:36:26,813 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 17:36:26,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:36:26,814 INFO L168 Benchmark]: Toolchain (without parser) took 15407.18 ms. Allocated memory was 54.5 MB in the beginning and 262.1 MB in the end (delta: 207.6 MB). Free memory was 31.8 MB in the beginning and 106.8 MB in the end (delta: -75.0 MB). Peak memory consumption was 132.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:36:26,815 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 54.5 MB. Free memory was 36.0 MB in the beginning and 35.9 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:36:26,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.33 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 31.6 MB in the beginning and 57.9 MB in the end (delta: -26.3 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. [2021-08-27 17:36:26,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 73.4 MB. Free memory was 57.9 MB in the beginning and 55.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:36:26,815 INFO L168 Benchmark]: Boogie Preprocessor took 32.10 ms. Allocated memory is still 73.4 MB. Free memory was 55.9 MB in the beginning and 54.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:36:26,816 INFO L168 Benchmark]: RCFGBuilder took 274.50 ms. Allocated memory is still 73.4 MB. Free memory was 54.6 MB in the beginning and 37.3 MB in the end (delta: 17.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-27 17:36:26,816 INFO L168 Benchmark]: BuchiAutomizer took 14866.99 ms. Allocated memory was 73.4 MB in the beginning and 262.1 MB in the end (delta: 188.7 MB). Free memory was 37.0 MB in the beginning and 106.8 MB in the end (delta: -69.8 MB). Peak memory consumption was 120.5 MB. Max. memory is 16.1 GB. [2021-08-27 17:36:26,816 INFO L168 Benchmark]: Witness Printer took 2.37 ms. Allocated memory is still 262.1 MB. Free memory is still 106.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:36:26,817 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.16 ms. Allocated memory is still 54.5 MB. Free memory was 36.0 MB in the beginning and 35.9 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 180.33 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 31.6 MB in the beginning and 57.9 MB in the end (delta: -26.3 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 73.4 MB. Free memory was 57.9 MB in the beginning and 55.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.10 ms. Allocated memory is still 73.4 MB. Free memory was 55.9 MB in the beginning and 54.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 274.50 ms. Allocated memory is still 73.4 MB. Free memory was 54.6 MB in the beginning and 37.3 MB in the end (delta: 17.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 14866.99 ms. Allocated memory was 73.4 MB in the beginning and 262.1 MB in the end (delta: 188.7 MB). Free memory was 37.0 MB in the beginning and 106.8 MB in the end (delta: -69.8 MB). Peak memory consumption was 120.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.37 ms. Allocated memory is still 262.1 MB. Free memory is still 106.8 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 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function 7 + -2 * i and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.8s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 13.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 28.1ms AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 233 SDtfs, 159 SDslu, 266 SDs, 0 SdLazy, 326 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 253.8ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital509 mio100 ax100 hnf99 lsp118 ukn49 mio100 lsp35 div104 bol100 ite100 ukn100 eq163 hnf87 smp93 dnf159 smp83 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 14 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 17:36:26,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:27,054 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 17:36:27,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:27,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:27,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:27,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-08-27 17:36:28,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:28,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:28,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-08-27 17:36:28,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-27 17:36:28,886 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...