./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:51:09,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:51:09,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:51:09,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:51:09,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:51:09,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:51:09,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:51:09,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:51:09,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:51:09,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:51:09,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:51:09,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:51:09,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:51:09,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:51:09,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:51:09,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:51:09,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:51:09,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:51:09,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:51:09,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:51:09,210 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:51:09,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:51:09,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:51:09,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:51:09,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:51:09,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:51:09,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:51:09,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:51:09,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:51:09,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:51:09,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:51:09,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:51:09,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:51:09,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:51:09,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:51:09,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:51:09,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:51:09,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:51:09,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:51:09,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:51:09,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:51:09,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:51:09,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:51:09,251 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:51:09,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:51:09,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:51:09,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:51:09,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:51:09,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:51:09,254 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:51:09,254 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:51:09,254 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:51:09,255 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:51:09,255 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:51:09,263 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:51:09,263 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:51:09,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:51:09,263 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:51:09,263 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:51:09,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:51:09,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:51:09,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:51:09,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:51:09,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:51:09,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:51:09,264 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:51:09,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:51:09,264 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:51:09,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:51:09,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:51:09,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:51:09,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:51:09,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:51:09,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:51:09,266 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:51:09,267 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac [2022-07-13 04:51:09,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:51:09,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:51:09,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:51:09,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:51:09,493 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:51:09,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2022-07-13 04:51:09,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f0bbbc9a/b2565513b7ec4e3c94ef09ef9a145f0f/FLAG11d412548 [2022-07-13 04:51:09,887 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:51:09,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2022-07-13 04:51:09,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f0bbbc9a/b2565513b7ec4e3c94ef09ef9a145f0f/FLAG11d412548 [2022-07-13 04:51:09,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f0bbbc9a/b2565513b7ec4e3c94ef09ef9a145f0f [2022-07-13 04:51:09,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:51:09,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:51:09,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:51:09,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:51:09,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:51:09,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:51:09" (1/1) ... [2022-07-13 04:51:09,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e33a20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:09, skipping insertion in model container [2022-07-13 04:51:09,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:51:09" (1/1) ... [2022-07-13 04:51:09,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:51:09,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:51:10,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i[1298,1311] [2022-07-13 04:51:10,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:51:10,052 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:51:10,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i[1298,1311] [2022-07-13 04:51:10,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:51:10,076 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:51:10,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10 WrapperNode [2022-07-13 04:51:10,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:51:10,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:51:10,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:51:10,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:51:10,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,113 INFO L137 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-07-13 04:51:10,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:51:10,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:51:10,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:51:10,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:51:10,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:51:10,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:51:10,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:51:10,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:51:10,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (1/1) ... [2022-07-13 04:51:10,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:10,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:10,174 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-13 04:51:10,175 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-13 04:51:10,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:51:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:51:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:51:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:51:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:51:10,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:51:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:51:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:51:10,251 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:51:10,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:51:10,452 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:51:10,458 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:51:10,459 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:51:10,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:51:10 BoogieIcfgContainer [2022-07-13 04:51:10,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:51:10,462 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:51:10,462 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:51:10,464 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:51:10,465 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:51:10,465 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:51:09" (1/3) ... [2022-07-13 04:51:10,465 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@267b96af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:51:10, skipping insertion in model container [2022-07-13 04:51:10,465 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:51:10,465 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:10" (2/3) ... [2022-07-13 04:51:10,466 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@267b96af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:51:10, skipping insertion in model container [2022-07-13 04:51:10,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:51:10,466 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:51:10" (3/3) ... [2022-07-13 04:51:10,467 INFO L354 chiAutomizerObserver]: Analyzing ICFG sep.i [2022-07-13 04:51:10,502 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:51:10,502 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:51:10,502 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:51:10,502 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:51:10,503 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:51:10,503 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:51:10,503 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:51:10,503 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:51:10,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:10,525 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-13 04:51:10,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:10,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:10,530 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 04:51:10,530 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:51:10,531 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:51:10,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:10,535 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-13 04:51:10,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:10,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:10,536 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 04:51:10,536 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:51:10,541 INFO L752 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 20#L34true assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 22#L20-3true [2022-07-13 04:51:10,542 INFO L754 eck$LassoCheckResult]: Loop: 22#L20-3true assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 14#L22true assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 15#L20-2true sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 22#L20-3true [2022-07-13 04:51:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-13 04:51:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:10,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304843792] [2022-07-13 04:51:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:10,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:10,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash 42800, now seen corresponding path program 1 times [2022-07-13 04:51:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:10,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896230550] [2022-07-13 04:51:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:10,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:10,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash 889512687, now seen corresponding path program 1 times [2022-07-13 04:51:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:10,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229873893] [2022-07-13 04:51:10,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:10,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:10,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:10,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:11,292 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:51:11,293 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:51:11,293 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:51:11,293 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:51:11,294 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:51:11,294 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:11,294 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:51:11,294 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:51:11,294 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration1_Lasso [2022-07-13 04:51:11,295 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:51:11,295 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:51:11,307 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-13 04:51:11,312 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-13 04:51:11,314 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-13 04:51:11,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-13 04:51:11,319 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-13 04:51:11,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-13 04:51:11,594 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-13 04:51:11,596 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-13 04:51:11,598 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-13 04:51:11,599 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-13 04:51:11,601 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-13 04:51:11,603 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-13 04:51:11,605 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-13 04:51:11,607 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-13 04:51:11,610 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-13 04:51:11,611 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-13 04:51:11,613 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-13 04:51:11,615 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-13 04:51:11,617 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-13 04:51:11,618 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-13 04:51:11,620 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-13 04:51:11,621 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-13 04:51:11,623 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-13 04:51:11,625 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-13 04:51:11,962 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:51:11,965 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:51:11,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:11,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:11,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:11,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 04:51:11,976 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-13 04:51:11,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:11,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:11,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:11,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:11,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:11,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:11,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:12,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-13 04:51:12,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,018 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-13 04:51:12,019 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-13 04:51:12,024 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-13 04:51:12,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:12,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:12,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:12,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,054 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-13 04:51:12,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,056 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-13 04:51:12,057 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-13 04:51:12,060 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-13 04:51:12,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:12,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:12,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:12,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,095 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-13 04:51:12,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,097 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-13 04:51:12,098 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-13 04:51:12,099 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-13 04:51:12,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,147 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-13 04:51:12,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,150 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-13 04:51:12,151 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-13 04:51:12,152 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-13 04:51:12,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:12,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:12,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:12,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-13 04:51:12,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,181 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-13 04:51:12,182 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-13 04:51:12,184 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-13 04:51:12,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,225 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-13 04:51:12,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,228 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-13 04:51:12,231 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-13 04:51:12,231 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-13 04:51:12,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,284 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-13 04:51:12,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,286 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-13 04:51:12,286 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-13 04:51:12,288 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-13 04:51:12,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,322 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-13 04:51:12,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,324 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-13 04:51:12,325 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-13 04:51:12,326 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-13 04:51:12,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,363 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-13 04:51:12,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,369 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-13 04:51:12,369 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-13 04:51:12,372 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-13 04:51:12,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-13 04:51:12,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,405 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-13 04:51:12,408 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-13 04:51:12,409 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-13 04:51:12,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,459 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-13 04:51:12,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,461 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-13 04:51:12,462 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-13 04:51:12,463 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-13 04:51:12,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,502 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-13 04:51:12,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,504 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-13 04:51:12,505 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-13 04:51:12,507 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-13 04:51:12,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:12,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,556 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-13 04:51:12,557 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-13 04:51:12,558 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-13 04:51:12,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,604 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-13 04:51:12,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,606 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-13 04:51:12,607 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-13 04:51:12,608 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-13 04:51:12,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,643 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-13 04:51:12,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,644 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-13 04:51:12,646 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-13 04:51:12,647 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-13 04:51:12,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-13 04:51:12,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,672 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-13 04:51:12,672 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-13 04:51:12,673 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-13 04:51:12,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:12,710 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-13 04:51:12,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,711 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-13 04:51:12,712 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-13 04:51:12,713 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-13 04:51:12,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:12,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:12,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:12,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:12,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:12,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:12,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:51:12,776 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2022-07-13 04:51:12,776 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-07-13 04:51:12,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:12,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:12,779 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-13 04:51:12,815 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-13 04:51:12,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:51:12,840 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:51:12,840 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:51:12,841 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0#1) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0#1 Supporting invariants [] [2022-07-13 04:51:12,861 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-13 04:51:12,881 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-13 04:51:12,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:12,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:51:12,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:12,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:51:12,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:12,953 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-13 04:51:12,985 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-13 04:51:12,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-13 04:51:13,029 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Result 57 states and 81 transitions. Complement of second has 8 states. [2022-07-13 04:51:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:51:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-13 04:51:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-07-13 04:51:13,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 3 letters. [2022-07-13 04:51:13,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:51:13,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2022-07-13 04:51:13,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:51:13,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-13 04:51:13,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:51:13,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 81 transitions. [2022-07-13 04:51:13,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-13 04:51:13,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 20 states and 29 transitions. [2022-07-13 04:51:13,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-13 04:51:13,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 04:51:13,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2022-07-13 04:51:13,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:13,091 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-13 04:51:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2022-07-13 04:51:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 04:51:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-07-13 04:51:13,111 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-13 04:51:13,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:13,112 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-13 04:51:13,113 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:51:13,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-07-13 04:51:13,114 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-13 04:51:13,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:13,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:13,115 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:51:13,115 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:51:13,115 INFO L752 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 187#L34 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 192#L20-3 assume !(sep_~i~0#1 < ~N~0); 189#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 178#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 179#L20-8 [2022-07-13 04:51:13,116 INFO L754 eck$LassoCheckResult]: Loop: 179#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 180#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 188#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 179#L20-8 [2022-07-13 04:51:13,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash 889511019, now seen corresponding path program 1 times [2022-07-13 04:51:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:13,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636145015] [2022-07-13 04:51:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:13,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:13,157 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-13 04:51:13,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:51:13,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636145015] [2022-07-13 04:51:13,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636145015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:51:13,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:51:13,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:51:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444509415] [2022-07-13 04:51:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:51:13,160 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:51:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2022-07-13 04:51:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:13,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860295023] [2022-07-13 04:51:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:13,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:13,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:51:13,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:51:13,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:51:13,222 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-13 04:51:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:51:13,244 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-07-13 04:51:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:51:13,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2022-07-13 04:51:13,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-13 04:51:13,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2022-07-13 04:51:13,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-13 04:51:13,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 04:51:13,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2022-07-13 04:51:13,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:13,251 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-13 04:51:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2022-07-13 04:51:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-13 04:51:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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-13 04:51:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-13 04:51:13,253 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 04:51:13,253 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 04:51:13,253 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:51:13,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-07-13 04:51:13,254 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-13 04:51:13,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:13,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:13,255 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:51:13,255 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:51:13,255 INFO L752 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 235#L34 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 240#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 238#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 239#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 241#L20-3 assume !(sep_~i~0#1 < ~N~0); 237#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 226#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 227#L20-8 [2022-07-13 04:51:13,255 INFO L754 eck$LassoCheckResult]: Loop: 227#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 228#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 236#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 227#L20-8 [2022-07-13 04:51:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -473899520, now seen corresponding path program 1 times [2022-07-13 04:51:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:13,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095729543] [2022-07-13 04:51:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:51:13,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095729543] [2022-07-13 04:51:13,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095729543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:51:13,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933808697] [2022-07-13 04:51:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:13,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:51:13,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:13,285 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:51:13,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-13 04:51:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:13,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:51:13,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:13,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:51:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:13,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933808697] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:51:13,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:51:13,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 04:51:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491740869] [2022-07-13 04:51:13,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:51:13,406 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:51:13,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:13,407 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2022-07-13 04:51:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:13,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495854495] [2022-07-13 04:51:13,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:13,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:13,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:13,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:51:13,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 04:51:13,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-13 04:51:13,463 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-13 04:51:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:51:13,508 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-07-13 04:51:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:51:13,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2022-07-13 04:51:13,512 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-13 04:51:13,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2022-07-13 04:51:13,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-13 04:51:13,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-13 04:51:13,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2022-07-13 04:51:13,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:13,514 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-13 04:51:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2022-07-13 04:51:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-07-13 04:51:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 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-13 04:51:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-07-13 04:51:13,519 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-13 04:51:13,519 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-13 04:51:13,519 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:51:13,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2022-07-13 04:51:13,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-13 04:51:13,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:13,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:13,520 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 04:51:13,520 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:51:13,520 INFO L752 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 338#L34 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 343#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 344#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 346#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 345#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 341#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 342#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 347#L20-3 assume !(sep_~i~0#1 < ~N~0); 340#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 329#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 330#L20-8 [2022-07-13 04:51:13,520 INFO L754 eck$LassoCheckResult]: Loop: 330#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 331#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 339#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 330#L20-8 [2022-07-13 04:51:13,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash -331548597, now seen corresponding path program 2 times [2022-07-13 04:51:13,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:13,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751527357] [2022-07-13 04:51:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:13,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:13,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:13,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:13,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 3 times [2022-07-13 04:51:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:13,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840998131] [2022-07-13 04:51:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:13,574 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:13,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:13,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1260561435, now seen corresponding path program 1 times [2022-07-13 04:51:13,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:13,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597337165] [2022-07-13 04:51:13,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:13,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:51:13,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597337165] [2022-07-13 04:51:13,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597337165] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:51:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208080681] [2022-07-13 04:51:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:13,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:51:13,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:13,841 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:51:13,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-13 04:51:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:13,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 04:51:13,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:14,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-13 04:51:14,079 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 27 treesize of output 15 [2022-07-13 04:51:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:14,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:51:14,187 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-07-13 04:51:14,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-07-13 04:51:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:51:14,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208080681] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:51:14,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:51:14,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-07-13 04:51:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125851668] [2022-07-13 04:51:14,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:51:14,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:51:14,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 04:51:14,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-13 04:51:14,276 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-13 04:51:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:51:14,734 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2022-07-13 04:51:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 04:51:14,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 135 transitions. [2022-07-13 04:51:14,736 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 28 [2022-07-13 04:51:14,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 135 transitions. [2022-07-13 04:51:14,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-07-13 04:51:14,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-07-13 04:51:14,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 135 transitions. [2022-07-13 04:51:14,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:14,739 INFO L369 hiAutomatonCegarLoop]: Abstraction has 101 states and 135 transitions. [2022-07-13 04:51:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 135 transitions. [2022-07-13 04:51:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 31. [2022-07-13 04:51:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-07-13 04:51:14,742 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-13 04:51:14,742 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-13 04:51:14,742 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:51:14,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2022-07-13 04:51:14,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-13 04:51:14,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:14,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:14,743 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:51:14,743 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 04:51:14,744 INFO L752 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 578#L34 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 583#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 584#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 588#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 585#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 586#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 593#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 591#L20-3 assume !(sep_~i~0#1 < ~N~0); 590#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 567#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 568#L20-8 [2022-07-13 04:51:14,744 INFO L754 eck$LassoCheckResult]: Loop: 568#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 569#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 577#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 568#L20-8 [2022-07-13 04:51:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash -333395639, now seen corresponding path program 1 times [2022-07-13 04:51:14,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:14,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769963933] [2022-07-13 04:51:14,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:14,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:14,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:14,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 4 times [2022-07-13 04:51:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:14,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545745455] [2022-07-13 04:51:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:14,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:14,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2069908061, now seen corresponding path program 1 times [2022-07-13 04:51:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:14,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132004484] [2022-07-13 04:51:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:14,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:14,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:15,387 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:51:15,387 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:51:15,387 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:51:15,387 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:51:15,387 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:51:15,387 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:15,387 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:51:15,387 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:51:15,388 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration5_Lasso [2022-07-13 04:51:15,388 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:51:15,388 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:51:15,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-13 04:51:15,392 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-13 04:51:15,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-13 04:51:15,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-13 04:51:15,396 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-13 04:51:15,398 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-13 04:51:15,789 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-13 04:51:15,791 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-13 04:51:15,793 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-13 04:51:15,795 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-13 04:51:15,796 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-13 04:51:15,798 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-13 04:51:15,799 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-13 04:51:15,802 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-13 04:51:15,804 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-13 04:51:15,806 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-13 04:51:15,807 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-13 04:51:15,808 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-13 04:51:15,811 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-13 04:51:15,814 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-13 04:51:15,815 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-13 04:51:15,816 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-13 04:51:15,817 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-13 04:51:16,195 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:51:16,195 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:51:16,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,197 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-13 04:51:16,199 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-13 04:51:16,200 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-13 04:51:16,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:16,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:16,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:16,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:16,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,223 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-13 04:51:16,223 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-13 04:51:16,225 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-13 04:51:16,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:16,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:16,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:16,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,258 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-13 04:51:16,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,260 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-13 04:51:16,262 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-13 04:51:16,263 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-13 04:51:16,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:16,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:16,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:16,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,292 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-13 04:51:16,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,293 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-13 04:51:16,294 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-13 04:51:16,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:16,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:16,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:16,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:16,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:16,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,320 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-13 04:51:16,320 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-13 04:51:16,322 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-13 04:51:16,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-13 04:51:16,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,347 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-13 04:51:16,347 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-13 04:51:16,350 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-13 04:51:16,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,378 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-13 04:51:16,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,386 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-13 04:51:16,389 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-13 04:51:16,389 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-13 04:51:16,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,413 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-13 04:51:16,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,414 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-13 04:51:16,414 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-13 04:51:16,416 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-13 04:51:16,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-13 04:51:16,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,447 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-13 04:51:16,448 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-13 04:51:16,449 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-13 04:51:16,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:16,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,497 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-13 04:51:16,499 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-13 04:51:16,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:16,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,538 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-13 04:51:16,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,540 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-13 04:51:16,540 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-13 04:51:16,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-13 04:51:16,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-13 04:51:16,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,567 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:51:16,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-13 04:51:16,569 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-13 04:51:16,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,618 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-13 04:51:16,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,619 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-13 04:51:16,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:16,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,647 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-13 04:51:16,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-13 04:51:16,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,677 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-13 04:51:16,678 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-13 04:51:16,679 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-13 04:51:16,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:16,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,712 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-13 04:51:16,714 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-13 04:51:16,715 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-13 04:51:16,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,740 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-13 04:51:16,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,742 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-13 04:51:16,742 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-13 04:51:16,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:51:16,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:16,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-13 04:51:16,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,771 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-13 04:51:16,771 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-13 04:51:16,773 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-13 04:51:16,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:16,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:16,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:16,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:16,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:16,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:16,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:51:16,834 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-13 04:51:16,835 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-13 04:51:16,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:16,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:16,836 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-13 04:51:16,839 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:51:16,844 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-13 04:51:16,856 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:51:16,856 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:51:16,856 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sep_~x#1.base)_2, ULTIMATE.start_sep_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_sep_~x#1.base)_2 - 4*ULTIMATE.start_sep_~i~0#1 Supporting invariants [1*ULTIMATE.start_sep_~x#1.offset >= 0] [2022-07-13 04:51:16,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-13 04:51:16,917 INFO L293 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2022-07-13 04:51:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:16,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:51:16,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:16,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:51:16,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:16,999 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-13 04:51:16,999 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-07-13 04:51:16,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:17,034 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 58 transitions. Complement of second has 8 states. [2022-07-13 04:51:17,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:51:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-07-13 04:51:17,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-13 04:51:17,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:51:17,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2022-07-13 04:51:17,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:51:17,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 6 letters. [2022-07-13 04:51:17,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:51:17,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2022-07-13 04:51:17,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-13 04:51:17,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 44 transitions. [2022-07-13 04:51:17,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-13 04:51:17,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-13 04:51:17,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2022-07-13 04:51:17,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:17,036 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-07-13 04:51:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2022-07-13 04:51:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-13 04:51:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 31 states have internal predecessors, (44), 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-13 04:51:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-07-13 04:51:17,038 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-07-13 04:51:17,038 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-07-13 04:51:17,038 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:51:17,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2022-07-13 04:51:17,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-13 04:51:17,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:17,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:17,038 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:51:17,038 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:17,038 INFO L752 eck$LassoCheckResult]: Stem: 813#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 814#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 827#L34 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 831#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 829#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 830#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 832#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 833#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 839#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 837#L20-3 assume !(sep_~i~0#1 < ~N~0); 836#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 835#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 834#L20-8 assume !(sep_~i~0#1 < ~N~0); 811#L20-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 812#L27-1 main_#t~ret9#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 821#L46-3 [2022-07-13 04:51:17,039 INFO L754 eck$LassoCheckResult]: Loop: 821#L46-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 820#L46-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 821#L46-3 [2022-07-13 04:51:17,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2069906393, now seen corresponding path program 1 times [2022-07-13 04:51:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:17,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210257662] [2022-07-13 04:51:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:17,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 04:51:17,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:51:17,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210257662] [2022-07-13 04:51:17,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210257662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:51:17,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:51:17,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:51:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564216569] [2022-07-13 04:51:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:51:17,094 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:51:17,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:17,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2022-07-13 04:51:17,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:17,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898435977] [2022-07-13 04:51:17,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:17,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:17,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:17,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:51:17,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:51:17,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:51:17,146 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:51:17,171 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-07-13 04:51:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:51:17,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2022-07-13 04:51:17,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-13 04:51:17,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 49 transitions. [2022-07-13 04:51:17,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-13 04:51:17,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-13 04:51:17,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2022-07-13 04:51:17,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:17,172 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-07-13 04:51:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2022-07-13 04:51:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-07-13 04:51:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-07-13 04:51:17,174 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-07-13 04:51:17,174 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-07-13 04:51:17,174 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 04:51:17,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2022-07-13 04:51:17,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-13 04:51:17,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:17,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:17,174 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:51:17,174 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:17,175 INFO L752 eck$LassoCheckResult]: Stem: 887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 888#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 902#L34 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 908#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 909#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 912#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 910#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 911#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 918#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 916#L20-3 assume !(sep_~i~0#1 < ~N~0); 915#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 914#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 893#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 894#L22-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 904#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 895#L20-8 assume !(sep_~i~0#1 < ~N~0); 889#L20-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 890#L27-1 main_#t~ret9#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 897#L46-3 [2022-07-13 04:51:17,175 INFO L754 eck$LassoCheckResult]: Loop: 897#L46-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 896#L46-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 897#L46-3 [2022-07-13 04:51:17,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1787455815, now seen corresponding path program 1 times [2022-07-13 04:51:17,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:17,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070912481] [2022-07-13 04:51:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:17,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 04:51:17,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:51:17,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070912481] [2022-07-13 04:51:17,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070912481] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:51:17,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95382375] [2022-07-13 04:51:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:17,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:51:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:17,223 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:51:17,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-07-13 04:51:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:17,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:51:17,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 04:51:17,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:51:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 04:51:17,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95382375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:51:17,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:51:17,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-13 04:51:17,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187362861] [2022-07-13 04:51:17,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:51:17,321 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:51:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2022-07-13 04:51:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:17,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602729558] [2022-07-13 04:51:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:17,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:17,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:17,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:51:17,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 04:51:17,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-13 04:51:17,371 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:51:17,423 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-07-13 04:51:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 04:51:17,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2022-07-13 04:51:17,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-13 04:51:17,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2022-07-13 04:51:17,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-13 04:51:17,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-13 04:51:17,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2022-07-13 04:51:17,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:17,431 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-07-13 04:51:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2022-07-13 04:51:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-07-13 04:51:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 34 states have internal predecessors, (46), 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-13 04:51:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-07-13 04:51:17,438 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-13 04:51:17,438 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-13 04:51:17,438 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 04:51:17,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2022-07-13 04:51:17,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-13 04:51:17,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:17,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:17,440 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:51:17,440 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:17,440 INFO L752 eck$LassoCheckResult]: Stem: 1079#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1080#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1095#L34 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1101#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1099#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1100#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1102#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1103#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 1112#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1108#L20-3 assume !(sep_~i~0#1 < ~N~0); 1107#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1083#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1084#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1106#L22-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1104#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1087#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1088#L22-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1096#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1105#L20-8 assume !(sep_~i~0#1 < ~N~0); 1081#L20-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1082#L27-1 main_#t~ret9#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1090#L46-3 [2022-07-13 04:51:17,440 INFO L754 eck$LassoCheckResult]: Loop: 1090#L46-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1089#L46-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1090#L46-3 [2022-07-13 04:51:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1143219481, now seen corresponding path program 2 times [2022-07-13 04:51:17,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:17,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150959979] [2022-07-13 04:51:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:17,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 04:51:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:51:17,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150959979] [2022-07-13 04:51:17,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150959979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:51:17,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897218899] [2022-07-13 04:51:17,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 04:51:17,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:51:17,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:17,605 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:51:17,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-07-13 04:51:17,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 04:51:17,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 04:51:17,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 04:51:17,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:17,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-13 04:51:17,734 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 23 treesize of output 11 [2022-07-13 04:51:17,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 04:51:17,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:51:17,838 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-07-13 04:51:17,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-07-13 04:51:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 04:51:17,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897218899] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:51:17,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:51:17,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-13 04:51:17,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827387990] [2022-07-13 04:51:17,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:51:17,880 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:51:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 3 times [2022-07-13 04:51:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:17,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368042963] [2022-07-13 04:51:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:17,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:17,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:51:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 04:51:17,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-13 04:51:17,927 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 16 Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:51:18,264 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2022-07-13 04:51:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 04:51:18,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 103 transitions. [2022-07-13 04:51:18,266 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-13 04:51:18,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 103 transitions. [2022-07-13 04:51:18,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-07-13 04:51:18,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-07-13 04:51:18,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 103 transitions. [2022-07-13 04:51:18,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:51:18,267 INFO L369 hiAutomatonCegarLoop]: Abstraction has 79 states and 103 transitions. [2022-07-13 04:51:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 103 transitions. [2022-07-13 04:51:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 35. [2022-07-13 04:51:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:51:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-07-13 04:51:18,268 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-13 04:51:18,268 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-13 04:51:18,268 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 04:51:18,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2022-07-13 04:51:18,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-13 04:51:18,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:18,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:18,269 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:51:18,269 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:18,269 INFO L752 eck$LassoCheckResult]: Stem: 1344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1345#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1359#L34 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1364#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1365#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1368#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1366#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1367#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 1376#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1370#L20-3 assume !(sep_~i~0#1 < ~N~0); 1371#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1346#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1347#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1375#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 1374#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1350#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1351#L22-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1358#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1369#L20-8 assume !(sep_~i~0#1 < ~N~0); 1342#L20-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1343#L27-1 main_#t~ret9#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1353#L46-3 [2022-07-13 04:51:18,269 INFO L754 eck$LassoCheckResult]: Loop: 1353#L46-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1352#L46-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1353#L46-3 [2022-07-13 04:51:18,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1952566107, now seen corresponding path program 1 times [2022-07-13 04:51:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:18,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143594153] [2022-07-13 04:51:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:18,300 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:18,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 4 times [2022-07-13 04:51:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:18,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146230306] [2022-07-13 04:51:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:18,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:18,326 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:18,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash -484677763, now seen corresponding path program 1 times [2022-07-13 04:51:18,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:18,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793614536] [2022-07-13 04:51:18,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:18,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:18,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:18,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:19,231 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:51:19,231 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:51:19,231 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:51:19,231 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:51:19,231 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:51:19,231 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:19,231 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:51:19,231 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:51:19,231 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration9_Lasso [2022-07-13 04:51:19,231 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:51:19,231 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:51:19,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-13 04:51:19,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-13 04:51:19,236 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-13 04:51:19,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-13 04:51:19,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-13 04:51:19,244 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-13 04:51:19,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:19,247 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-13 04:51:19,249 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-13 04:51:19,251 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-13 04:51:19,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:19,253 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-13 04:51:19,254 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-13 04:51:19,256 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-13 04:51:19,257 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-13 04:51:19,259 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-13 04:51:19,260 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-13 04:51:19,264 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-13 04:51:19,266 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-13 04:51:19,267 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-13 04:51:19,866 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 04:51:19,868 INFO L158 Benchmark]: Toolchain (without parser) took 9962.73ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 63.7MB in the beginning and 68.6MB in the end (delta: -4.9MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2022-07-13 04:51:19,868 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:51:19,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.56ms. Allocated memory is still 100.7MB. Free memory was 63.5MB in the beginning and 53.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 04:51:19,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.49ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 51.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:51:19,869 INFO L158 Benchmark]: Boogie Preprocessor took 29.29ms. Allocated memory is still 100.7MB. Free memory was 51.4MB in the beginning and 79.2MB in the end (delta: -27.8MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-07-13 04:51:19,869 INFO L158 Benchmark]: RCFGBuilder took 317.12ms. Allocated memory is still 100.7MB. Free memory was 79.2MB in the beginning and 66.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 04:51:19,869 INFO L158 Benchmark]: BuchiAutomizer took 9406.32ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 66.2MB in the beginning and 68.6MB in the end (delta: -2.4MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2022-07-13 04:51:19,870 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.14ms. Allocated memory is still 100.7MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.56ms. Allocated memory is still 100.7MB. Free memory was 63.5MB in the beginning and 53.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.49ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 51.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.29ms. Allocated memory is still 100.7MB. Free memory was 51.4MB in the beginning and 79.2MB in the end (delta: -27.8MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 317.12ms. Allocated memory is still 100.7MB. Free memory was 79.2MB in the beginning and 66.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9406.32ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 66.2MB in the beginning and 68.6MB in the end (delta: -2.4MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 04:51:19,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:20,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-07-13 04:51:20,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:20,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-13 04:51:20,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null