./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.18-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/b.18-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 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:27:34,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:27:34,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:27:34,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:27:34,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:27:34,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:27:34,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:27:34,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:27:34,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:27:34,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:27:34,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:27:34,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:27:34,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:27:34,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:27:34,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:27:34,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:27:34,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:27:34,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:27:34,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:27:34,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:27:34,173 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:27:34,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:27:34,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:27:34,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:27:34,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:27:34,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:27:34,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:27:34,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:27:34,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:27:34,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:27:34,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:27:34,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:27:34,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:27:34,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:27:34,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:27:34,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:27:34,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:27:34,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:27:34,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:27:34,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:27:34,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:27:34,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:27:34,189 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:34,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:27:34,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:27:34,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:27:34,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:27:34,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:27:34,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:27:34,221 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:27:34,221 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:27:34,222 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:27:34,222 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:27:34,222 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:27:34,223 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:27:34,223 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:27:34,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:27:34,223 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:27:34,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:27:34,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:27:34,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:27:34,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:27:34,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:27:34,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:27:34,225 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:27:34,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:27:34,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:27:34,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:27:34,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:27:34,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:27:34,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:27:34,228 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:27:34,228 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 -> 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff [2022-07-23 14:27:34,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:27:34,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:27:34,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:27:34,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:27:34,456 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:27:34,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2022-07-23 14:27:34,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f35487cb/ba0e0c39d1d341f284662261c6ef8874/FLAGe18d763d6 [2022-07-23 14:27:34,934 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:27:34,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2022-07-23 14:27:34,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f35487cb/ba0e0c39d1d341f284662261c6ef8874/FLAGe18d763d6 [2022-07-23 14:27:35,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f35487cb/ba0e0c39d1d341f284662261c6ef8874 [2022-07-23 14:27:35,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:27:35,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:27:35,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:27:35,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:27:35,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:27:35,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:27:35" (1/1) ... [2022-07-23 14:27:35,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a629585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:35, skipping insertion in model container [2022-07-23 14:27:35,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:27:35" (1/1) ... [2022-07-23 14:27:35,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:27:35,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:27:35,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:27:35,621 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:27:35,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:27:35,675 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:27:35,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:35 WrapperNode [2022-07-23 14:27:35,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:27:35,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:27:35,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:27:35,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:27:35,684 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:35" (1/1) ... [2022-07-23 14:27:35,699 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:35" (1/1) ... [2022-07-23 14:27:35,721 INFO L137 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2022-07-23 14:27:35,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:27:35,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:27:35,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:27:35,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:27:35,728 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:35" (1/1) ... [2022-07-23 14:27:35,728 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:35" (1/1) ... [2022-07-23 14:27:35,742 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:35" (1/1) ... [2022-07-23 14:27:35,742 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:35" (1/1) ... [2022-07-23 14:27:35,756 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:35" (1/1) ... [2022-07-23 14:27:35,759 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:35" (1/1) ... [2022-07-23 14:27:35,768 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:35" (1/1) ... [2022-07-23 14:27:35,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:27:35,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:27:35,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:27:35,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:27:35,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:35" (1/1) ... [2022-07-23 14:27:35,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:35,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:35,803 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:35,842 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:35,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:27:35,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:27:35,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:27:35,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:27:35,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:27:35,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:27:35,956 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:27:35,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:27:36,158 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:27:36,167 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:27:36,169 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 14:27:36,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:27:36 BoogieIcfgContainer [2022-07-23 14:27:36,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:27:36,172 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:27:36,172 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:27:36,175 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:27:36,175 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:27:36,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:27:35" (1/3) ... [2022-07-23 14:27:36,176 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@370cd75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:27:36, skipping insertion in model container [2022-07-23 14:27:36,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:27:36,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:27:35" (2/3) ... [2022-07-23 14:27:36,177 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@370cd75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:27:36, skipping insertion in model container [2022-07-23 14:27:36,177 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:27:36,177 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:27:36" (3/3) ... [2022-07-23 14:27:36,178 INFO L354 chiAutomizerObserver]: Analyzing ICFG b.18-alloca.i [2022-07-23 14:27:36,227 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:27:36,227 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:27:36,228 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:27:36,228 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:27:36,228 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:27:36,228 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:27:36,228 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:27:36,228 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:27:36,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:36,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 14:27:36,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:36,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:36,254 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:36,255 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-23 14:27:36,255 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:27:36,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:36,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 14:27:36,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:36,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:36,258 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:36,258 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-23 14:27:36,263 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 12#L559-4true [2022-07-23 14:27:36,265 INFO L754 eck$LassoCheckResult]: Loop: 12#L559-4true call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 11#L553-1true assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 6#L553-3true assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17#L554true assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 5#L555-3true assume !true; 12#L559-4true [2022-07-23 14:27:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 14:27:36,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:36,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469832237] [2022-07-23 14:27:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:36,393 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:36,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash 35409690, now seen corresponding path program 1 times [2022-07-23 14:27:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:36,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556384331] [2022-07-23 14:27:36,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:36,520 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:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:36,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556384331] [2022-07-23 14:27:36,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556384331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:27:36,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:27:36,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-23 14:27:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882327020] [2022-07-23 14:27:36,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:27:36,524 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:27:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:36,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 14:27:36,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 14:27:36,549 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:36,555 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-07-23 14:27:36,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 14:27:36,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2022-07-23 14:27:36,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 14:27:36,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 14 transitions. [2022-07-23 14:27:36,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-23 14:27:36,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-23 14:27:36,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2022-07-23 14:27:36,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:27:36,565 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2022-07-23 14:27:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2022-07-23 14:27:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-23 14:27:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2022-07-23 14:27:36,582 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2022-07-23 14:27:36,582 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2022-07-23 14:27:36,583 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:27:36,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2022-07-23 14:27:36,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 14:27:36,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:36,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:36,585 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:36,585 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:27:36,585 INFO L752 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 43#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 50#L559-4 [2022-07-23 14:27:36,585 INFO L754 eck$LassoCheckResult]: Loop: 50#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 51#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 46#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 47#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 48#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 49#L559-1 assume !(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1; 50#L559-4 [2022-07-23 14:27:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-23 14:27:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:36,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826765227] [2022-07-23 14:27:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:36,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:36,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1097715097, now seen corresponding path program 1 times [2022-07-23 14:27:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:36,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408486617] [2022-07-23 14:27:36,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:36,719 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:36,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:36,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408486617] [2022-07-23 14:27:36,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408486617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:27:36,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:27:36,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:27:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572527113] [2022-07-23 14:27:36,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:27:36,724 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:27:36,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:27:36,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:27:36,729 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand has 5 states, 4 states have (on average 1.5) 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:36,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:36,777 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-07-23 14:27:36,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:27:36,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2022-07-23 14:27:36,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-07-23 14:27:36,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2022-07-23 14:27:36,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 14:27:36,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 14:27:36,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2022-07-23 14:27:36,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:27:36,782 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-23 14:27:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2022-07-23 14:27:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2022-07-23 14:27:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:27:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-07-23 14:27:36,784 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-23 14:27:36,784 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-23 14:27:36,784 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:27:36,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-07-23 14:27:36,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-07-23 14:27:36,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:36,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:36,786 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:36,786 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:27:36,787 INFO L752 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 80#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 89#L559-4 [2022-07-23 14:27:36,787 INFO L754 eck$LassoCheckResult]: Loop: 89#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 88#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 83#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 84#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 81#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 82#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 89#L559-4 [2022-07-23 14:27:36,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:36,787 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-23 14:27:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:36,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928493097] [2022-07-23 14:27:36,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:36,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:36,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1097700202, now seen corresponding path program 1 times [2022-07-23 14:27:36,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:36,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233986765] [2022-07-23 14:27:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:36,889 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:36,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:36,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233986765] [2022-07-23 14:27:36,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233986765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:27:36,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:27:36,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:27:36,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282402893] [2022-07-23 14:27:36,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:27:36,890 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:27:36,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:36,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:27:36,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:27:36,890 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:36,926 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-07-23 14:27:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:27:36,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-07-23 14:27:36,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-23 14:27:36,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-07-23 14:27:36,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-23 14:27:36,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-23 14:27:36,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-07-23 14:27:36,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:27:36,929 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-23 14:27:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-07-23 14:27:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-07-23 14:27:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2022-07-23 14:27:36,930 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-07-23 14:27:36,930 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-07-23 14:27:36,930 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:27:36,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2022-07-23 14:27:36,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-23 14:27:36,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:36,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:36,931 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:36,931 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-23 14:27:36,931 INFO L752 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 125#L559-4 [2022-07-23 14:27:36,932 INFO L754 eck$LassoCheckResult]: Loop: 125#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 126#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 120#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 121#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 118#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 119#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 127#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 129#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 125#L559-4 [2022-07-23 14:27:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-23 14:27:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:36,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035404001] [2022-07-23 14:27:36,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:36,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:36,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:36,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:36,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1672057937, now seen corresponding path program 1 times [2022-07-23 14:27:36,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:36,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054876887] [2022-07-23 14:27:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:37,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:37,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054876887] [2022-07-23 14:27:37,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054876887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:27:37,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288082090] [2022-07-23 14:27:37,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:37,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:27:37,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:37,035 INFO L229 MonitoredProcess]: Starting monitored process 2 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:37,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 14:27:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:37,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 14:27:37,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:37,249 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-23 14:27:37,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2022-07-23 14:27:37,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 14:27:37,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 67 [2022-07-23 14:27:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:37,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:27:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:27:37,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288082090] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:27:37,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:27:37,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-07-23 14:27:37,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607471742] [2022-07-23 14:27:37,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:27:37,500 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:27:37,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:37,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 14:27:37,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-23 14:27:37,501 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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:27:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:37,528 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-07-23 14:27:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:27:37,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2022-07-23 14:27:37,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-07-23 14:27:37,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2022-07-23 14:27:37,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-23 14:27:37,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-23 14:27:37,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2022-07-23 14:27:37,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:27:37,532 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-23 14:27:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2022-07-23 14:27:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-23 14:27:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-07-23 14:27:37,536 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-07-23 14:27:37,536 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-07-23 14:27:37,537 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:27:37,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2022-07-23 14:27:37,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-07-23 14:27:37,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:37,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:37,538 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:37,539 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-23 14:27:37,539 INFO L752 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 218#L559-4 [2022-07-23 14:27:37,539 INFO L754 eck$LassoCheckResult]: Loop: 218#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 219#L553-1 assume !test_fun_#t~short6#1; 213#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 214#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 211#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 212#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 224#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 223#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 218#L559-4 [2022-07-23 14:27:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-23 14:27:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:37,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244602540] [2022-07-23 14:27:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:37,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:37,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:37,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:37,578 INFO L85 PathProgramCache]: Analyzing trace with hash 102949425, now seen corresponding path program 1 times [2022-07-23 14:27:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:37,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539400948] [2022-07-23 14:27:37,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:37,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 14:27:37,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:37,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539400948] [2022-07-23 14:27:37,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539400948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:27:37,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:27:37,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:27:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833636970] [2022-07-23 14:27:37,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:27:37,603 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:27:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:37,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:27:37,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:27:37,604 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:37,611 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-07-23 14:27:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:27:37,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2022-07-23 14:27:37,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-23 14:27:37,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2022-07-23 14:27:37,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-23 14:27:37,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-23 14:27:37,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-07-23 14:27:37,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:27:37,615 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-23 14:27:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-07-23 14:27:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-23 14:27:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-07-23 14:27:37,617 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-23 14:27:37,617 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-23 14:27:37,618 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:27:37,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-07-23 14:27:37,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-23 14:27:37,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:37,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:37,623 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:27:37,624 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-23 14:27:37,624 INFO L752 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 259#L559-4 [2022-07-23 14:27:37,624 INFO L754 eck$LassoCheckResult]: Loop: 259#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 260#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 254#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 255#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 256#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 257#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 258#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 262#L559-1 assume !(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1; 259#L559-4 [2022-07-23 14:27:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-23 14:27:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:37,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447655051] [2022-07-23 14:27:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:37,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:37,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:37,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1657743362, now seen corresponding path program 1 times [2022-07-23 14:27:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:37,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191622050] [2022-07-23 14:27:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:37,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:37,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash -967181888, now seen corresponding path program 1 times [2022-07-23 14:27:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:37,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108285203] [2022-07-23 14:27:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:37,693 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:37,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:38,152 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:27:38,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:27:38,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:27:38,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:27:38,153 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:27:38,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:38,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:27:38,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:27:38,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration6_Lasso [2022-07-23 14:27:38,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:27:38,154 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:27:38,166 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:38,383 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:38,385 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:38,386 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:38,389 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:38,391 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:38,393 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:38,395 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:38,397 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:38,399 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:38,401 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:38,402 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:38,404 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:38,406 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:38,408 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:38,409 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:38,411 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:38,412 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:38,414 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:38,416 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:38,418 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:38,420 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:38,422 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:38,423 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:38,758 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:27:38,761 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:27:38,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:38,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:38,773 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:38,774 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:38,808 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:38,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:38,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:38,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:38,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:38,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:38,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:38,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:38,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:38,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:38,860 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:38,861 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:38,862 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:38,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:38,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:38,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:38,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:38,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:38,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:38,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:38,910 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:38,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:38,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:38,912 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:38,913 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:38,914 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:38,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:38,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:38,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:38,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:38,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:38,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:38,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:27:39,016 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-23 14:27:39,017 INFO L444 ModelExtractionUtils]: 11 out of 28 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-07-23 14:27:39,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:39,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:39,031 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:39,032 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:39,033 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:27:39,061 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:27:39,061 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:27:39,061 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)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1 Supporting invariants [] [2022-07-23 14:27:39,086 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:39,104 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-23 14:27:39,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:39,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:27:39,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:39,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:27:39,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:39,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 14:27:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 14:27:39,218 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:27:39,218 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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:39,306 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 40 states and 48 transitions. Complement of second has 10 states. [2022-07-23 14:27:39,306 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:27:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-07-23 14:27:39,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2022-07-23 14:27:39,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:39,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2022-07-23 14:27:39,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:39,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2022-07-23 14:27:39,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:39,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2022-07-23 14:27:39,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-07-23 14:27:39,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 46 transitions. [2022-07-23 14:27:39,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-23 14:27:39,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-23 14:27:39,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2022-07-23 14:27:39,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:27:39,316 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-23 14:27:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2022-07-23 14:27:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-07-23 14:27:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-23 14:27:39,319 INFO L392 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-23 14:27:39,319 INFO L374 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-23 14:27:39,320 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:27:39,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2022-07-23 14:27:39,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-07-23 14:27:39,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:39,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:39,322 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-23 14:27:39,322 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1] [2022-07-23 14:27:39,323 INFO L752 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 415#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 433#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 431#L553-1 [2022-07-23 14:27:39,323 INFO L754 eck$LassoCheckResult]: Loop: 431#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 420#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 421#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 416#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 417#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 434#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 443#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 442#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 441#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 428#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 431#L553-1 [2022-07-23 14:27:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-07-23 14:27:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:39,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373193232] [2022-07-23 14:27:39,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:39,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:39,339 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:39,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1479493138, now seen corresponding path program 2 times [2022-07-23 14:27:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:39,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070784963] [2022-07-23 14:27:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:39,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:39,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:39,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:39,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:39,387 INFO L85 PathProgramCache]: Analyzing trace with hash 376307409, now seen corresponding path program 1 times [2022-07-23 14:27:39,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:39,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807387324] [2022-07-23 14:27:39,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:39,427 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:39,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:39,795 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:39,930 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:27:39,930 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:27:39,930 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:27:39,930 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:27:39,931 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:27:39,931 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:39,931 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:27:39,931 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:27:39,931 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration7_Lasso [2022-07-23 14:27:39,931 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:27:39,931 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:27:39,933 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:39,936 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:39,937 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:40,209 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:40,211 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:40,212 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:40,214 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:40,216 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:40,218 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:40,220 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:40,222 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:40,223 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:40,225 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:40,226 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:40,229 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:40,231 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:40,233 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:40,234 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:40,237 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:40,239 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:40,241 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:40,242 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:40,561 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:27:40,561 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:27:40,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:40,562 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:40,563 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:40,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:40,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:40,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:40,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:40,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:40,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:40,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:40,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:40,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:40,616 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:40,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:40,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:40,618 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:40,619 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:40,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:40,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:40,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:40,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:40,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:40,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:40,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:40,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:40,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:40,662 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:40,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:40,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:40,672 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:40,673 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:40,674 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:40,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:40,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:40,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:40,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:40,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:40,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:40,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:40,717 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:40,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:40,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:40,718 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:40,747 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:40,748 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:40,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:40,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:40,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:40,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:40,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:40,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:40,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:40,796 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:40,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:40,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:40,797 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:40,799 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:40,800 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:40,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:40,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:40,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:40,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:40,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:40,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:40,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:40,850 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:40,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:40,851 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:40,852 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:40,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:40,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:40,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:40,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:40,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:40,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:40,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:40,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:40,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:40,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:40,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:40,901 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:40,902 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:40,907 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:40,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:40,915 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-23 14:27:40,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:40,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:40,926 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-23 14:27:40,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:40,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:27:40,980 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-23 14:27:40,981 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-23 14:27:40,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:40,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:40,984 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:40,986 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:40,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:27:40,999 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:27:40,999 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:27:40,999 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite ULTIMATE.start_test_fun_#t~short6#1 1 0)_2) = 1*v_rep(ite ULTIMATE.start_test_fun_#t~short6#1 1 0)_2 Supporting invariants [] [2022-07-23 14:27:41,016 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:41,043 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-23 14:27:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:41,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:27:41,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:41,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:27:41,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 14:27:41,139 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:27:41,140 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:41,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) Result 66 states and 81 transitions. Complement of second has 8 states. [2022-07-23 14:27:41,192 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:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-07-23 14:27:41,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 3 letters. Loop has 10 letters. [2022-07-23 14:27:41,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:41,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 13 letters. Loop has 10 letters. [2022-07-23 14:27:41,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:41,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 3 letters. Loop has 20 letters. [2022-07-23 14:27:41,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:41,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 81 transitions. [2022-07-23 14:27:41,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:27:41,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 58 states and 72 transitions. [2022-07-23 14:27:41,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 14:27:41,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-23 14:27:41,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 72 transitions. [2022-07-23 14:27:41,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:27:41,200 INFO L369 hiAutomatonCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-07-23 14:27:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 72 transitions. [2022-07-23 14:27:41,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-07-23 14:27:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 52 states have internal predecessors, (67), 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:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-07-23 14:27:41,203 INFO L392 hiAutomatonCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-07-23 14:27:41,203 INFO L374 stractBuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-07-23 14:27:41,203 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:27:41,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions. [2022-07-23 14:27:41,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:27:41,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:41,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:41,204 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:27:41,204 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:27:41,204 INFO L752 eck$LassoCheckResult]: Stem: 621#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 622#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 639#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 659#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 627#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 628#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 623#L555-3 [2022-07-23 14:27:41,204 INFO L754 eck$LassoCheckResult]: Loop: 623#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 624#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 623#L555-3 [2022-07-23 14:27:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2022-07-23 14:27:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:41,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115845077] [2022-07-23 14:27:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:41,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:41,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2022-07-23 14:27:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:41,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384224494] [2022-07-23 14:27:41,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:41,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:41,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:41,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash 177749422, now seen corresponding path program 1 times [2022-07-23 14:27:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:41,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113367629] [2022-07-23 14:27:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:41,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:41,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:41,561 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:27:41,561 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:27:41,561 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:27:41,561 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:27:41,561 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:27:41,561 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:41,561 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:27:41,561 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:27:41,561 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration8_Lasso [2022-07-23 14:27:41,561 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:27:41,561 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:27:41,562 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:41,564 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:41,565 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:41,568 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:41,570 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:41,572 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:41,574 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:41,576 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:41,577 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:41,579 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:41,580 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:41,582 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:41,583 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:41,585 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:41,587 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:41,588 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:41,590 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:41,738 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:41,742 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:41,743 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:41,744 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:41,745 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:41,747 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:41,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-23 14:27:42,008 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:27:42,009 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:27:42,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,010 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:42,016 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:42,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,026 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:42,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,054 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:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,055 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:42,056 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:42,057 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:42,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,086 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:42,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,087 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:42,088 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:42,090 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:42,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,113 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:42,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,119 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:42,120 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:42,120 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:42,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:42,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:42,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,146 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:42,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,147 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:42,148 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:42,149 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:42,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,173 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:42,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,174 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:42,176 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:42,177 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:42,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-23 14:27:42,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,208 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:42,209 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:42,210 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:42,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,237 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:42,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,238 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:42,239 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:42,241 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:42,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:42,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:42,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,279 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:42,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,280 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:42,281 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:42,282 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:42,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-23 14:27:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,307 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:42,308 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:42,309 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:42,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,333 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:42,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,334 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:42,335 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:42,336 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:42,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:42,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:42,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-23 14:27:42,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,373 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:42,374 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:42,379 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:42,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-23 14:27:42,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,424 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:42,426 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:42,427 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:42,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,466 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:42,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,468 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:42,474 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:42,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-23 14:27:42,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-23 14:27:42,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,506 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:42,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-23 14:27:42,508 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:42,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:42,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:42,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:42,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-23 14:27:42,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,540 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:27:42,540 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:27:42,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:42,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:42,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:42,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:42,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,568 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:27:42,568 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:27:42,570 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:42,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:42,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:42,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:42,628 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:27:42,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,629 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:27:42,638 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:27:42,638 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:42,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:42,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:42,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:42,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:42,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:42,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:42,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:27:42,668 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-23 14:27:42,668 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. [2022-07-23 14:27:42,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:42,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:42,669 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:27:42,670 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:27:42,671 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:27:42,678 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:27:42,678 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:27:42,678 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) = 1*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 Supporting invariants [] [2022-07-23 14:27:42,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:42,709 INFO L293 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-07-23 14:27:42,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:42,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:27:42,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:42,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:27:42,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:42,763 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,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:27:42,763 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:42,803 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 149 states and 188 transitions. Complement of second has 6 states. [2022-07-23 14:27:42,803 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:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-07-23 14:27:42,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-23 14:27:42,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:42,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-23 14:27:42,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:42,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-23 14:27:42,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:42,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2022-07-23 14:27:42,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:27:42,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 56 states and 67 transitions. [2022-07-23 14:27:42,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-23 14:27:42,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-23 14:27:42,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2022-07-23 14:27:42,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:27:42,806 INFO L369 hiAutomatonCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-07-23 14:27:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2022-07-23 14:27:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2022-07-23 14:27:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-23 14:27:42,808 INFO L392 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-23 14:27:42,808 INFO L374 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-23 14:27:42,808 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 14:27:42,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2022-07-23 14:27:42,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:27:42,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:42,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:42,809 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:27:42,809 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:27:42,809 INFO L752 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 903#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 914#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 916#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 925#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 924#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 923#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 922#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 920#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 909#L559-1 [2022-07-23 14:27:42,809 INFO L754 eck$LassoCheckResult]: Loop: 909#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 908#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 909#L559-1 [2022-07-23 14:27:42,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1215726572, now seen corresponding path program 1 times [2022-07-23 14:27:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627958503] [2022-07-23 14:27:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,827 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 1 times [2022-07-23 14:27:42,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207393533] [2022-07-23 14:27:42,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash 82132647, now seen corresponding path program 2 times [2022-07-23 14:27:42,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:42,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390233314] [2022-07-23 14:27:42,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:42,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,849 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:42,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:43,314 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:27:43,314 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:27:43,314 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:27:43,314 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:27:43,314 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:27:43,314 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,314 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:27:43,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:27:43,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration9_Lasso [2022-07-23 14:27:43,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:27:43,315 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:27:43,316 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,318 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,320 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,321 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,323 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,324 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,328 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,330 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,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:43,517 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,519 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,520 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,522 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,524 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,525 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,529 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,530 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,532 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,534 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,535 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,537 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,766 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:27:43,767 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:27:43,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,768 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:27:43,774 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:27:43,775 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,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:43,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,812 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:27:43,813 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:27:43,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,843 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:27:43,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,845 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:27:43,846 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:27:43,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:43,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:43,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-23 14:27:43,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,882 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:27:43,883 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:27:43,884 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,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,909 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:27:43,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,910 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:27:43,911 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:27:43,913 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,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,938 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:27:43,939 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:27:43,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:27:43,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:43,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:43,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:43,978 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:27:43,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:43,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:43,980 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:27:43,983 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:27:43,984 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,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:43,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:43,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:43,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:43,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:43,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:43,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:43,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-23 14:27:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,007 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-23 14:27:44,009 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,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:44,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:44,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:44,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-23 14:27:44,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,035 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-23 14:27:44,037 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,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:27:44,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:27:44,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:27:44,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:44,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,063 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-23 14:27:44,065 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,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:44,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:44,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,090 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-23 14:27:44,092 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,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,101 INFO L402 nArgumentSynthesizer]: A total of 2 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,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [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,122 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-23 14:27:44,124 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 L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:44,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:27:44,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-23 14:27:44,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,170 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-23 14:27:44,172 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,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:27:44,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:27:44,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:27:44,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:27:44,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,179 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,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-23 14:27:44,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,200 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [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 (47)] Waiting until timeout for monitored process [2022-07-23 14:27:44,201 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 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,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:27:44,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:27:44,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:27:44,248 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-07-23 14:27:44,248 INFO L444 ModelExtractionUtils]: 8 out of 31 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-07-23 14:27:44,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:27:44,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:27:44,253 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:27:44,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-23 14:27:44,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:27:44,264 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 14:27:44,265 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:27:44,265 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem11#1) = 1*ULTIMATE.start_test_fun_#t~mem11#1 Supporting invariants [1*ULTIMATE.start_test_fun_#t~mem11#1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_4 >= 0] [2022-07-23 14:27:44,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:44,308 INFO L293 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2022-07-23 14:27:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:44,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 14:27:44,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:44,355 WARN L261 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 14:27:44,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:27:44,365 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:27:44,375 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,376 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:27:44,376 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:44,399 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Result 61 states and 76 transitions. Complement of second has 5 states. [2022-07-23 14:27:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-23 14:27:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-07-23 14:27:44,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-23 14:27:44,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:44,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-23 14:27:44,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:44,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-23 14:27:44,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:27:44,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2022-07-23 14:27:44,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:27:44,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 54 states and 66 transitions. [2022-07-23 14:27:44,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-23 14:27:44,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-07-23 14:27:44,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2022-07-23 14:27:44,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:27:44,411 INFO L369 hiAutomatonCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-07-23 14:27:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2022-07-23 14:27:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2022-07-23 14:27:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:27:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-07-23 14:27:44,421 INFO L392 hiAutomatonCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-07-23 14:27:44,421 INFO L374 stractBuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-07-23 14:27:44,421 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-23 14:27:44,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 57 transitions. [2022-07-23 14:27:44,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:27:44,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:27:44,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:27:44,422 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-23 14:27:44,422 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:27:44,422 INFO L752 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1097#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#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~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#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); 1108#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 1110#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 1141#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1113#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 1105#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1106#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1107#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1115#L559-1 assume !(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1; 1121#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 1120#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 1119#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1118#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 1117#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1116#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1114#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1104#L559-1 [2022-07-23 14:27:44,422 INFO L754 eck$LassoCheckResult]: Loop: 1104#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1103#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1104#L559-1 [2022-07-23 14:27:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2055714993, now seen corresponding path program 2 times [2022-07-23 14:27:44,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:44,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058620425] [2022-07-23 14:27:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:27:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 14:27:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:27:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058620425] [2022-07-23 14:27:44,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058620425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:27:44,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:27:44,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:27:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837713824] [2022-07-23 14:27:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:27:44,477 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:27:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:27:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 2 times [2022-07-23 14:27:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:27:44,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966891414] [2022-07-23 14:27:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:27:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:27:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:44,480 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:27:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:27:44,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:27:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:27:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:27:44,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:27:44,504 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. cyclomatic complexity: 14 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:27:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:27:44,531 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-07-23 14:27:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:27:44,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2022-07-23 14:27:44,534 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:27:44,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2022-07-23 14:27:44,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 14:27:44,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 14:27:44,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 14:27:44,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:27:44,535 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:27:44,535 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:27:44,535 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:27:44,535 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-23 14:27:44,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 14:27:44,535 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:27:44,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 14:27:44,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 02:27:44 BoogieIcfgContainer [2022-07-23 14:27:44,540 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 14:27:44,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 14:27:44,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 14:27:44,541 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 14:27:44,541 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:36" (3/4) ... [2022-07-23 14:27:44,545 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 14:27:44,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 14:27:44,546 INFO L158 Benchmark]: Toolchain (without parser) took 9233.57ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 79.4MB in the beginning and 64.5MB in the end (delta: 15.0MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2022-07-23 14:27:44,546 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:27:44,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.69ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 79.1MB in the beginning and 100.6MB in the end (delta: -21.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 14:27:44,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.87ms. Allocated memory is still 132.1MB. Free memory was 100.6MB in the beginning and 98.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:27:44,547 INFO L158 Benchmark]: Boogie Preprocessor took 47.03ms. Allocated memory is still 132.1MB. Free memory was 98.9MB in the beginning and 97.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:27:44,547 INFO L158 Benchmark]: RCFGBuilder took 400.82ms. Allocated memory is still 132.1MB. Free memory was 97.6MB in the beginning and 85.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 14:27:44,547 INFO L158 Benchmark]: BuchiAutomizer took 8368.61ms. Allocated memory was 132.1MB in the beginning and 192.9MB in the end (delta: 60.8MB). Free memory was 85.4MB in the beginning and 64.5MB in the end (delta: 20.9MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. [2022-07-23 14:27:44,547 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 192.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:27:44,549 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 109.1MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.69ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 79.1MB in the beginning and 100.6MB in the end (delta: -21.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.87ms. Allocated memory is still 132.1MB. Free memory was 100.6MB in the beginning and 98.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.03ms. Allocated memory is still 132.1MB. Free memory was 98.9MB in the beginning and 97.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.82ms. Allocated memory is still 132.1MB. Free memory was 97.6MB in the beginning and 85.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 8368.61ms. Allocated memory was 132.1MB in the beginning and 192.9MB in the end (delta: 60.8MB). Free memory was 85.4MB in the beginning and 64.5MB in the end (delta: 20.9MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 192.9MB. Free memory is still 64.5MB. 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 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function (if aux-(*x_ref > 0) && (*y_ref > 0)-aux then 1 else 0) and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5bb2e142 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 7.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 116 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax109 hnf100 lsp87 ukn69 mio100 lsp35 div100 bol103 ite100 ukn100 eq180 hnf89 smp96 dnf111 smp100 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 99ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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:27:44,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-23 14:27:44,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 14:27:44,994 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