./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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/termination-memory-alloca/c.01_assume-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 252aa5e38f898b42e65698848f3b58e46a12e01218aba7e2f3e037db40adbdd2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:27:40,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:27:40,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:27:40,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:27:40,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:27:40,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:27:40,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:27:40,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:27:40,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:27:40,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:27:40,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:27:40,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:27:40,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:27:40,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:27:40,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:27:40,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:27:40,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:27:40,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:27:40,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:27:40,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:27:40,546 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:27:40,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:27:40,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:27:40,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:27:40,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:27:40,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:27:40,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:27:40,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:27:40,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:27:40,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:27:40,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:27:40,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:27:40,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:27:40,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:27:40,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:27:40,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:27:40,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:27:40,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:27:40,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:27:40,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:27:40,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:27:40,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:27:40,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-23 14:27:40,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:27:40,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:27:40,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:27:40,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:27:40,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:27:40,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:27:40,585 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:27:40,585 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:27:40,586 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:27:40,586 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:27:40,586 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:27:40,587 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:27:40,587 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:27:40,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:27:40,587 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:27:40,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:27:40,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:27:40,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:27:40,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:27:40,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:27:40,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:27:40,589 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:27:40,589 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:27:40,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:27:40,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:27:40,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:27:40,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:27:40,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:27:40,590 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:27:40,591 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 252aa5e38f898b42e65698848f3b58e46a12e01218aba7e2f3e037db40adbdd2 [2022-07-23 14:27:40,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:27:40,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:27:40,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:27:40,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:27:40,783 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:27:40,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2022-07-23 14:27:40,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36152de97/f6fc3bd4c3b24fdf8e659b10869a10e7/FLAG56a9483a9 [2022-07-23 14:27:41,199 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:27:41,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2022-07-23 14:27:41,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36152de97/f6fc3bd4c3b24fdf8e659b10869a10e7/FLAG56a9483a9 [2022-07-23 14:27:41,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36152de97/f6fc3bd4c3b24fdf8e659b10869a10e7 [2022-07-23 14:27:41,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:27:41,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:27:41,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:27:41,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:27:41,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:27:41,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d93dce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41, skipping insertion in model container [2022-07-23 14:27:41,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:27:41,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:27:41,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:27:41,532 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:27:41,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:27:41,585 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:27:41,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41 WrapperNode [2022-07-23 14:27:41,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:27:41,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:27:41,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:27:41,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:27:41,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,627 INFO L137 Inliner]: procedures = 111, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2022-07-23 14:27:41,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:27:41,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:27:41,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:27:41,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:27:41,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:27:41,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:27:41,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:27:41,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:27:41,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (1/1) ... [2022-07-23 14:27:41,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:41,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:41,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:41,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 14:27:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:27:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:27:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:27:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:27:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:27:41,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:27:41,834 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:27:41,835 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:27:41,980 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:27:41,984 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:27:41,984 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 14:27:41,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:27:41 BoogieIcfgContainer [2022-07-23 14:27:41,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:27:41,986 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:27:41,986 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:27:41,991 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:27:41,991 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:27:41,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:27:41" (1/3) ... [2022-07-23 14:27:41,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4028021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:27:41, skipping insertion in model container [2022-07-23 14:27:41,993 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:27:41,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:41" (2/3) ... [2022-07-23 14:27:41,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4028021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:27:41, skipping insertion in model container [2022-07-23 14:27:41,993 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:27:41,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:27:41" (3/3) ... [2022-07-23 14:27:41,994 INFO L354 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca.i [2022-07-23 14:27:42,031 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:27:42,031 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:27:42,031 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:27:42,031 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:27:42,031 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:27:42,031 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:27:42,031 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:27:42,032 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:27:42,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:42,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-23 14:27:42,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:42,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:42,049 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:42,049 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:27:42,049 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:27:42,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:42,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-23 14:27:42,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:42,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:42,052 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:42,052 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:27:42,056 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 5#L553-3true [2022-07-23 14:27:42,060 INFO L754 eck$LassoCheckResult]: Loop: 5#L553-3true call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 8#L553-1true assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9#L555-5true assume !true; 11#L555-6true call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 5#L553-3true [2022-07-23 14:27:42,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,066 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 14:27:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286359509] [2022-07-23 14:27:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,171 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:42,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2022-07-23 14:27:42,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870471520] [2022-07-23 14:27:42,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:42,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870471520] [2022-07-23 14:27:42,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870471520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:27:42,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:27:42,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 14:27:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598491966] [2022-07-23 14:27:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:27:42,287 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:27:42,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 14:27:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 14:27:42,311 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2022-07-23 14:27:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:42,316 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-07-23 14:27:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 14:27:42,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2022-07-23 14:27:42,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-23 14:27:42,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2022-07-23 14:27:42,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-23 14:27:42,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-23 14:27:42,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2022-07-23 14:27:42,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:27:42,327 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-07-23 14:27:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2022-07-23 14:27:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-23 14:27:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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) [2022-07-23 14:27:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2022-07-23 14:27:42,343 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-07-23 14:27:42,343 INFO L374 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-07-23 14:27:42,343 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:27:42,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2022-07-23 14:27:42,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-23 14:27:42,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:42,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:42,344 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:42,344 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:27:42,345 INFO L752 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 41#L553-3 [2022-07-23 14:27:42,345 INFO L754 eck$LassoCheckResult]: Loop: 41#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 43#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 42#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 44#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 38#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 39#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 41#L553-3 [2022-07-23 14:27:42,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,347 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-23 14:27:42,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925135505] [2022-07-23 14:27:42,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,381 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2022-07-23 14:27:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397561217] [2022-07-23 14:27:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:42,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:42,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397561217] [2022-07-23 14:27:42,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397561217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:27:42,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:27:42,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:27:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175261140] [2022-07-23 14:27:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:27:42,474 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:27:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:42,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:27:42,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:27:42,480 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:42,522 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-07-23 14:27:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:27:42,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2022-07-23 14:27:42,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-07-23 14:27:42,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2022-07-23 14:27:42,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 14:27:42,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 14:27:42,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2022-07-23 14:27:42,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:27:42,526 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-23 14:27:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2022-07-23 14:27:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2022-07-23 14:27:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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) [2022-07-23 14:27:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-07-23 14:27:42,529 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-07-23 14:27:42,529 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-07-23 14:27:42,529 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:27:42,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-07-23 14:27:42,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-07-23 14:27:42,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:42,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:42,531 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:42,531 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:27:42,531 INFO L752 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 73#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 77#L553-3 [2022-07-23 14:27:42,531 INFO L754 eck$LassoCheckResult]: Loop: 77#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 78#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 80#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 81#L555-1 assume !test_fun_#t~short8#1; 83#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 76#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 77#L553-3 [2022-07-23 14:27:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-23 14:27:42,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887600143] [2022-07-23 14:27:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2022-07-23 14:27:42,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125964757] [2022-07-23 14:27:42,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2022-07-23 14:27:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607342080] [2022-07-23 14:27:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:43,049 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:27:43,049 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:27:43,049 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:27:43,050 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:27:43,050 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:27:43,050 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,050 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:27:43,050 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:27:43,050 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration3_Lasso [2022-07-23 14:27:43,050 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:27:43,050 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:27:43,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:43,625 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:27:43,628 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:27:43,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:43,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 14:27:43,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-23 14:27:43,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:43,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 14:27:43,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-23 14:27:43,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,716 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:43,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 14:27:43,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:43,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:43,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:43,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:43,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 14:27:43,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,819 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 [2022-07-23 14:27:43,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:43,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 14:27:43,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:43,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:43,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:43,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,866 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:43,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 14:27:43,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,911 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 [2022-07-23 14:27:43,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,913 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:43,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 14:27:43,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:43,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,957 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:43,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 14:27:43,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:43,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:43,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:43,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:43,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 14:27:43,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:44,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:44,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:44,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:44,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,025 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 14:27:44,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:44,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:44,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:44,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:44,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,052 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 14:27:44,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:44,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-23 14:27:44,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,096 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 14:27:44,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:44,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:44,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:44,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:44,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,123 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) [2022-07-23 14:27:44,124 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 [2022-07-23 14:27:44,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:44,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:44,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:44,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,158 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 [2022-07-23 14:27:44,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,159 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) [2022-07-23 14:27:44,160 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 [2022-07-23 14:27:44,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:44,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,198 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 [2022-07-23 14:27:44,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,199 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) [2022-07-23 14:27:44,200 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 [2022-07-23 14:27:44,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:44,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:44,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:44,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,269 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 [2022-07-23 14:27:44,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,271 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) [2022-07-23 14:27:44,272 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 [2022-07-23 14:27:44,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:44,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,312 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 [2022-07-23 14:27:44,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,313 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 14:27:44,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:44,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:44,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,347 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 14:27:44,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:44,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:44,375 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:27:44,402 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-23 14:27:44,403 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-07-23 14:27:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,424 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 14:27:44,467 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:27:44,488 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:27:44,488 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:27:44,489 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 + 1 Supporting invariants [] [2022-07-23 14:27:44,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:44,548 INFO L293 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2022-07-23 14:27:44,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:44,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 14:27:44,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:44,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 14:27:44,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:44,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:27:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:44,705 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-23 14:27:44,705 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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) [2022-07-23 14:27:44,757 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 22 states and 29 transitions. Complement of second has 6 states. [2022-07-23 14:27:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:27:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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) [2022-07-23 14:27:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-07-23 14:27:44,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2022-07-23 14:27:44,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:44,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 6 letters. [2022-07-23 14:27:44,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:44,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 12 letters. [2022-07-23 14:27:44,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:44,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2022-07-23 14:27:44,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:27:44,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 28 transitions. [2022-07-23 14:27:44,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-23 14:27:44,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-23 14:27:44,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2022-07-23 14:27:44,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:27:44,763 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-23 14:27:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2022-07-23 14:27:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-07-23 14:27:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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) [2022-07-23 14:27:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-07-23 14:27:44,764 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-07-23 14:27:44,764 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-07-23 14:27:44,764 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:27:44,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2022-07-23 14:27:44,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:27:44,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:44,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:44,765 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 14:27:44,765 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:27:44,765 INFO L752 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 213#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 215#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 211#L555-5 [2022-07-23 14:27:44,765 INFO L754 eck$LassoCheckResult]: Loop: 211#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 216#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 205#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 206#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 211#L555-5 [2022-07-23 14:27:44,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:44,765 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2022-07-23 14:27:44,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:44,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80512556] [2022-07-23 14:27:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:44,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:44,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:44,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1450089, now seen corresponding path program 1 times [2022-07-23 14:27:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:44,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542327] [2022-07-23 14:27:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:44,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:44,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash 179565776, now seen corresponding path program 1 times [2022-07-23 14:27:44,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:44,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506951455] [2022-07-23 14:27:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:44,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:44,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:44,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:45,244 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:27:45,244 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:27:45,244 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:27:45,244 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:27:45,244 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:27:45,244 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:45,244 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:27:45,244 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:27:45,244 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration4_Lasso [2022-07-23 14:27:45,244 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:27:45,244 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:27:45,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:27:45,728 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:27:45,728 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:27:45,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:45,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:45,729 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:45,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 14:27:45,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:45,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:45,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:45,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:45,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:45,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:45,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:45,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:45,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:45,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:45,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:45,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:45,780 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) [2022-07-23 14:27:45,781 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 [2022-07-23 14:27:45,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:45,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:45,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:45,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:45,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:45,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:45,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:45,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:45,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:45,832 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 [2022-07-23 14:27:45,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:45,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:45,833 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) [2022-07-23 14:27:45,834 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 [2022-07-23 14:27:45,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:45,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:45,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:45,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:45,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:45,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:45,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:45,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:45,887 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 [2022-07-23 14:27:45,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:45,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:45,888 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) [2022-07-23 14:27:45,889 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 [2022-07-23 14:27:45,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:45,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:45,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:45,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:45,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:45,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:45,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:45,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:45,941 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 [2022-07-23 14:27:45,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:45,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:45,942 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) [2022-07-23 14:27:45,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:45,955 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 [2022-07-23 14:27:45,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:45,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:45,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:45,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:45,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:45,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:45,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:45,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:45,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:45,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:45,990 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) [2022-07-23 14:27:45,991 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 [2022-07-23 14:27:45,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:45,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:45,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:45,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:45,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:46,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:46,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:46,019 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:27:46,028 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-23 14:27:46,028 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-23 14:27:46,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:46,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:46,029 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) [2022-07-23 14:27:46,031 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 [2022-07-23 14:27:46,032 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:27:46,067 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:27:46,068 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:27:46,068 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 + 2147483647 Supporting invariants [] [2022-07-23 14:27:46,101 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 [2022-07-23 14:27:46,117 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-23 14:27:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:46,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:27:46,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:46,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 14:27:46,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:46,180 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-23 14:27:46,180 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2022-07-23 14:27:46,201 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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 42 states and 57 transitions. Complement of second has 9 states. [2022-07-23 14:27:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-23 14:27:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2022-07-23 14:27:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2022-07-23 14:27:46,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2022-07-23 14:27:46,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:46,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-23 14:27:46,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:46,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2022-07-23 14:27:46,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:46,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. [2022-07-23 14:27:46,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:27:46,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 30 states and 40 transitions. [2022-07-23 14:27:46,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-23 14:27:46,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-23 14:27:46,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2022-07-23 14:27:46,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:27:46,204 INFO L369 hiAutomatonCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-07-23 14:27:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2022-07-23 14:27:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-07-23 14:27:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-07-23 14:27:46,228 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-07-23 14:27:46,228 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-07-23 14:27:46,228 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:27:46,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2022-07-23 14:27:46,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:27:46,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:46,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:46,230 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-23 14:27:46,230 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:27:46,231 INFO L752 eck$LassoCheckResult]: Stem: 359#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 369#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 370#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 375#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 382#L555-1 assume !test_fun_#t~short8#1; 363#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 364#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 365#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 372#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 366#L555-5 [2022-07-23 14:27:46,231 INFO L754 eck$LassoCheckResult]: Loop: 366#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 373#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 361#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 362#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 366#L555-5 [2022-07-23 14:27:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:46,231 INFO L85 PathProgramCache]: Analyzing trace with hash 765810429, now seen corresponding path program 2 times [2022-07-23 14:27:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:46,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487227306] [2022-07-23 14:27:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:46,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:46,251 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:46,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:46,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:46,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1450089, now seen corresponding path program 2 times [2022-07-23 14:27:46,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:46,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642367228] [2022-07-23 14:27:46,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:46,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:46,277 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:46,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1660970651, now seen corresponding path program 1 times [2022-07-23 14:27:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:46,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025078435] [2022-07-23 14:27:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:46,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:46,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025078435] [2022-07-23 14:27:46,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025078435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:27:46,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774573603] [2022-07-23 14:27:46,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:46,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:27:46,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:46,366 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:27:46,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-23 14:27:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:46,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 14:27:46,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:46,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 14:27:46,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 14:27:46,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-07-23 14:27:46,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-07-23 14:27:46,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-23 14:27:46,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-23 14:27:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:46,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:27:46,756 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 [2022-07-23 14:27:46,850 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-23 14:27:46,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 72 [2022-07-23 14:27:46,862 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-23 14:27:46,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 69 [2022-07-23 14:27:46,869 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 14:27:46,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-23 14:27:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:46,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774573603] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:27:46,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:27:46,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2022-07-23 14:27:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485850287] [2022-07-23 14:27:46,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:27:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:46,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 14:27:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=431, Unknown=2, NotChecked=0, Total=552 [2022-07-23 14:27:46,978 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 12 Second operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:47,134 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-07-23 14:27:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 14:27:47,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2022-07-23 14:27:47,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:27:47,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 41 transitions. [2022-07-23 14:27:47,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-23 14:27:47,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-23 14:27:47,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2022-07-23 14:27:47,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:27:47,137 INFO L369 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-23 14:27:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2022-07-23 14:27:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2022-07-23 14:27:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-07-23 14:27:47,139 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-23 14:27:47,139 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-23 14:27:47,139 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:27:47,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2022-07-23 14:27:47,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:27:47,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:47,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:47,140 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:27:47,140 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:27:47,140 INFO L752 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 567#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 568#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 571#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 576#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 577#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 578#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 579#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 574#L555-1 assume !test_fun_#t~short8#1; 575#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 563#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 564#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 570#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 565#L555-5 [2022-07-23 14:27:47,140 INFO L754 eck$LassoCheckResult]: Loop: 565#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 572#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 559#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 560#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 565#L555-5 [2022-07-23 14:27:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2109612571, now seen corresponding path program 2 times [2022-07-23 14:27:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:47,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794168166] [2022-07-23 14:27:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:47,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:47,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:47,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1450089, now seen corresponding path program 3 times [2022-07-23 14:27:47,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:47,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085688882] [2022-07-23 14:27:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:47,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:47,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1330746291, now seen corresponding path program 3 times [2022-07-23 14:27:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:47,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467302792] [2022-07-23 14:27:47,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:47,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:47,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467302792] [2022-07-23 14:27:47,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467302792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:27:47,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650294892] [2022-07-23 14:27:47,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 14:27:47,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:27:47,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:47,327 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:27:47,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-23 14:27:47,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-23 14:27:47,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:27:47,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 14:27:47,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:47,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 14:27:47,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 14:27:47,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:27:47,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-07-23 14:27:47,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 14:27:47,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-23 14:27:47,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-07-23 14:27:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:47,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:27:47,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_258 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_261 Int) (v_ArrVal_262 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_258)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select v_ArrVal_262 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse4 (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (<= (div (+ (- 4) (* .cse0 (- 1))) (- 2)) 2) (<= (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_261)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) .cse0) (not (<= v_ArrVal_258 (* 2 (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)))) (< v_ArrVal_258 .cse4) (not (<= (+ v_ArrVal_261 1) .cse4)))))))) is different from false [2022-07-23 14:27:47,950 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-23 14:27:47,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 72 [2022-07-23 14:27:47,958 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-23 14:27:47,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 71 [2022-07-23 14:27:47,968 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 14:27:47,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2022-07-23 14:27:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-23 14:27:47,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650294892] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:27:47,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:27:47,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-07-23 14:27:47,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185205479] [2022-07-23 14:27:47,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:27:48,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:48,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 14:27:48,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=675, Unknown=1, NotChecked=54, Total=870 [2022-07-23 14:27:48,076 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 8 Second operand has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 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) [2022-07-23 14:28:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:28:36,614 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-07-23 14:28:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 14:28:36,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 78 transitions. [2022-07-23 14:28:36,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:28:36,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 47 states and 52 transitions. [2022-07-23 14:28:36,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-23 14:28:36,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-23 14:28:36,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 52 transitions. [2022-07-23 14:28:36,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:28:36,618 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-23 14:28:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 52 transitions. [2022-07-23 14:28:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-07-23 14:28:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:28:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-23 14:28:36,621 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-23 14:28:36,621 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-23 14:28:36,621 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:28:36,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2022-07-23 14:28:36,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:28:36,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:28:36,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:28:36,622 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-23 14:28:36,622 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:28:36,622 INFO L752 eck$LassoCheckResult]: Stem: 821#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 822#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem12#1, test_fun_#t~mem4#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 829#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 830#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 836#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 845#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 844#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 834#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 835#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 838#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 825#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 826#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 843#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 840#L555-1 assume !test_fun_#t~short8#1; 839#L555-3 assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1; 827#L555-6 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 828#L553-3 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 832#L553-1 assume !!(test_fun_#t~mem4#1 >= 0);havoc test_fun_#t~mem4#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 833#L555-5 [2022-07-23 14:28:36,622 INFO L754 eck$LassoCheckResult]: Loop: 833#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1; 837#L555-1 assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824; 823#L555-3 assume !!test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;call test_fun_#t~mem9#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 824#L556 assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 833#L555-5 [2022-07-23 14:28:36,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:36,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 4 times [2022-07-23 14:28:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:36,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530230073] [2022-07-23 14:28:36,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:36,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:36,635 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:36,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1450089, now seen corresponding path program 4 times [2022-07-23 14:28:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:36,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088115955] [2022-07-23 14:28:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:36,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:36,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:36,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:36,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:36,659 INFO L85 PathProgramCache]: Analyzing trace with hash -647394507, now seen corresponding path program 5 times [2022-07-23 14:28:36,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:28:36,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673181287] [2022-07-23 14:28:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:28:36,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:28:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:36,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:28:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:28:36,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:28:37,961 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:28:37,961 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:28:37,961 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:28:37,961 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:28:37,961 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:28:37,961 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:37,961 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:28:37,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:28:37,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration7_Lasso [2022-07-23 14:28:37,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:28:37,961 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:28:37,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:37,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:37,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:37,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:37,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:37,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:37,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:37,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:28:38,423 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:28:38,423 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:28:38,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,425 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) [2022-07-23 14:28:38,426 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 [2022-07-23 14:28:38,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:38,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:38,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:38,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:38,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-23 14:28:38,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,454 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) [2022-07-23 14:28:38,455 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 [2022-07-23 14:28:38,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:38,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:38,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:38,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:38,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-23 14:28:38,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,479 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:28:38,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-23 14:28:38,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:38,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:38,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:38,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-23 14:28:38,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,519 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:28:38,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-23 14:28:38,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:38,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:38,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:38,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-23 14:28:38,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,567 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:28:38,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-23 14:28:38,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:38,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:38,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:38,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:38,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-23 14:28:38,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,605 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:28:38,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-23 14:28:38,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:38,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:38,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:38,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:38,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:38,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,637 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:28:38,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-23 14:28:38,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:28:38,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:28:38,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:28:38,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:38,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:38,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,662 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) [2022-07-23 14:28:38,662 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 [2022-07-23 14:28:38,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:38,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:38,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:38,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-23 14:28:38,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,705 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) [2022-07-23 14:28:38,706 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 [2022-07-23 14:28:38,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:38,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:38,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:28:38,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-23 14:28:38,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,733 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) [2022-07-23 14:28:38,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:28:38,735 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 [2022-07-23 14:28:38,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:28:38,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:28:38,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:28:38,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:28:38,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:28:38,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:28:38,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:28:38,771 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-23 14:28:38,771 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-23 14:28:38,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:28:38,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:28:38,772 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) [2022-07-23 14:28:38,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:28:38,795 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 [2022-07-23 14:28:38,807 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:28:38,808 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:28:38,808 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3) = 2147483647*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3 - 2147483648*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3 Supporting invariants [] [2022-07-23 14:28:38,825 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 [2022-07-23 14:28:38,846 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-23 14:28:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:38,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:28:38,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:38,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 14:28:38,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:38,967 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-23 14:28:38,967 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:28:39,001 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 55 transitions. Complement of second has 11 states. [2022-07-23 14:28:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-23 14:28:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:28:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-07-23 14:28:39,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 18 letters. Loop has 4 letters. [2022-07-23 14:28:39,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:39,002 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:28:39,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:39,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:28:39,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:39,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 14:28:39,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:39,129 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-23 14:28:39,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:28:39,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 55 transitions. Complement of second has 11 states. [2022-07-23 14:28:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-23 14:28:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:28:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-07-23 14:28:39,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 18 letters. Loop has 4 letters. [2022-07-23 14:28:39,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:39,166 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:28:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:28:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:39,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:28:39,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:28:39,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 14:28:39,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:28:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:28:39,286 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-23 14:28:39,286 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:28:39,328 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 39 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 69 transitions. Complement of second has 10 states. [2022-07-23 14:28:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-23 14:28:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:28:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-07-23 14:28:39,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 18 letters. Loop has 4 letters. [2022-07-23 14:28:39,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:39,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 22 letters. Loop has 4 letters. [2022-07-23 14:28:39,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:39,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 18 letters. Loop has 8 letters. [2022-07-23 14:28:39,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:28:39,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2022-07-23 14:28:39,336 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:28:39,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 0 states and 0 transitions. [2022-07-23 14:28:39,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 14:28:39,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 14:28:39,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 14:28:39,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:28:39,337 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:28:39,337 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:28:39,337 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:28:39,337 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:28:39,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 14:28:39,337 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:28:39,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 14:28:39,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 02:28:39 BoogieIcfgContainer [2022-07-23 14:28:39,351 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 14:28:39,351 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 14:28:39,351 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 14:28:39,352 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 14:28:39,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:27:41" (3/4) ... [2022-07-23 14:28:39,354 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 14:28:39,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 14:28:39,354 INFO L158 Benchmark]: Toolchain (without parser) took 58116.42ms. Allocated memory was 111.1MB in the beginning and 195.0MB in the end (delta: 83.9MB). Free memory was 80.9MB in the beginning and 161.1MB in the end (delta: -80.2MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2022-07-23 14:28:39,354 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:28:39,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.91ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 80.7MB in the beginning and 101.5MB in the end (delta: -20.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 14:28:39,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.49ms. Allocated memory is still 134.2MB. Free memory was 101.5MB in the beginning and 99.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:28:39,364 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 [2022-07-23 14:28:39,366 INFO L158 Benchmark]: Boogie Preprocessor took 30.47ms. Allocated memory is still 134.2MB. Free memory was 99.7MB in the beginning and 98.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:28:39,366 INFO L158 Benchmark]: RCFGBuilder took 326.50ms. Allocated memory is still 134.2MB. Free memory was 98.3MB in the beginning and 87.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 14:28:39,366 INFO L158 Benchmark]: BuchiAutomizer took 57364.88ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 87.2MB in the beginning and 161.1MB in the end (delta: -73.9MB). Peak memory consumption was 96.2MB. Max. memory is 16.1GB. [2022-07-23 14:28:39,366 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 195.0MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:28:39,370 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.16ms. Allocated memory is still 111.1MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.91ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 80.7MB in the beginning and 101.5MB in the end (delta: -20.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.49ms. Allocated memory is still 134.2MB. Free memory was 101.5MB in the beginning and 99.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.47ms. Allocated memory is still 134.2MB. Free memory was 99.7MB in the beginning and 98.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.50ms. Allocated memory is still 134.2MB. Free memory was 98.3MB in the beginning and 87.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 57364.88ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 87.2MB in the beginning and 161.1MB in the end (delta: -73.9MB). Peak memory consumption was 96.2MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 195.0MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 4 locations. One deterministic module has affine ranking function 2147483647 + -2 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. One nondeterministic module has affine ranking function -2147483648 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 30 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 57.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 7.6s. Construction of modules took 0.2s. Büchi inclusion checks took 49.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 131 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 55 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital282 mio100 ax106 hnf100 lsp89 ukn55 mio100 lsp35 div100 bol100 ite100 ukn100 eq170 hnf89 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-23 14:28:39,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:39,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-23 14:28:39,801 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE