./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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/sep05-1.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 ac50477087b7e2b9c80860ad42d4d46d99ddf32e797cee205c21d5ff44f08ec3 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:24:48,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:24:48,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:24:48,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:24:48,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:24:48,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:24:48,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:24:48,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:24:48,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:24:48,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:24:48,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:24:48,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:24:48,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:24:48,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:24:48,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:24:48,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:24:48,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:24:48,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:24:48,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:24:48,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:24:48,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:24:48,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:24:48,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:24:48,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:24:48,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:24:48,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:24:48,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:24:48,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:24:48,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:24:48,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:24:48,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:24:48,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:24:48,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:24:48,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:24:48,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:24:48,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:24:48,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:24:48,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:24:48,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:24:48,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:24:48,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:24:48,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:24:49,025 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:24:49,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:24:49,026 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:24:49,026 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:24:49,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:24:49,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:24:49,027 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:24:49,028 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:24:49,028 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:24:49,028 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:24:49,028 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:24:49,029 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:24:49,029 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:24:49,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:24:49,029 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:24:49,029 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:24:49,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:24:49,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:24:49,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:24:49,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:24:49,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:24:49,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:24:49,030 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:24:49,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:24:49,030 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:24:49,031 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:24:49,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:24:49,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:24:49,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:24:49,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:24:49,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:24:49,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:24:49,032 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:24:49,032 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 -> ac50477087b7e2b9c80860ad42d4d46d99ddf32e797cee205c21d5ff44f08ec3 [2021-12-15 17:24:49,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:24:49,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:24:49,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:24:49,217 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:24:49,218 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:24:49,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep05-1.i [2021-12-15 17:24:49,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77fafc5ae/3d3ef6473ead43ed8b14a7738acd8509/FLAG708048312 [2021-12-15 17:24:49,624 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:24:49,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep05-1.i [2021-12-15 17:24:49,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77fafc5ae/3d3ef6473ead43ed8b14a7738acd8509/FLAG708048312 [2021-12-15 17:24:50,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77fafc5ae/3d3ef6473ead43ed8b14a7738acd8509 [2021-12-15 17:24:50,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:24:50,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:24:50,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:24:50,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:24:50,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:24:50,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7f85a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50, skipping insertion in model container [2021-12-15 17:24:50,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:24:50,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:24:50,178 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/sep05-1.i[1287,1300] [2021-12-15 17:24:50,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:24:50,183 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:24:50,194 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/sep05-1.i[1287,1300] [2021-12-15 17:24:50,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:24:50,202 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:24:50,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50 WrapperNode [2021-12-15 17:24:50,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:24:50,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:24:50,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:24:50,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:24:50,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,224 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2021-12-15 17:24:50,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:24:50,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:24:50,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:24:50,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:24:50,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:24:50,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:24:50,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:24:50,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:24:50,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (1/1) ... [2021-12-15 17:24:50,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:50,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:24:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:24:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:24:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:24:50,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:24:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:24:50,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:24:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:24:50,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:24:50,354 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:24:50,355 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:24:50,485 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:24:50,489 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:24:50,489 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 17:24:50,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:24:50 BoogieIcfgContainer [2021-12-15 17:24:50,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:24:50,491 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:24:50,491 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:24:50,495 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:24:50,498 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:24:50,498 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:24:50" (1/3) ... [2021-12-15 17:24:50,498 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa1176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:24:50, skipping insertion in model container [2021-12-15 17:24:50,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:24:50,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:50" (2/3) ... [2021-12-15 17:24:50,500 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa1176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:24:50, skipping insertion in model container [2021-12-15 17:24:50,500 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:24:50,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:24:50" (3/3) ... [2021-12-15 17:24:50,512 INFO L388 chiAutomizerObserver]: Analyzing ICFG sep05-1.i [2021-12-15 17:24:50,540 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:24:50,540 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:24:50,540 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:24:50,540 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:24:50,541 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:24:50,541 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:24:50,541 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:24:50,541 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:24:50,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:50,567 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-12-15 17:24:50,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:50,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:50,570 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:24:50,570 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:24:50,570 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:24:50,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:50,572 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-12-15 17:24:50,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:50,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:50,573 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:24:50,573 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:24:50,577 INFO L791 eck$LassoCheckResult]: Stem: 19#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(10, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 27#L37-3true [2021-12-15 17:24:50,577 INFO L793 eck$LassoCheckResult]: Loop: 27#L37-3true assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 18#L37-2true main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27#L37-3true [2021-12-15 17:24:50,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:24:50,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:50,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890691685] [2021-12-15 17:24:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:50,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:50,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:50,713 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:50,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-15 17:24:50,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:50,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958923591] [2021-12-15 17:24:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:50,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:50,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:50,753 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-15 17:24:50,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:50,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137144572] [2021-12-15 17:24:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:50,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:50,772 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:50,781 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:51,015 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:24:51,016 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:24:51,016 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:24:51,016 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:24:51,016 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:24:51,016 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:51,016 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:24:51,017 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:24:51,017 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration1_Lasso [2021-12-15 17:24:51,017 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:24:51,017 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:24:51,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:51,373 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:24:51,375 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:24:51,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:51,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:51,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:51,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-15 17:24:51,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:51,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:51,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:51,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:51,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:51,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:51,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:51,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:51,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:51,496 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 [2021-12-15 17:24:51,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:51,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:51,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:51,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-15 17:24:51,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:51,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:51,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:51,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:51,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:51,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:51,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:51,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:51,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:51,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:51,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:51,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:51,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:51,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-15 17:24:51,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:51,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:51,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:51,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:51,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:51,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:51,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:51,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:51,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:51,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:51,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:51,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:51,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-15 17:24:51,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:51,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:51,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:51,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:51,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:51,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:51,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:51,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:51,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:51,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:51,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:51,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:51,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:51,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-15 17:24:51,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:51,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:51,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:51,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:51,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:51,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:51,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:51,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:51,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-15 17:24:51,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:51,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:51,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:51,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-15 17:24:51,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:51,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:51,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:51,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:51,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:51,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:51,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:51,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:51,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:51,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:51,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:51,715 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:51,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-15 17:24:51,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:51,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:51,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:51,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:51,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:51,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:51,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:51,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:24:51,768 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-12-15 17:24:51,768 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-15 17:24:51,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:51,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:51,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:51,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-15 17:24:51,830 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:24:51,849 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:24:51,849 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:24:51,850 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2021-12-15 17:24:51,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:51,912 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2021-12-15 17:24:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:51,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:24:51,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:51,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:24:51,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:52,021 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:24:52,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:52,067 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 110 transitions. Complement of second has 8 states. [2021-12-15 17:24:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:24:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2021-12-15 17:24:52,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-15 17:24:52,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:52,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-15 17:24:52,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:52,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-15 17:24:52,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:52,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 110 transitions. [2021-12-15 17:24:52,077 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-15 17:24:52,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 30 transitions. [2021-12-15 17:24:52,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-15 17:24:52,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-15 17:24:52,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-12-15 17:24:52,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:52,081 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-15 17:24:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-12-15 17:24:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-15 17:24:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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) [2021-12-15 17:24:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2021-12-15 17:24:52,098 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-15 17:24:52,098 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-15 17:24:52,098 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:24:52,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2021-12-15 17:24:52,099 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-15 17:24:52,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:52,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:52,099 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:24:52,099 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:24:52,100 INFO L791 eck$LassoCheckResult]: Stem: 165#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(10, 2); 166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 174#L37-3 assume !(main_~i~1#1 < 5); 179#L37-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; 180#L18-3 [2021-12-15 17:24:52,100 INFO L793 eck$LassoCheckResult]: Loop: 180#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 183#L20 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; 181#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 180#L18-3 [2021-12-15 17:24:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:52,100 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-12-15 17:24:52,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:52,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109147670] [2021-12-15 17:24:52,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:52,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:52,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109147670] [2021-12-15 17:24:52,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109147670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:24:52,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:24:52,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:24:52,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649685612] [2021-12-15 17:24:52,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:24:52,129 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2021-12-15 17:24:52,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:52,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542359850] [2021-12-15 17:24:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,140 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,148 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:52,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:24:52,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:24:52,187 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:52,204 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2021-12-15 17:24:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:24:52,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2021-12-15 17:24:52,206 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-15 17:24:52,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2021-12-15 17:24:52,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-15 17:24:52,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-15 17:24:52,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2021-12-15 17:24:52,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:52,207 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-12-15 17:24:52,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2021-12-15 17:24:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-12-15 17:24:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2021-12-15 17:24:52,219 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2021-12-15 17:24:52,219 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2021-12-15 17:24:52,219 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:24:52,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2021-12-15 17:24:52,220 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-15 17:24:52,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:52,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:52,220 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:24:52,220 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:24:52,221 INFO L791 eck$LassoCheckResult]: Stem: 216#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(10, 2); 217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 225#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 214#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 215#L37-3 assume !(main_~i~1#1 < 5); 230#L37-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; 231#L18-3 [2021-12-15 17:24:52,221 INFO L793 eck$LassoCheckResult]: Loop: 231#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 234#L20 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; 232#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 231#L18-3 [2021-12-15 17:24:52,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-12-15 17:24:52,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:52,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867991582] [2021-12-15 17:24:52,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:52,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:52,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:52,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867991582] [2021-12-15 17:24:52,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867991582] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:52,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562748303] [2021-12-15 17:24:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:52,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:52,280 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:52,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 17:24:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:52,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 17:24:52,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:52,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:52,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562748303] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:52,346 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:52,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-15 17:24:52,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723113448] [2021-12-15 17:24:52,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:52,347 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:52,347 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2021-12-15 17:24:52,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:52,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770375529] [2021-12-15 17:24:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,352 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,357 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:52,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:52,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 17:24:52,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-15 17:24:52,393 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:52,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:52,407 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2021-12-15 17:24:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:24:52,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2021-12-15 17:24:52,409 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-15 17:24:52,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2021-12-15 17:24:52,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-15 17:24:52,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-15 17:24:52,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2021-12-15 17:24:52,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:52,410 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-15 17:24:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2021-12-15 17:24:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-15 17:24:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-15 17:24:52,412 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-15 17:24:52,412 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-15 17:24:52,412 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:24:52,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2021-12-15 17:24:52,412 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-15 17:24:52,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:52,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:52,413 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-12-15 17:24:52,413 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:24:52,413 INFO L791 eck$LassoCheckResult]: Stem: 306#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(10, 2); 307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 315#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 304#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 305#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 326#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 331#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 330#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 329#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 328#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 327#L37-3 assume !(main_~i~1#1 < 5); 320#L37-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; 321#L18-3 [2021-12-15 17:24:52,413 INFO L793 eck$LassoCheckResult]: Loop: 321#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 324#L20 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; 322#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 321#L18-3 [2021-12-15 17:24:52,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2021-12-15 17:24:52,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:52,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201835874] [2021-12-15 17:24:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:52,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:52,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201835874] [2021-12-15 17:24:52,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201835874] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:52,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017377031] [2021-12-15 17:24:52,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:24:52,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:52,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:52,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:52,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 17:24:52,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:24:52,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:24:52,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:24:52,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:52,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:52,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017377031] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:52,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:52,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-12-15 17:24:52,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832087224] [2021-12-15 17:24:52,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:52,559 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2021-12-15 17:24:52,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:52,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008682434] [2021-12-15 17:24:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,569 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:52,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:24:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-15 17:24:52,602 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:52,616 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2021-12-15 17:24:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:24:52,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2021-12-15 17:24:52,618 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-15 17:24:52,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2021-12-15 17:24:52,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-15 17:24:52,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-15 17:24:52,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2021-12-15 17:24:52,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:52,619 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-15 17:24:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2021-12-15 17:24:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-15 17:24:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-12-15 17:24:52,621 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-15 17:24:52,621 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-15 17:24:52,621 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:24:52,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2021-12-15 17:24:52,621 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-15 17:24:52,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:52,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:52,622 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-12-15 17:24:52,622 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:24:52,622 INFO L791 eck$LassoCheckResult]: Stem: 441#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(10, 2); 442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 450#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 439#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 440#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 461#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 468#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 467#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 466#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 465#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 464#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 463#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 462#L37-3 assume !(main_~i~1#1 < 5); 455#L37-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; 456#L18-3 [2021-12-15 17:24:52,623 INFO L793 eck$LassoCheckResult]: Loop: 456#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 459#L20 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; 457#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 456#L18-3 [2021-12-15 17:24:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:52,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2021-12-15 17:24:52,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:52,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694578795] [2021-12-15 17:24:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,647 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2021-12-15 17:24:52,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:52,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446224083] [2021-12-15 17:24:52,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2021-12-15 17:24:52,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:52,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870837580] [2021-12-15 17:24:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:52,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:52,687 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:53,242 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:24:53,242 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:24:53,242 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:24:53,242 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:24:53,242 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:24:53,242 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:53,242 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:24:53,242 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:24:53,242 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration5_Lasso [2021-12-15 17:24:53,242 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:24:53,243 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:24:53,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:53,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:24:53,752 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:24:53,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:53,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:53,758 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:53,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-15 17:24:53,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:53,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:53,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:53,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:53,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:53,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:53,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:53,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:53,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:53,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:53,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:53,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:53,797 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:53,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-15 17:24:53,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:53,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:53,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:53,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:53,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:53,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:53,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:53,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:53,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:53,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:53,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:53,884 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:53,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-15 17:24:53,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:53,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:53,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:53,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:53,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:53,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:53,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:53,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:53,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:53,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:53,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:53,926 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:53,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:53,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:53,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:53,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:53,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:53,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:53,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:53,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:53,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-15 17:24:53,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:53,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:53,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:53,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:53,972 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:53,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-15 17:24:53,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:53,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:53,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:53,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:53,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:53,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:53,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:53,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:53,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,012 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-15 17:24:54,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,038 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-15 17:24:54,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:54,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:54,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,113 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-15 17:24:54,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-15 17:24:54,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,140 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-15 17:24:54,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,174 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-15 17:24:54,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,218 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-15 17:24:54,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,266 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-15 17:24:54,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,297 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-15 17:24:54,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:54,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:54,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-15 17:24:54,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,344 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-15 17:24:54,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,372 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-15 17:24:54,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,426 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-15 17:24:54,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,453 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-15 17:24:54,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:54,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:54,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:54,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,479 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 [2021-12-15 17:24:54,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,481 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-15 17:24:54,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:54,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:54,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,522 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 [2021-12-15 17:24:54,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,523 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-15 17:24:54,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:54,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:54,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:54,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,566 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-15 17:24:54,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 [2021-12-15 17:24:54,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:54,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:54,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:54,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-15 17:24:54,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,596 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-15 17:24:54,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:54,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:54,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:54,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:54,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:54,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:54,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:54,634 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:24:54,642 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-15 17:24:54,642 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-15 17:24:54,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:54,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,643 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-15 17:24:54,645 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:24:54,665 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:24:54,666 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:24:54,666 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2, ULTIMATE.start_sep_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 - 8*ULTIMATE.start_sep_~i~0#1 Supporting invariants [] [2021-12-15 17:24:54,681 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 [2021-12-15 17:24:54,729 INFO L297 tatePredicateManager]: 28 out of 29 supporting invariants were superfluous and have been removed [2021-12-15 17:24:54,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:54,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:24:54,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:54,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:24:54,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:54,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:24:54,819 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:54,839 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 46 transitions. Complement of second has 7 states. [2021-12-15 17:24:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:24:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-15 17:24:54,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-15 17:24:54,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:54,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2021-12-15 17:24:54,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:54,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 6 letters. [2021-12-15 17:24:54,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:54,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2021-12-15 17:24:54,841 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-15 17:24:54,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 39 transitions. [2021-12-15 17:24:54,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-15 17:24:54,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-15 17:24:54,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2021-12-15 17:24:54,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:54,842 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-15 17:24:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2021-12-15 17:24:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-15 17:24:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-15 17:24:54,844 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-15 17:24:54,844 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-15 17:24:54,844 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:24:54,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2021-12-15 17:24:54,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-15 17:24:54,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:54,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:54,845 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:54,845 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:24:54,846 INFO L791 eck$LassoCheckResult]: Stem: 702#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(10, 2); 703#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 711#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 700#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 701#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 723#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 730#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 729#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 728#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 727#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 726#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 725#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 724#L37-3 assume !(main_~i~1#1 < 5); 716#L37-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; 717#L18-3 assume !(sep_~i~0#1 < 5); 720#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 704#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#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; 705#L18-8 [2021-12-15 17:24:54,846 INFO L793 eck$LassoCheckResult]: Loop: 705#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 715#L20-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; 722#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 705#L18-8 [2021-12-15 17:24:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1638581187, now seen corresponding path program 1 times [2021-12-15 17:24:54,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:54,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334690490] [2021-12-15 17:24:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:54,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 17:24:54,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:54,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334690490] [2021-12-15 17:24:54,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334690490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:24:54,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:24:54,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:24:54,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305433286] [2021-12-15 17:24:54,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:24:54,865 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:54,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash 74576, now seen corresponding path program 1 times [2021-12-15 17:24:54,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:54,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086413840] [2021-12-15 17:24:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:54,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:54,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:54,876 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:54,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:54,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:24:54,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:24:54,906 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:54,920 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2021-12-15 17:24:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:24:54,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2021-12-15 17:24:54,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-15 17:24:54,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2021-12-15 17:24:54,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-15 17:24:54,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-15 17:24:54,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2021-12-15 17:24:54,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:54,922 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-12-15 17:24:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2021-12-15 17:24:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2021-12-15 17:24:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-15 17:24:54,923 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-15 17:24:54,923 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-15 17:24:54,923 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:24:54,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2021-12-15 17:24:54,924 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-15 17:24:54,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:54,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:54,924 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:54,925 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:24:54,925 INFO L791 eck$LassoCheckResult]: Stem: 778#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(10, 2); 779#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 787#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 776#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 777#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 800#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 807#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 806#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 805#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 804#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 803#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 802#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 801#L37-3 assume !(main_~i~1#1 < 5); 792#L37-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; 793#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 796#L20 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; 794#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 795#L18-3 assume !(sep_~i~0#1 < 5); 797#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 780#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#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; 781#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 790#L20-2 [2021-12-15 17:24:54,925 INFO L793 eck$LassoCheckResult]: Loop: 790#L20-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; 798#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 799#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 790#L20-2 [2021-12-15 17:24:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1567455174, now seen corresponding path program 1 times [2021-12-15 17:24:54,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:54,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813818660] [2021-12-15 17:24:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:54,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 17:24:54,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:54,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813818660] [2021-12-15 17:24:54,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813818660] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:54,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160137827] [2021-12-15 17:24:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:54,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:54,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:54,966 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:54,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-12-15 17:24:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:55,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 17:24:55,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 17:24:55,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 17:24:55,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160137827] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:55,067 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:55,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-15 17:24:55,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107622439] [2021-12-15 17:24:55,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:55,069 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:55,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 2 times [2021-12-15 17:24:55,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:55,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698772037] [2021-12-15 17:24:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:55,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:55,082 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:55,092 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:55,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:55,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 17:24:55,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-15 17:24:55,129 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:55,168 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2021-12-15 17:24:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:24:55,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2021-12-15 17:24:55,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-15 17:24:55,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2021-12-15 17:24:55,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-15 17:24:55,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-15 17:24:55,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2021-12-15 17:24:55,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:55,174 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2021-12-15 17:24:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2021-12-15 17:24:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2021-12-15 17:24:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.26) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2021-12-15 17:24:55,183 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2021-12-15 17:24:55,183 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2021-12-15 17:24:55,183 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:24:55,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2021-12-15 17:24:55,185 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-15 17:24:55,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:55,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:55,186 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:55,186 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:24:55,187 INFO L791 eck$LassoCheckResult]: Stem: 1000#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(10, 2); 1001#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1009#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 998#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 999#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1024#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1047#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1046#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1045#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1044#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1043#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1042#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1041#L37-3 assume !(main_~i~1#1 < 5); 1015#L37-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; 1016#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1019#L20 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; 1017#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1018#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1020#L20 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; 1038#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1036#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1034#L20 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; 1032#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1031#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1026#L20 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; 1027#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1025#L18-3 assume !(sep_~i~0#1 < 5); 1021#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1002#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#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; 1003#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1022#L20-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; 1023#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1012#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1013#L20-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; 1040#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1039#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1037#L20-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; 1035#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1033#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1029#L20-2 [2021-12-15 17:24:55,187 INFO L793 eck$LassoCheckResult]: Loop: 1029#L20-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; 1030#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1028#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1029#L20-2 [2021-12-15 17:24:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash -534676351, now seen corresponding path program 1 times [2021-12-15 17:24:55,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:55,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424945140] [2021-12-15 17:24:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:55,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-15 17:24:55,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:55,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424945140] [2021-12-15 17:24:55,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424945140] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:55,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344869860] [2021-12-15 17:24:55,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:55,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:55,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:55,253 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:55,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-15 17:24:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:55,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:24:55,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-15 17:24:55,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-15 17:24:55,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344869860] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:55,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:55,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-12-15 17:24:55,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510058901] [2021-12-15 17:24:55,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:55,408 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:55,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 3 times [2021-12-15 17:24:55,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:55,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758832561] [2021-12-15 17:24:55,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:55,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:55,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:55,414 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:55,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:55,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:24:55,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-15 17:24:55,448 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:55,493 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2021-12-15 17:24:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:24:55,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 88 transitions. [2021-12-15 17:24:55,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-15 17:24:55,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 88 transitions. [2021-12-15 17:24:55,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-12-15 17:24:55,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-12-15 17:24:55,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2021-12-15 17:24:55,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:55,495 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2021-12-15 17:24:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2021-12-15 17:24:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2021-12-15 17:24:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 55 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2021-12-15 17:24:55,497 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2021-12-15 17:24:55,497 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2021-12-15 17:24:55,497 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:24:55,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2021-12-15 17:24:55,498 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-15 17:24:55,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:55,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:55,499 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:55,499 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:24:55,499 INFO L791 eck$LassoCheckResult]: Stem: 1358#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(10, 2); 1359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1367#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1356#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1357#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1382#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1411#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1410#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1409#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1408#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1407#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1406#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1405#L37-3 assume !(main_~i~1#1 < 5); 1373#L37-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; 1374#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1377#L20 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; 1375#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1376#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1378#L20 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; 1402#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1400#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1398#L20 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; 1396#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1394#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1392#L20 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; 1390#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1389#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1384#L20 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; 1385#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1383#L18-3 assume !(sep_~i~0#1 < 5); 1379#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1360#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#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; 1361#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1380#L20-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; 1381#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1370#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1371#L20-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; 1404#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1403#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1401#L20-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; 1399#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1397#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1395#L20-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; 1393#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1391#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1387#L20-2 [2021-12-15 17:24:55,499 INFO L793 eck$LassoCheckResult]: Loop: 1387#L20-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; 1388#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1386#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1387#L20-2 [2021-12-15 17:24:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1616244090, now seen corresponding path program 2 times [2021-12-15 17:24:55,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:55,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455734040] [2021-12-15 17:24:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:55,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:55,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:55,602 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:55,645 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 4 times [2021-12-15 17:24:55,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:55,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310039009] [2021-12-15 17:24:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:55,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:55,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:55,665 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:55,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1350622481, now seen corresponding path program 1 times [2021-12-15 17:24:55,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:55,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929907575] [2021-12-15 17:24:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:55,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-15 17:24:55,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:55,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929907575] [2021-12-15 17:24:55,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929907575] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:55,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990109842] [2021-12-15 17:24:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:55,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:55,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:55,768 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:55,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-15 17:24:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:55,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 17:24:55,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-15 17:24:55,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 17:24:55,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990109842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:24:55,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 17:24:55,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2021-12-15 17:24:55,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377750544] [2021-12-15 17:24:55,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:24:55,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:24:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-12-15 17:24:55,926 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. cyclomatic complexity: 20 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:55,984 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2021-12-15 17:24:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 17:24:55,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2021-12-15 17:24:55,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:24:55,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 63 transitions. [2021-12-15 17:24:55,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-15 17:24:55,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-12-15 17:24:55,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2021-12-15 17:24:55,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:55,986 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-12-15 17:24:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2021-12-15 17:24:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-15 17:24:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2021-12-15 17:24:55,987 INFO L704 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-12-15 17:24:55,987 INFO L587 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-12-15 17:24:55,987 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:24:55,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2021-12-15 17:24:55,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:24:55,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:55,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:55,989 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:55,989 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:24:55,989 INFO L791 eck$LassoCheckResult]: Stem: 1638#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(10, 2); 1639#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1645#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1636#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1637#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1656#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1671#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1669#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1667#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1665#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1663#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1660#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1659#L37-3 assume !(main_~i~1#1 < 5); 1648#L37-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; 1649#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1687#L20 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; 1650#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1651#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1652#L20 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; 1657#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1686#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1685#L20 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; 1684#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1683#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1682#L20 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; 1681#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1680#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1679#L20 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; 1678#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1677#L18-3 assume !(sep_~i~0#1 < 5); 1653#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1640#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#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; 1641#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1646#L20-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; 1654#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1655#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1676#L20-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; 1675#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1674#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1673#L20-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; 1672#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1670#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1668#L20-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; 1666#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1664#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1662#L20-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; 1661#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1658#L18-8 assume !(sep_~i~0#1 < 5); 1647#L18-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1642#L25-1 main_#t~ret10#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;call main_#t~mem11#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1;main_~i~2#1 := 0; 1643#L46-3 [2021-12-15 17:24:55,989 INFO L793 eck$LassoCheckResult]: Loop: 1643#L46-3 assume !!(main_~i~2#1 < 4);call main_#t~mem13#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem13#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem13#1; 1644#L46-2 main_#t~post12#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1643#L46-3 [2021-12-15 17:24:55,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash -866233935, now seen corresponding path program 1 times [2021-12-15 17:24:55,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:55,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133659443] [2021-12-15 17:24:55,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:55,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:56,030 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:56,072 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2021-12-15 17:24:56,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:56,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673442565] [2021-12-15 17:24:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:56,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:56,074 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:56,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 772846003, now seen corresponding path program 1 times [2021-12-15 17:24:56,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247835420] [2021-12-15 17:24:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:56,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:56,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:56,191 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:00,122 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:25:00,122 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:25:00,122 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:25:00,122 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:25:00,122 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:25:00,123 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:00,123 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:25:00,123 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:25:00,123 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration10_Lasso [2021-12-15 17:25:00,123 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:25:00,123 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:25:00,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:00,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:01,486 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:25:01,486 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:25:01,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,497 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-15 17:25:01,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:01,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:01,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:01,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:01,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,522 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-15 17:25:01,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:01,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:01,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-15 17:25:01,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,549 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:01,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:01,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:01,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-15 17:25:01,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-15 17:25:01,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,585 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-15 17:25:01,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:01,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:01,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:01,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-15 17:25:01,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,612 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-15 17:25:01,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:01,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:01,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:01,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:01,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,639 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-15 17:25:01,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:01,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:01,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:01,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:01,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,666 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-15 17:25:01,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:01,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:01,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:01,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:01,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,704 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-15 17:25:01,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:01,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:01,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-15 17:25:01,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,775 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-15 17:25:01,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:01,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:01,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:01,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:01,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,808 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-15 17:25:01,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:01,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:01,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:01,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,846 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-15 17:25:01,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:01,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:01,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-15 17:25:01,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,894 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-15 17:25:01,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:01,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:01,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-15 17:25:01,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,921 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-15 17:25:01,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:01,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:01,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-15 17:25:01,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,949 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-15 17:25:01,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:01,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:01,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:01,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:01,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:01,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:01,981 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:01,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-15 17:25:01,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:01,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:01,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:01,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:01,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:01,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:01,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:01,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:02,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-15 17:25:02,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:02,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:02,012 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:02,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-15 17:25:02,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:02,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:02,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:02,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:02,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:02,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:02,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:02,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:02,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:02,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:02,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:02,039 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:02,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-15 17:25:02,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:02,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:02,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:02,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:02,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:02,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:02,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:02,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:02,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:02,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:02,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:02,077 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:02,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:02,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:02,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:02,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:02,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:02,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:02,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:02,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-15 17:25:02,103 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:25:02,129 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2021-12-15 17:25:02,129 INFO L444 ModelExtractionUtils]: 1 out of 28 variables were initially zero. Simplification set additionally 24 variables to zero. [2021-12-15 17:25:02,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:02,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:02,131 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:02,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-15 17:25:02,132 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:25:02,162 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:25:02,162 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:25:02,162 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1) = -2*ULTIMATE.start_main_~i~2#1 + 7 Supporting invariants [] [2021-12-15 17:25:02,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:02,312 INFO L297 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2021-12-15 17:25:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:02,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:25:02,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:02,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:25:02,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:02,431 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:25:02,432 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:02,437 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 66 transitions. Complement of second has 4 states. [2021-12-15 17:25:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:25:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2021-12-15 17:25:02,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 2 letters. [2021-12-15 17:25:02,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:02,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 52 letters. Loop has 2 letters. [2021-12-15 17:25:02,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:02,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 4 letters. [2021-12-15 17:25:02,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:02,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2021-12-15 17:25:02,439 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:25:02,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2021-12-15 17:25:02,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-15 17:25:02,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-15 17:25:02,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-15 17:25:02,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:25:02,439 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:25:02,440 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:25:02,440 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:25:02,440 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:25:02,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-15 17:25:02,440 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:25:02,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-15 17:25:02,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:25:02 BoogieIcfgContainer [2021-12-15 17:25:02,444 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:25:02,445 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:25:02,445 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:25:02,445 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:25:02,446 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:24:50" (3/4) ... [2021-12-15 17:25:02,447 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 17:25:02,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:25:02,448 INFO L158 Benchmark]: Toolchain (without parser) took 12402.70ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 115.2MB in the beginning and 70.7MB in the end (delta: 44.5MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2021-12-15 17:25:02,448 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory was 56.2MB in the beginning and 56.2MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:25:02,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.40ms. Allocated memory is still 144.7MB. Free memory was 114.8MB in the beginning and 121.4MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:25:02,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.99ms. Allocated memory is still 144.7MB. Free memory was 121.1MB in the beginning and 119.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:25:02,449 INFO L158 Benchmark]: Boogie Preprocessor took 24.55ms. Allocated memory is still 144.7MB. Free memory was 119.2MB in the beginning and 117.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:25:02,449 INFO L158 Benchmark]: RCFGBuilder took 239.57ms. Allocated memory is still 144.7MB. Free memory was 117.4MB in the beginning and 105.0MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:25:02,450 INFO L158 Benchmark]: BuchiAutomizer took 11954.01ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 105.0MB in the beginning and 71.7MB in the end (delta: 33.3MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. [2021-12-15 17:25:02,450 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 211.8MB. Free memory was 71.7MB in the beginning and 70.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:25:02,451 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 94.4MB. Free memory was 56.2MB in the beginning and 56.2MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.40ms. Allocated memory is still 144.7MB. Free memory was 114.8MB in the beginning and 121.4MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.99ms. Allocated memory is still 144.7MB. Free memory was 121.1MB in the beginning and 119.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.55ms. Allocated memory is still 144.7MB. Free memory was 119.2MB in the beginning and 117.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 239.57ms. Allocated memory is still 144.7MB. Free memory was 117.4MB in the beginning and 105.0MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 11954.01ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 105.0MB in the beginning and 71.7MB in the end (delta: 33.3MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 211.8MB. Free memory was 71.7MB in the beginning and 70.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.9s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 11.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 660 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 268 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 238 mSDtfsCounter, 268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax100 hnf99 lsp93 ukn77 mio100 lsp39 div100 bol100 ite100 ukn100 eq172 hnf92 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-15 17:25:02,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:02,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:02,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-12-15 17:25:03,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2021-12-15 17:25:03,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-15 17:25:03,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:03,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE