./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.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 c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:23:11,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:23:11,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:23:11,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:23:11,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:23:11,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:23:11,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:23:11,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:23:11,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:23:11,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:23:11,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:23:11,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:23:11,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:23:11,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:23:11,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:23:11,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:23:11,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:23:11,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:23:11,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:23:11,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:23:11,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:23:11,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:23:11,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:23:11,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:23:11,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:23:11,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:23:11,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:23:11,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:23:11,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:23:11,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:23:11,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:23:11,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:23:11,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:23:11,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:23:11,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:23:11,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:23:11,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:23:11,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:23:11,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:23:11,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:23:11,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:23:11,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:23:11,649 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:23:11,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:23:11,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:23:11,651 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:23:11,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:23:11,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:23:11,652 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:23:11,652 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:23:11,652 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:23:11,652 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:23:11,653 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:23:11,653 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:23:11,653 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:23:11,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:23:11,654 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:23:11,654 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:23:11,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:23:11,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:23:11,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:23:11,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:23:11,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:23:11,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:23:11,655 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:23:11,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:23:11,655 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:23:11,655 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:23:11,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:23:11,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:23:11,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:23:11,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:23:11,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:23:11,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:23:11,657 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:23:11,657 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 -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2021-12-15 17:23:11,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:23:11,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:23:11,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:23:11,851 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:23:11,851 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:23:11,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:23:11,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591588118/cb3ae846a64b4e9c8b3754037bc1a872/FLAG78dfb67e2 [2021-12-15 17:23:12,307 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:23:12,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:23:12,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591588118/cb3ae846a64b4e9c8b3754037bc1a872/FLAG78dfb67e2 [2021-12-15 17:23:12,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591588118/cb3ae846a64b4e9c8b3754037bc1a872 [2021-12-15 17:23:12,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:23:12,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:23:12,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:12,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:23:12,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:23:12,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7fbad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12, skipping insertion in model container [2021-12-15 17:23:12,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:23:12,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:23:12,577 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_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2021-12-15 17:23:12,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:12,585 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:23:12,640 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_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2021-12-15 17:23:12,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:12,653 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:23:12,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12 WrapperNode [2021-12-15 17:23:12,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:12,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:12,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:23:12,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:23:12,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,694 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2021-12-15 17:23:12,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:12,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:23:12,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:23:12,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:23:12,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:23:12,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:23:12,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:23:12,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:23:12,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (1/1) ... [2021-12-15 17:23:12,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:23:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:23:12,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:23:12,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:23:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:23:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:23:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:23:12,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:23:12,869 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:23:12,871 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:23:13,270 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:23:13,276 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:23:13,276 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:23:13,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:13 BoogieIcfgContainer [2021-12-15 17:23:13,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:23:13,278 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:23:13,278 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:23:13,284 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:23:13,284 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:13,284 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:23:12" (1/3) ... [2021-12-15 17:23:13,285 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ecfb15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:13, skipping insertion in model container [2021-12-15 17:23:13,285 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:13,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:12" (2/3) ... [2021-12-15 17:23:13,286 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ecfb15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:13, skipping insertion in model container [2021-12-15 17:23:13,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:13,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:13" (3/3) ... [2021-12-15 17:23:13,287 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:23:13,335 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:23:13,335 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:23:13,335 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:23:13,335 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:23:13,335 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:23:13,335 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:23:13,336 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:23:13,336 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:23:13,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:13,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-12-15 17:23:13,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:13,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:13,399 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-15 17:23:13,400 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-15 17:23:13,400 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:23:13,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:13,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-12-15 17:23:13,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:13,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:13,423 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-15 17:23:13,423 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-15 17:23:13,428 INFO L791 eck$LassoCheckResult]: Stem: 125#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 42#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; 20#L255true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 9#L258-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 22#L268true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 26#L271-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 13#L281true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 48#L284-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 119#L294true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 34#L297-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 75#L307true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 76#L310-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 79#L320true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 87#L323-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 63#L333true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 115#L333-1true init_#res#1 := init_~tmp___5~0#1; 17#L430true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 92#L527true assume !(0 == main_~i2~0#1); 120#L527-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; 19#L541-2true [2021-12-15 17:23:13,434 INFO L793 eck$LassoCheckResult]: Loop: 19#L541-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 53#L79true assume !(0 != ~mode1~0 % 256); 130#L107true assume !(~r1~0 < 2); 126#L107-1true ~mode1~0 := 1; 40#L79-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 58#L130true assume !(0 != ~mode2~0 % 256); 15#L158true assume !(~r2~0 < 2); 90#L158-1true ~mode2~0 := 1; 55#L130-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 95#L181true assume !(0 != ~mode3~0 % 256); 114#L209true assume !(~r3~0 < 2); 137#L209-1true ~mode3~0 := 1; 47#L181-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; 93#L438true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 44#L438-1true check_#res#1 := check_~tmp~1#1; 98#L486true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 128#L571true assume !(0 == assert_~arg#1 % 256); 116#L566true assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 19#L541-2true [2021-12-15 17:23:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1710390244, now seen corresponding path program 1 times [2021-12-15 17:23:13,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:13,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620231047] [2021-12-15 17:23:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:13,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:13,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:13,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620231047] [2021-12-15 17:23:13,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620231047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:13,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:13,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:13,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337626419] [2021-12-15 17:23:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:13,662 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -365412558, now seen corresponding path program 1 times [2021-12-15 17:23:13,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:13,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975006847] [2021-12-15 17:23:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:13,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:13,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:13,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975006847] [2021-12-15 17:23:13,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975006847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:13,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:13,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:13,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72924991] [2021-12-15 17:23:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:13,780 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:13,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:13,805 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 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-15 17:23:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:13,867 INFO L93 Difference]: Finished difference Result 140 states and 235 transitions. [2021-12-15 17:23:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:13,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 235 transitions. [2021-12-15 17:23:13,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2021-12-15 17:23:13,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 131 states and 219 transitions. [2021-12-15 17:23:13,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-12-15 17:23:13,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-12-15 17:23:13,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 219 transitions. [2021-12-15 17:23:13,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:13,878 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2021-12-15 17:23:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 219 transitions. [2021-12-15 17:23:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-15 17:23:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 219 transitions. [2021-12-15 17:23:13,900 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2021-12-15 17:23:13,900 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2021-12-15 17:23:13,900 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:23:13,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 219 transitions. [2021-12-15 17:23:13,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2021-12-15 17:23:13,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:13,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:13,902 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-15 17:23:13,903 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-15 17:23:13,903 INFO L791 eck$LassoCheckResult]: Stem: 424#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 361#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; 324#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 307#L258-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 308#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 332#L271-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 313#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 314#L284-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 368#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 348#L297-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 352#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 370#L310-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 400#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 298#L323-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 389#L333 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 339#L333-1 init_#res#1 := init_~tmp___5~0#1; 318#L430 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 319#L527 assume !(0 == main_~i2~0#1); 412#L527-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; 322#L541-2 [2021-12-15 17:23:13,903 INFO L793 eck$LassoCheckResult]: Loop: 322#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 323#L79 assume !(0 != ~mode1~0 % 256); 377#L107 assume !(~r1~0 < 2); 374#L107-1 ~mode1~0 := 1; 321#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 360#L130 assume !(0 != ~mode2~0 % 256); 316#L158 assume !(~r2~0 < 2); 311#L158-1 ~mode2~0 := 1; 382#L130-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 383#L181 assume !(0 != ~mode3~0 % 256); 413#L209 assume !(~r3~0 < 2); 345#L209-1 ~mode3~0 := 1; 327#L181-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; 367#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 380#L439 assume ~st1~0 + ~nl1~0 <= 1; 381#L440 assume ~st2~0 + ~nl2~0 <= 1; 330#L441 assume ~st3~0 + ~nl3~0 <= 1; 331#L442 assume ~r1~0 >= 2; 340#L446 assume ~r1~0 < 2; 411#L451 assume ~r1~0 >= 2; 295#L456 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 363#L438-1 check_#res#1 := check_~tmp~1#1; 364#L486 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 415#L571 assume !(0 == assert_~arg#1 % 256); 421#L566 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 322#L541-2 [2021-12-15 17:23:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1710390244, now seen corresponding path program 2 times [2021-12-15 17:23:13,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:13,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129479484] [2021-12-15 17:23:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:13,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:13,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:13,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129479484] [2021-12-15 17:23:13,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129479484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:13,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:13,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:13,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334381290] [2021-12-15 17:23:13,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:13,956 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash 630711638, now seen corresponding path program 1 times [2021-12-15 17:23:13,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:13,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293265438] [2021-12-15 17:23:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:13,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:13,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293265438] [2021-12-15 17:23:13,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293265438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:13,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:13,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:13,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451123132] [2021-12-15 17:23:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:13,978 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:13,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:13,979 INFO L87 Difference]: Start difference. First operand 131 states and 219 transitions. cyclomatic complexity: 89 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-15 17:23:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:14,023 INFO L93 Difference]: Finished difference Result 211 states and 344 transitions. [2021-12-15 17:23:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:23:14,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 344 transitions. [2021-12-15 17:23:14,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2021-12-15 17:23:14,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 208 states and 318 transitions. [2021-12-15 17:23:14,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2021-12-15 17:23:14,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2021-12-15 17:23:14,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 318 transitions. [2021-12-15 17:23:14,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:14,028 INFO L681 BuchiCegarLoop]: Abstraction has 208 states and 318 transitions. [2021-12-15 17:23:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 318 transitions. [2021-12-15 17:23:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2021-12-15 17:23:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 130 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 195 transitions. [2021-12-15 17:23:14,032 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 195 transitions. [2021-12-15 17:23:14,032 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 195 transitions. [2021-12-15 17:23:14,032 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:23:14,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 195 transitions. [2021-12-15 17:23:14,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2021-12-15 17:23:14,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:14,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:14,034 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] [2021-12-15 17:23:14,034 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-15 17:23:14,035 INFO L791 eck$LassoCheckResult]: Stem: 779#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 715#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; 679#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 662#L258-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 663#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 687#L271-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 668#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 669#L284-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 722#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 702#L297-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 706#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 724#L310-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 754#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 653#L323-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 743#L333 assume ~id1~0 != ~id2~0; 709#L334 assume ~id1~0 != ~id3~0; 692#L335 assume ~id2~0 != ~id3~0; 693#L336 assume ~id1~0 >= 0; 753#L337 assume ~id2~0 >= 0; 725#L338 assume ~id3~0 >= 0; 726#L339 assume 0 == ~r1~0; 773#L340 assume 0 == ~r2~0; 762#L341 assume 0 == ~r3~0; 710#L342 assume ~max1~0 == ~id1~0; 711#L343 assume ~max2~0 == ~id2~0; 703#L344 assume ~max3~0 == ~id3~0; 704#L345 assume 0 == ~st1~0; 719#L346 assume 0 == ~st2~0; 720#L347 assume 0 == ~st3~0; 777#L348 assume 0 == ~nl1~0; 757#L349 assume 0 == ~nl2~0; 758#L350 assume 0 == ~nl3~0; 746#L351 assume 0 == ~mode1~0 % 256; 747#L352 assume 0 == ~mode2~0 % 256; 769#L353 assume 0 == ~mode3~0 % 256; 738#L354 assume 0 != ~newmax1~0 % 256; 712#L355 assume 0 != ~newmax2~0 % 256; 713#L356 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 760#L333-1 init_#res#1 := init_~tmp___5~0#1; 675#L430 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 676#L527 assume !(0 == main_~i2~0#1); 767#L527-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; 677#L541-2 [2021-12-15 17:23:14,035 INFO L793 eck$LassoCheckResult]: Loop: 677#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 678#L79 assume !(0 != ~mode1~0 % 256); 731#L107 assume !(~r1~0 < 2); 728#L107-1 ~mode1~0 := 1; 674#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 714#L130 assume !(0 != ~mode2~0 % 256); 671#L158 assume !(~r2~0 < 2); 666#L158-1 ~mode2~0 := 1; 734#L130-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 735#L181 assume !(0 != ~mode3~0 % 256); 768#L209 assume !(~r3~0 < 2); 699#L209-1 ~mode3~0 := 1; 682#L181-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; 721#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 736#L439 assume ~st1~0 + ~nl1~0 <= 1; 737#L440 assume ~st2~0 + ~nl2~0 <= 1; 685#L441 assume ~st3~0 + ~nl3~0 <= 1; 686#L442 assume ~r1~0 >= 2; 694#L446 assume ~r1~0 < 2; 766#L451 assume ~r1~0 >= 2; 650#L456 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 717#L438-1 check_#res#1 := check_~tmp~1#1; 718#L486 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 770#L571 assume !(0 == assert_~arg#1 % 256); 776#L566 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 677#L541-2 [2021-12-15 17:23:14,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2116426971, now seen corresponding path program 1 times [2021-12-15 17:23:14,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:14,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748748943] [2021-12-15 17:23:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:14,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:14,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:14,137 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash 630711638, now seen corresponding path program 2 times [2021-12-15 17:23:14,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:14,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064492491] [2021-12-15 17:23:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:14,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:14,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:14,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064492491] [2021-12-15 17:23:14,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064492491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:14,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:14,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:14,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080529454] [2021-12-15 17:23:14,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:14,175 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:14,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:14,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:23:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:23:14,175 INFO L87 Difference]: Start difference. First operand 131 states and 195 transitions. cyclomatic complexity: 65 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-15 17:23:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:14,207 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2021-12-15 17:23:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:23:14,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 282 transitions. [2021-12-15 17:23:14,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2021-12-15 17:23:14,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 282 transitions. [2021-12-15 17:23:14,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2021-12-15 17:23:14,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2021-12-15 17:23:14,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 282 transitions. [2021-12-15 17:23:14,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:14,216 INFO L681 BuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2021-12-15 17:23:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 282 transitions. [2021-12-15 17:23:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-15 17:23:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 189 states have (on average 1.492063492063492) internal successors, (282), 188 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 282 transitions. [2021-12-15 17:23:14,224 INFO L704 BuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2021-12-15 17:23:14,224 INFO L587 BuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2021-12-15 17:23:14,224 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:23:14,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 282 transitions. [2021-12-15 17:23:14,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2021-12-15 17:23:14,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:14,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:14,230 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] [2021-12-15 17:23:14,231 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-15 17:23:14,231 INFO L791 eck$LassoCheckResult]: Stem: 1111#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 1042#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; 1005#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 988#L258-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 989#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1009#L271-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 994#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 995#L284-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 1049#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 1027#L297-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1031#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1051#L310-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1082#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 977#L323-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1070#L333 assume ~id1~0 != ~id2~0; 1034#L334 assume ~id1~0 != ~id3~0; 1018#L335 assume ~id2~0 != ~id3~0; 1019#L336 assume ~id1~0 >= 0; 1081#L337 assume ~id2~0 >= 0; 1052#L338 assume ~id3~0 >= 0; 1053#L339 assume 0 == ~r1~0; 1102#L340 assume 0 == ~r2~0; 1090#L341 assume 0 == ~r3~0; 1035#L342 assume ~max1~0 == ~id1~0; 1036#L343 assume ~max2~0 == ~id2~0; 1028#L344 assume ~max3~0 == ~id3~0; 1029#L345 assume 0 == ~st1~0; 1046#L346 assume 0 == ~st2~0; 1047#L347 assume 0 == ~st3~0; 1108#L348 assume 0 == ~nl1~0; 1085#L349 assume 0 == ~nl2~0; 1086#L350 assume 0 == ~nl3~0; 1073#L351 assume 0 == ~mode1~0 % 256; 1074#L352 assume 0 == ~mode2~0 % 256; 1097#L353 assume 0 == ~mode3~0 % 256; 1065#L354 assume 0 != ~newmax1~0 % 256; 1037#L355 assume 0 != ~newmax2~0 % 256; 1038#L356 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 1088#L333-1 init_#res#1 := init_~tmp___5~0#1; 999#L430 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 1000#L527 assume !(0 == main_~i2~0#1); 1093#L527-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; 1109#L541-2 [2021-12-15 17:23:14,231 INFO L793 eck$LassoCheckResult]: Loop: 1109#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 1159#L79 assume !(0 != ~mode1~0 % 256); 1158#L107 assume ~r1~0 < 2; 1015#L108 assume !(0 != ~ep12~0 % 256); 1016#L108-1 assume !(0 != ~ep13~0 % 256); 1055#L107-1 ~mode1~0 := 1; 1152#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 1151#L130 assume !(0 != ~mode2~0 % 256); 1137#L158 assume !(~r2~0 < 2); 1133#L158-1 ~mode2~0 := 1; 1132#L130-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 1127#L181 assume !(0 != ~mode3~0 % 256); 1125#L209 assume !(~r3~0 < 2); 1120#L209-1 ~mode3~0 := 1; 1119#L181-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; 1118#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1117#L439 assume ~st1~0 + ~nl1~0 <= 1; 1116#L440 assume ~st2~0 + ~nl2~0 <= 1; 1115#L441 assume ~st3~0 + ~nl3~0 <= 1; 1114#L442 assume !(~r1~0 >= 2); 1040#L445 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1041#L446 assume ~r1~0 < 2; 1113#L451 assume !(~r1~0 >= 2); 978#L455 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 979#L456 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1163#L438-1 check_#res#1 := check_~tmp~1#1; 1162#L486 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 1161#L571 assume !(0 == assert_~arg#1 % 256); 1160#L566 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 1109#L541-2 [2021-12-15 17:23:14,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:14,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2116426971, now seen corresponding path program 2 times [2021-12-15 17:23:14,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:14,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438835759] [2021-12-15 17:23:14,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:14,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:14,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:14,282 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1466264639, now seen corresponding path program 1 times [2021-12-15 17:23:14,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:14,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169748741] [2021-12-15 17:23:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:14,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:14,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:14,296 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1977070365, now seen corresponding path program 1 times [2021-12-15 17:23:14,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:14,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920016634] [2021-12-15 17:23:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:14,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:23:14,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:14,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920016634] [2021-12-15 17:23:14,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920016634] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:14,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:14,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:14,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49971931] [2021-12-15 17:23:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:14,854 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:834) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:23:14,858 INFO L158 Benchmark]: Toolchain (without parser) took 2525.32ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 93.7MB in the beginning and 103.2MB in the end (delta: -9.4MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2021-12-15 17:23:14,859 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:14,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.03ms. Allocated memory is still 121.6MB. Free memory was 93.4MB in the beginning and 90.3MB in the end (delta: 3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:23:14,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.55ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 87.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:14,860 INFO L158 Benchmark]: Boogie Preprocessor took 33.16ms. Allocated memory is still 121.6MB. Free memory was 87.3MB in the beginning and 85.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:14,860 INFO L158 Benchmark]: RCFGBuilder took 545.14ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 61.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:14,861 INFO L158 Benchmark]: BuchiAutomizer took 1578.94ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 61.2MB in the beginning and 103.2MB in the end (delta: -41.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2021-12-15 17:23:14,862 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 121.6MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.03ms. Allocated memory is still 121.6MB. Free memory was 93.4MB in the beginning and 90.3MB in the end (delta: 3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.55ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 87.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.16ms. Allocated memory is still 121.6MB. Free memory was 87.3MB in the beginning and 85.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.14ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 61.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 1578.94ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 61.2MB in the beginning and 103.2MB in the end (delta: -41.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:23:14,891 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable