./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b 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/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c -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 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:44:51,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:44:51,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:44:51,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:44:51,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:44:51,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:44:51,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:44:51,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:44:51,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:44:51,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:44:51,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:44:51,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:44:51,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:44:51,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:44:51,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:44:51,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:44:51,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:44:51,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:44:51,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:44:51,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:44:51,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:44:51,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:44:51,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:44:51,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:44:51,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:44:51,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:44:51,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:44:51,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:44:51,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:44:51,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:44:51,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:44:51,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:44:51,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:44:51,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:44:51,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:44:51,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:44:51,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:44:51,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:44:51,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:44:51,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:44:51,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:44:51,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:44:51,297 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:44:51,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:44:51,298 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:44:51,298 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:44:51,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:44:51,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:44:51,300 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:44:51,300 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:44:51,300 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:44:51,300 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:44:51,301 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:44:51,301 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:44:51,301 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:44:51,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:44:51,301 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:44:51,302 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:44:51,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:44:51,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:44:51,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:44:51,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:44:51,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:44:51,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:44:51,303 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:44:51,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:44:51,303 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:44:51,303 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:44:51,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:44:51,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:44:51,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:44:51,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:44:51,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:44:51,304 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:44:51,305 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:44:51,305 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 -> 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b [2021-12-14 23:44:51,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:44:51,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:44:51,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:44:51,503 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:44:51,504 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:44:51,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2021-12-14 23:44:51,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33093c6a9/a89639b4d13c4fb484a9e4202902aaa5/FLAG312128dc7 [2021-12-14 23:44:51,943 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:44:51,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2021-12-14 23:44:51,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33093c6a9/a89639b4d13c4fb484a9e4202902aaa5/FLAG312128dc7 [2021-12-14 23:44:51,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33093c6a9/a89639b4d13c4fb484a9e4202902aaa5 [2021-12-14 23:44:51,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:44:51,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:44:51,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:44:51,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:44:51,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:44:51,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:44:51" (1/1) ... [2021-12-14 23:44:51,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32274597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:51, skipping insertion in model container [2021-12-14 23:44:51,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:44:51" (1/1) ... [2021-12-14 23:44:51,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:44:51,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:44:52,160 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/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2021-12-14 23:44:52,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:44:52,166 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:44:52,200 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/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2021-12-14 23:44:52,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:44:52,210 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:44:52,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52 WrapperNode [2021-12-14 23:44:52,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:44:52,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:44:52,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:44:52,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:44:52,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,252 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2021-12-14 23:44:52,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:44:52,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:44:52,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:44:52,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:44:52,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:44:52,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:44:52,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:44:52,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:44:52,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (1/1) ... [2021-12-14 23:44:52,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:52,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:52,327 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-14 23:44:52,337 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-14 23:44:52,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:44:52,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:44:52,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:44:52,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:44:52,443 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:44:52,444 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:44:52,779 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:44:52,785 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:44:52,785 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 23:44:52,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:44:52 BoogieIcfgContainer [2021-12-14 23:44:52,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:44:52,787 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:44:52,787 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:44:52,790 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:44:52,790 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:44:52,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:44:51" (1/3) ... [2021-12-14 23:44:52,791 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18281244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:44:52, skipping insertion in model container [2021-12-14 23:44:52,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:44:52,791 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:52" (2/3) ... [2021-12-14 23:44:52,792 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18281244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:44:52, skipping insertion in model container [2021-12-14 23:44:52,792 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:44:52,792 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:44:52" (3/3) ... [2021-12-14 23:44:52,793 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2021-12-14 23:44:52,818 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:44:52,819 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:44:52,819 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:44:52,819 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:44:52,819 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:44:52,819 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:44:52,819 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:44:52,819 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:44:52,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 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-14 23:44:52,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-14 23:44:52,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:44:52,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:44:52,855 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:52,855 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:52,855 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:44:52,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 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-14 23:44:52,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2021-12-14 23:44:52,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:44:52,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:44:52,863 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:52,863 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:52,868 INFO L791 eck$LassoCheckResult]: Stem: 120#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 95#L228true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 51#L231-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 34#L241true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 30#L244-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 61#L254true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 64#L257-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 27#L267true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 15#L270-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 102#L280true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 81#L283-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 119#L293true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 79#L296-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 129#L306true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 116#L306-1true init_#res#1 := init_~tmp___5~0#1; 111#L415true main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 53#L509true assume !(0 == main_~i2~0#1); 90#L509-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 35#L523-2true [2021-12-14 23:44:52,868 INFO L793 eck$LassoCheckResult]: Loop: 35#L523-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 70#L75true assume !(0 != ~mode1~0 % 256); 66#L100true assume !(~r1~0 < 2); 84#L100-1true ~mode1~0 := 1; 117#L75-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 101#L118true assume !(0 != ~mode2~0 % 256); 105#L143true assume !(~r2~0 < 2); 96#L143-1true ~mode2~0 := 1; 67#L118-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 14#L161true assume !(0 != ~mode3~0 % 256); 74#L186true assume !(~r3~0 < 2); 29#L186-1true ~mode3~0 := 1; 6#L161-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 21#L423true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 71#L423-1true check_#res#1 := check_~tmp~1#1; 28#L471true main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 87#L553true assume !(0 == assert_~arg#1 % 256); 72#L548true assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 35#L523-2true [2021-12-14 23:44:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:52,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2021-12-14 23:44:52,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:44:52,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293581490] [2021-12-14 23:44:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:44:52,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:44:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:44:53,076 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-14 23:44:53,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:44:53,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293581490] [2021-12-14 23:44:53,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293581490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:44:53,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:44:53,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:44:53,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922075909] [2021-12-14 23:44:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:44:53,090 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:44:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1518597457, now seen corresponding path program 1 times [2021-12-14 23:44:53,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:44:53,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130928892] [2021-12-14 23:44:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:44:53,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:44:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:44:53,181 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-14 23:44:53,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:44:53,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130928892] [2021-12-14 23:44:53,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130928892] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:44:53,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:44:53,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:44:53,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772960923] [2021-12-14 23:44:53,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:44:53,186 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:44:53,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:44:53,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:44:53,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:44:53,216 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:44:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:44:53,270 INFO L93 Difference]: Finished difference Result 134 states and 226 transitions. [2021-12-14 23:44:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 23:44:53,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 226 transitions. [2021-12-14 23:44:53,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-14 23:44:53,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 125 states and 210 transitions. [2021-12-14 23:44:53,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-14 23:44:53,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-14 23:44:53,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 210 transitions. [2021-12-14 23:44:53,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:44:53,282 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-12-14 23:44:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 210 transitions. [2021-12-14 23:44:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-14 23:44:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 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-14 23:44:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 210 transitions. [2021-12-14 23:44:53,310 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-12-14 23:44:53,310 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2021-12-14 23:44:53,310 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:44:53,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 210 transitions. [2021-12-14 23:44:53,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-14 23:44:53,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:44:53,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:44:53,313 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:53,313 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:53,313 INFO L791 eck$LassoCheckResult]: Stem: 405#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 354#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 360#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 337#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 295#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 335#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 345#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 331#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 299#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 309#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 381#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 386#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 347#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 385#L306 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 284#L306-1 init_#res#1 := init_~tmp___5~0#1; 403#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 362#L509 assume !(0 == main_~i2~0#1); 363#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 338#L523-2 [2021-12-14 23:44:53,313 INFO L793 eck$LassoCheckResult]: Loop: 338#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 339#L75 assume !(0 != ~mode1~0 % 256); 375#L100 assume !(~r1~0 < 2); 355#L100-1 ~mode1~0 := 1; 328#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 395#L118 assume !(0 != ~mode2~0 % 256); 396#L143 assume !(~r2~0 < 2); 350#L143-1 ~mode2~0 := 1; 377#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 306#L161 assume !(0 != ~mode3~0 % 256); 308#L186 assume !(~r3~0 < 2); 334#L186-1 ~mode3~0 := 1; 287#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 288#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 319#L424 assume ~st1~0 + ~nl1~0 <= 1; 401#L425 assume ~st2~0 + ~nl2~0 <= 1; 402#L426 assume ~st3~0 + ~nl3~0 <= 1; 394#L427 assume ~r1~0 >= 2; 311#L431 assume ~r1~0 < 2; 351#L436 assume ~r1~0 >= 2; 322#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 323#L423-1 check_#res#1 := check_~tmp~1#1; 332#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 333#L553 assume !(0 == assert_~arg#1 % 256); 379#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 338#L523-2 [2021-12-14 23:44:53,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2021-12-14 23:44:53,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:44:53,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888856972] [2021-12-14 23:44:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:44:53,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:44:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:44:53,355 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-14 23:44:53,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:44:53,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888856972] [2021-12-14 23:44:53,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888856972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:44:53,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:44:53,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 23:44:53,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540746055] [2021-12-14 23:44:53,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:44:53,356 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:44:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:53,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 1 times [2021-12-14 23:44:53,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:44:53,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712652756] [2021-12-14 23:44:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:44:53,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:44:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:44:53,389 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-14 23:44:53,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:44:53,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712652756] [2021-12-14 23:44:53,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712652756] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:44:53,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:44:53,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:44:53,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282692342] [2021-12-14 23:44:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:44:53,392 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:44:53,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:44:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 23:44:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 23:44:53,393 INFO L87 Difference]: Start difference. First operand 125 states and 210 transitions. cyclomatic complexity: 86 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:44:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:44:53,461 INFO L93 Difference]: Finished difference Result 196 states and 320 transitions. [2021-12-14 23:44:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 23:44:53,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 320 transitions. [2021-12-14 23:44:53,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-14 23:44:53,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 193 states and 291 transitions. [2021-12-14 23:44:53,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2021-12-14 23:44:53,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2021-12-14 23:44:53,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 291 transitions. [2021-12-14 23:44:53,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:44:53,478 INFO L681 BuchiCegarLoop]: Abstraction has 193 states and 291 transitions. [2021-12-14 23:44:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 291 transitions. [2021-12-14 23:44:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2021-12-14 23:44:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 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-14 23:44:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2021-12-14 23:44:53,485 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2021-12-14 23:44:53,485 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2021-12-14 23:44:53,485 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:44:53,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 183 transitions. [2021-12-14 23:44:53,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2021-12-14 23:44:53,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:44:53,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:44:53,491 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:53,492 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:53,493 INFO L791 eck$LassoCheckResult]: Stem: 739#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 688#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 694#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 671#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 628#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 668#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 679#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 664#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 632#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 642#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 715#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 721#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 681#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 719#L306 assume ~id1~0 != ~id2~0; 723#L307 assume ~id1~0 != ~id3~0; 637#L308 assume ~id2~0 != ~id3~0; 638#L309 assume ~id1~0 >= 0; 722#L310 assume ~id2~0 >= 0; 701#L311 assume ~id3~0 >= 0; 702#L312 assume 0 == ~r1~0; 662#L313 assume 0 == ~r2~0; 663#L314 assume 0 == ~r3~0; 692#L315 assume 0 != init_~r122~0#1 % 256; 693#L316 assume 0 != init_~r132~0#1 % 256; 618#L317 assume 0 != init_~r212~0#1 % 256; 619#L318 assume 0 != init_~r232~0#1 % 256; 740#L319 assume 0 != init_~r312~0#1 % 256; 727#L320 assume 0 != init_~r322~0#1 % 256; 717#L321 assume ~max1~0 == ~id1~0; 718#L322 assume ~max2~0 == ~id2~0; 616#L323 assume ~max3~0 == ~id3~0; 617#L324 assume 0 == ~st1~0; 645#L325 assume 0 == ~st2~0; 670#L326 assume 0 == ~st3~0; 653#L327 assume 0 == ~nl1~0; 654#L328 assume 0 == ~nl2~0; 682#L329 assume 0 == ~nl3~0; 683#L330 assume 0 == ~mode1~0 % 256; 635#L331 assume 0 == ~mode2~0 % 256; 636#L332 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 669#L306-1 init_#res#1 := init_~tmp___5~0#1; 737#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 699#L509 assume !(0 == main_~i2~0#1); 700#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 674#L523-2 [2021-12-14 23:44:53,496 INFO L793 eck$LassoCheckResult]: Loop: 674#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 675#L75 assume !(0 != ~mode1~0 % 256); 709#L100 assume !(~r1~0 < 2); 689#L100-1 ~mode1~0 := 1; 661#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 729#L118 assume !(0 != ~mode2~0 % 256); 730#L143 assume !(~r2~0 < 2); 684#L143-1 ~mode2~0 := 1; 711#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 639#L161 assume !(0 != ~mode3~0 % 256); 641#L186 assume !(~r3~0 < 2); 667#L186-1 ~mode3~0 := 1; 620#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 621#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 650#L424 assume ~st1~0 + ~nl1~0 <= 1; 735#L425 assume ~st2~0 + ~nl2~0 <= 1; 736#L426 assume ~st3~0 + ~nl3~0 <= 1; 728#L427 assume ~r1~0 >= 2; 644#L431 assume ~r1~0 < 2; 685#L436 assume ~r1~0 >= 2; 655#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 656#L423-1 check_#res#1 := check_~tmp~1#1; 665#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 666#L553 assume !(0 == assert_~arg#1 % 256); 713#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 674#L523-2 [2021-12-14 23:44:53,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2021-12-14 23:44:53,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:44:53,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777348172] [2021-12-14 23:44:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:44:53,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:44:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:44:53,525 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:44:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:44:53,570 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:44:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 2 times [2021-12-14 23:44:53,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:44:53,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088435349] [2021-12-14 23:44:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:44:53,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:44:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:44:53,596 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-14 23:44:53,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:44:53,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088435349] [2021-12-14 23:44:53,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088435349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:44:53,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:44:53,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:44:53,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80341093] [2021-12-14 23:44:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:44:53,597 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:44:53,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:44:53,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:44:53,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:44:53,597 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:44:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:44:53,622 INFO L93 Difference]: Finished difference Result 176 states and 259 transitions. [2021-12-14 23:44:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:44:53,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 259 transitions. [2021-12-14 23:44:53,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2021-12-14 23:44:53,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 176 states and 259 transitions. [2021-12-14 23:44:53,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 176 [2021-12-14 23:44:53,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2021-12-14 23:44:53,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 176 states and 259 transitions. [2021-12-14 23:44:53,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:44:53,628 INFO L681 BuchiCegarLoop]: Abstraction has 176 states and 259 transitions. [2021-12-14 23:44:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states and 259 transitions. [2021-12-14 23:44:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-12-14 23:44:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 175 states have internal predecessors, (259), 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-14 23:44:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 259 transitions. [2021-12-14 23:44:53,640 INFO L704 BuchiCegarLoop]: Abstraction has 176 states and 259 transitions. [2021-12-14 23:44:53,640 INFO L587 BuchiCegarLoop]: Abstraction has 176 states and 259 transitions. [2021-12-14 23:44:53,640 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:44:53,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 259 transitions. [2021-12-14 23:44:53,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2021-12-14 23:44:53,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:44:53,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:44:53,651 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:53,651 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:44:53,651 INFO L791 eck$LassoCheckResult]: Stem: 1052#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 994#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1000#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 977#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 935#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 975#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 985#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 970#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 939#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 949#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1022#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1029#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 987#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1027#L306 assume ~id1~0 != ~id2~0; 1031#L307 assume ~id1~0 != ~id3~0; 944#L308 assume ~id2~0 != ~id3~0; 945#L309 assume ~id1~0 >= 0; 1030#L310 assume ~id2~0 >= 0; 1007#L311 assume ~id3~0 >= 0; 1008#L312 assume 0 == ~r1~0; 968#L313 assume 0 == ~r2~0; 969#L314 assume 0 == ~r3~0; 996#L315 assume 0 != init_~r122~0#1 % 256; 997#L316 assume 0 != init_~r132~0#1 % 256; 925#L317 assume 0 != init_~r212~0#1 % 256; 926#L318 assume 0 != init_~r232~0#1 % 256; 1055#L319 assume 0 != init_~r312~0#1 % 256; 1036#L320 assume 0 != init_~r322~0#1 % 256; 1025#L321 assume ~max1~0 == ~id1~0; 1026#L322 assume ~max2~0 == ~id2~0; 923#L323 assume ~max3~0 == ~id3~0; 924#L324 assume 0 == ~st1~0; 950#L325 assume 0 == ~st2~0; 976#L326 assume 0 == ~st3~0; 960#L327 assume 0 == ~nl1~0; 961#L328 assume 0 == ~nl2~0; 988#L329 assume 0 == ~nl3~0; 989#L330 assume 0 == ~mode1~0 % 256; 942#L331 assume 0 == ~mode2~0 % 256; 943#L332 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 974#L306-1 init_#res#1 := init_~tmp___5~0#1; 1050#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 1002#L509 assume !(0 == main_~i2~0#1); 1003#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1035#L523-2 [2021-12-14 23:44:53,651 INFO L793 eck$LassoCheckResult]: Loop: 1035#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 1057#L75 assume !(0 != ~mode1~0 % 256); 1056#L100 assume ~r1~0 < 2; 1053#L101 assume !(0 != ~ep12~0 % 256); 999#L101-2 assume !(0 != ~ep13~0 % 256); 995#L100-1 ~mode1~0 := 1; 967#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 1040#L118 assume !(0 != ~mode2~0 % 256); 1041#L143 assume !(~r2~0 < 2); 990#L143-1 ~mode2~0 := 1; 1018#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 946#L161 assume !(0 != ~mode3~0 % 256); 948#L186 assume !(~r3~0 < 2); 1070#L186-1 ~mode3~0 := 1; 1068#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1067#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1066#L424 assume ~st1~0 + ~nl1~0 <= 1; 1065#L425 assume ~st2~0 + ~nl2~0 <= 1; 1064#L426 assume ~st3~0 + ~nl3~0 <= 1; 1063#L427 assume !(~r1~0 >= 2); 951#L430 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 952#L431 assume ~r1~0 < 2; 1062#L436 assume !(~r1~0 >= 2); 1044#L440 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1045#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1061#L423-1 check_#res#1 := check_~tmp~1#1; 1060#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1059#L553 assume !(0 == assert_~arg#1 % 256); 1058#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 1035#L523-2 [2021-12-14 23:44:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2021-12-14 23:44:53,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:44:53,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479080674] [2021-12-14 23:44:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:44:53,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:44:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:44:53,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:44:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:44:53,715 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:44:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash -480396747, now seen corresponding path program 1 times [2021-12-14 23:44:53,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:44:53,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082893559] [2021-12-14 23:44:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:44:53,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:44:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:44:53,728 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:44:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:44:53,734 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:44:53,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash 472050935, now seen corresponding path program 1 times [2021-12-14 23:44:53,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:44:53,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527752948] [2021-12-14 23:44:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:44:53,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:44:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:44:53,773 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-14 23:44:53,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:44:53,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527752948] [2021-12-14 23:44:53,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527752948] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:44:53,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:44:53,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:44:53,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652959297] [2021-12-14 23:44:53,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:44:54,213 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:44:54,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:44:54,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:44:54,213 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:44:54,214 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-14 23:44:54,214 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:54,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:44:54,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:44:54,214 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-12-14 23:44:54,214 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:44:54,214 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:44:54,235 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-14 23:44:54,239 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-14 23:44:54,243 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-14 23:44:54,250 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-14 23:44:54,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-14 23:44:54,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-14 23:44:54,255 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-14 23:44:54,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-14 23:44:54,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-14 23:44:54,263 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-14 23:44:54,267 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-14 23:44:54,269 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-14 23:44:54,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:44:54,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:44:54,279 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-14 23:44:54,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:44:54,294 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-14 23:44:54,299 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-14 23:44:54,300 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-14 23:44:54,302 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-14 23:44:54,305 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-14 23:44:54,558 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:44:54,558 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-14 23:44:54,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:54,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:54,561 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-14 23:44:54,575 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-14 23:44:54,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-14 23:44:54,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-14 23:44:54,601 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-14 23:44:54,602 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-14 23:44:54,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-14 23:44:54,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:54,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:54,621 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-14 23:44:54,622 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-14 23:44:54,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-14 23:44:54,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-14 23:44:54,671 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-14 23:44:54,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:54,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:54,673 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-14 23:44:54,674 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-14 23:44:54,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-14 23:44:54,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-14 23:44:54,751 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-14 23:44:54,755 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-14 23:44:54,755 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:44:54,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:44:54,755 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:44:54,755 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:44:54,755 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:44:54,755 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:54,755 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:44:54,756 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:44:54,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-12-14 23:44:54,756 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:44:54,756 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:44:54,757 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-14 23:44:54,768 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-14 23:44:54,771 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-14 23:44:54,778 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-14 23:44:54,780 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-14 23:44:54,782 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-14 23:44:54,785 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-14 23:44:54,787 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-14 23:44:54,789 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-14 23:44:54,792 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-14 23:44:54,794 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-14 23:44:54,796 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-14 23:44:54,800 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-14 23:44:54,801 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-14 23:44:54,803 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-14 23:44:54,808 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-14 23:44:54,809 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-14 23:44:54,813 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-14 23:44:54,817 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-14 23:44:54,818 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-14 23:44:54,820 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-14 23:44:55,082 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:44:55,085 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:44:55,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:55,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:55,087 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-14 23:44:55,091 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-14 23:44:55,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:44:55,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:44:55,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:44:55,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:44:55,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:44:55,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:44:55,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:44:55,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:44:55,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:44:55,124 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-14 23:44:55,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:55,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:55,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:44:55,126 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-14 23:44:55,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:44:55,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:44:55,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:44:55,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:44:55,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:44:55,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:44:55,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:44:55,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:44:55,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:44:55,152 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-14 23:44:55,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:55,192 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-14 23:44:55,193 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-14 23:44:55,194 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-14 23:44:55,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:44:55,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:44:55,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:44:55,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:44:55,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:44:55,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:44:55,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:44:55,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:44:55,218 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-14 23:44:55,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:55,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:55,220 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-14 23:44:55,221 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-14 23:44:55,222 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-14 23:44:55,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:44:55,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:44:55,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:44:55,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:44:55,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:44:55,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:44:55,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:44:55,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:44:55,247 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-14 23:44:55,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:55,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:55,248 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-14 23:44:55,250 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-14 23:44:55,251 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-14 23:44:55,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:44:55,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:44:55,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:44:55,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:44:55,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:44:55,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:44:55,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:44:55,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:44:55,283 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-14 23:44:55,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:55,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:55,285 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:44:55,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-14 23:44:55,286 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-14 23:44:55,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:44:55,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:44:55,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:44:55,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:44:55,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:44:55,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:44:55,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:44:55,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:44:55,304 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-14 23:44:55,304 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-14 23:44:55,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:44:55,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:44:55,306 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:44:55,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-14 23:44:55,308 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:44:55,308 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-14 23:44:55,308 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:44:55,308 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2021-12-14 23:44:55,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-14 23:44:55,337 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-14 23:44:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:44:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:44:55,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:44:55,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:44:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:44:55,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:44:55,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:44:55,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-14 23:44:55,648 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-14 23:44:55,652 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-14 23:44:55,652 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 259 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-14 23:44:55,694 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 259 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 294 states and 443 transitions. Complement of second has 4 states. [2021-12-14 23:44:55,695 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-14 23:44:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-14 23:44:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2021-12-14 23:44:55,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 29 letters. [2021-12-14 23:44:55,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:44:55,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 74 letters. Loop has 29 letters. [2021-12-14 23:44:55,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:44:55,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 58 letters. [2021-12-14 23:44:55,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:44:55,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 443 transitions. [2021-12-14 23:44:55,703 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:44:55,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 0 states and 0 transitions. [2021-12-14 23:44:55,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-14 23:44:55,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-14 23:44:55,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-14 23:44:55,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:44:55,703 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:44:55,703 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:44:55,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:44:55,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:44:55,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:44:55,704 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-14 23:44:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:44:55,704 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-12-14 23:44:55,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 23:44:55,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-12-14 23:44:55,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:44:55,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 23:44:55,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-14 23:44:55,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-14 23:44:55,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-14 23:44:55,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:44:55,709 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:44:55,709 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:44:55,709 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:44:55,709 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:44:55,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-14 23:44:55,709 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:44:55,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-14 23:44:55,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:44:55 BoogieIcfgContainer [2021-12-14 23:44:55,716 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:44:55,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:44:55,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:44:55,717 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:44:55,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:44:52" (3/4) ... [2021-12-14 23:44:55,721 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 23:44:55,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:44:55,721 INFO L158 Benchmark]: Toolchain (without parser) took 3761.50ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 61.1MB in the beginning and 95.1MB in the end (delta: -34.0MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2021-12-14 23:44:55,722 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 50.4MB in the beginning and 50.3MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:44:55,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.22ms. Allocated memory is still 92.3MB. Free memory was 60.9MB in the beginning and 63.5MB in the end (delta: -2.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 23:44:55,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.63ms. Allocated memory is still 92.3MB. Free memory was 63.5MB in the beginning and 60.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:44:55,728 INFO L158 Benchmark]: Boogie Preprocessor took 29.05ms. Allocated memory is still 92.3MB. Free memory was 60.6MB in the beginning and 58.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:44:55,729 INFO L158 Benchmark]: RCFGBuilder took 498.37ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 58.5MB in the beginning and 78.2MB in the end (delta: -19.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2021-12-14 23:44:55,730 INFO L158 Benchmark]: BuchiAutomizer took 2928.84ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 78.2MB in the beginning and 95.1MB in the end (delta: -16.8MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2021-12-14 23:44:55,730 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 134.2MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:44:55,731 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.15ms. Allocated memory is still 92.3MB. Free memory was 50.4MB in the beginning and 50.3MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.22ms. Allocated memory is still 92.3MB. Free memory was 60.9MB in the beginning and 63.5MB in the end (delta: -2.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.63ms. Allocated memory is still 92.3MB. Free memory was 63.5MB in the beginning and 60.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.05ms. Allocated memory is still 92.3MB. Free memory was 60.6MB in the beginning and 58.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.37ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 58.5MB in the beginning and 78.2MB in the end (delta: -19.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 2928.84ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 78.2MB in the beginning and 95.1MB in the end (delta: -16.8MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 134.2MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 68 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 176 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 2295 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1507 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 788 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-14 23:44:55,769 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