./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.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_lcr.4_overflow.ufo.UNBOUNDED.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 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:59,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:59,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:59,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:59,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:59,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:59,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:59,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:59,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:59,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:59,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:59,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:59,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:59,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:59,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:59,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:59,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:59,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:59,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:59,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:59,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:59,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:59,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:59,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:59,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:59,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:59,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:59,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:59,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:59,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:59,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:59,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:59,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:59,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:59,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:59,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:59,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:59,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:59,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:59,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:59,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:59,484 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:22:59,505 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:59,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:59,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:59,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:59,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:59,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:59,507 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:59,508 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:59,508 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:59,508 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:59,508 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:59,509 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:59,509 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:59,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:59,509 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:59,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:59,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:59,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:59,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:59,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:59,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:59,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:59,510 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:59,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:59,510 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:59,510 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:59,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:59,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:59,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:59,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:59,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:59,511 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:59,512 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:59,512 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 -> 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db [2021-12-15 17:22:59,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:59,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:59,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:59,763 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:59,765 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:59,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:59,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba070aec1/4bb7e1c69b684c77b4adfff479b8f50f/FLAGaa1f62c8f [2021-12-15 17:23:00,204 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:23:00,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:00,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba070aec1/4bb7e1c69b684c77b4adfff479b8f50f/FLAGaa1f62c8f [2021-12-15 17:23:00,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba070aec1/4bb7e1c69b684c77b4adfff479b8f50f [2021-12-15 17:23:00,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:23:00,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:23:00,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:00,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:23:00,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:23:00,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:00" (1/1) ... [2021-12-15 17:23:00,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380f1193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:00, skipping insertion in model container [2021-12-15 17:23:00,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:00" (1/1) ... [2021-12-15 17:23:00,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:23:00,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:23:00,479 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_lcr.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2021-12-15 17:23:00,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:00,486 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:23:00,522 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_lcr.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2021-12-15 17:23:00,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:00,534 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:23:00,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:00 WrapperNode [2021-12-15 17:23:00,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:00,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:00,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:23:00,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:23:00,540 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:00" (1/1) ... [2021-12-15 17:23:00,561 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:00" (1/1) ... [2021-12-15 17:23:00,583 INFO L137 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 258 [2021-12-15 17:23:00,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:00,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:23:00,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:23:00,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:23:00,591 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:00" (1/1) ... [2021-12-15 17:23:00,591 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:00" (1/1) ... [2021-12-15 17:23:00,593 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:00" (1/1) ... [2021-12-15 17:23:00,593 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:00" (1/1) ... [2021-12-15 17:23:00,602 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:00" (1/1) ... [2021-12-15 17:23:00,605 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:00" (1/1) ... [2021-12-15 17:23:00,606 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:00" (1/1) ... [2021-12-15 17:23:00,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:23:00,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:23:00,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:23:00,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:23:00,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:00" (1/1) ... [2021-12-15 17:23:00,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:23:00,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:23:00,642 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:00,645 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:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:23:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:23:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:23:00,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:23:00,770 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:23:00,771 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:23:00,992 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:23:00,998 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:23:00,999 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:23:01,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:01 BoogieIcfgContainer [2021-12-15 17:23:01,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:23:01,003 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:23:01,003 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:23:01,007 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:23:01,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:01,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:23:00" (1/3) ... [2021-12-15 17:23:01,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6735dfa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:01, skipping insertion in model container [2021-12-15 17:23:01,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:01,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:00" (2/3) ... [2021-12-15 17:23:01,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6735dfa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:01, skipping insertion in model container [2021-12-15 17:23:01,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:01,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:01" (3/3) ... [2021-12-15 17:23:01,010 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:01,057 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:23:01,057 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:23:01,057 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:23:01,058 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:23:01,058 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:23:01,058 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:23:01,058 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:23:01,058 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:23:01,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 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:01,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-12-15 17:23:01,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:01,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:01,101 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:01,101 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] [2021-12-15 17:23:01,101 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:23:01,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 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:01,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-12-15 17:23:01,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:01,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:01,114 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:01,114 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] [2021-12-15 17:23:01,120 INFO L791 eck$LassoCheckResult]: Stem: 61#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, 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~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 26#L166true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 14#L166-1true init_#res#1 := init_~tmp~0#1; 5#L259true main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 60#L24true assume !(0 == assume_abort_if_not_~cond#1); 15#L23true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 42#L325-2true [2021-12-15 17:23:01,123 INFO L793 eck$LassoCheckResult]: Loop: 42#L325-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 44#L66true assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 75#L70true assume !(node1_~m1~0#1 != ~nomsg~0); 30#L70-1true ~mode1~0 := 0; 50#L66-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 52#L92true assume !(0 != ~mode2~0 % 256); 19#L105true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 51#L105-2true ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 71#L92-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 11#L117true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 57#L120true assume !(node3_~m3~0#1 != ~nomsg~0); 58#L120-1true ~mode3~0 := 0; 25#L117-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 40#L142true assume !(0 != ~mode4~0 % 256); 59#L155true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 36#L155-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 32#L142-2true assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 27#L267true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 45#L267-1true check_#res#1 := check_~tmp~1#1; 73#L287true main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 6#L351true assume !(0 == assert_~arg#1 % 256); 56#L346true assume { :end_inline_assert } true; 42#L325-2true [2021-12-15 17:23:01,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2021-12-15 17:23:01,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853271567] [2021-12-15 17:23:01,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:01,308 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:01,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:01,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853271567] [2021-12-15 17:23:01,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853271567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:01,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:01,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:01,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432284683] [2021-12-15 17:23:01,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:01,315 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1219507551, now seen corresponding path program 1 times [2021-12-15 17:23:01,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883363427] [2021-12-15 17:23:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:01,459 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:01,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:01,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883363427] [2021-12-15 17:23:01,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883363427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:01,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:01,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:01,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273086536] [2021-12-15 17:23:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:01,461 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:01,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:01,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:01,486 INFO L87 Difference]: Start difference. First operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 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 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:01,554 INFO L93 Difference]: Finished difference Result 75 states and 122 transitions. [2021-12-15 17:23:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:01,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 122 transitions. [2021-12-15 17:23:01,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-12-15 17:23:01,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 71 states and 96 transitions. [2021-12-15 17:23:01,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-12-15 17:23:01,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-12-15 17:23:01,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 96 transitions. [2021-12-15 17:23:01,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:01,578 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2021-12-15 17:23:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 96 transitions. [2021-12-15 17:23:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-15 17:23:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 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:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2021-12-15 17:23:01,610 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2021-12-15 17:23:01,611 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2021-12-15 17:23:01,611 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:23:01,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2021-12-15 17:23:01,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-12-15 17:23:01,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:01,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:01,615 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] [2021-12-15 17:23:01,616 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] [2021-12-15 17:23:01,617 INFO L791 eck$LassoCheckResult]: Stem: 235#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 228#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, 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~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 212#L166 assume 0 == ~r1~0 % 256; 203#L167 assume ~id1~0 >= 0; 181#L168 assume 0 == ~st1~0; 182#L169 assume ~send1~0 == ~id1~0; 239#L170 assume 0 == ~mode1~0 % 256; 233#L171 assume ~id2~0 >= 0; 229#L172 assume 0 == ~st2~0; 230#L173 assume ~send2~0 == ~id2~0; 237#L174 assume 0 == ~mode2~0 % 256; 177#L175 assume ~id3~0 >= 0; 178#L176 assume 0 == ~st3~0; 234#L177 assume ~send3~0 == ~id3~0; 218#L178 assume 0 == ~mode3~0 % 256; 219#L179 assume ~id4~0 >= 0; 169#L180 assume 0 == ~st4~0; 170#L181 assume ~send4~0 == ~id4~0; 215#L182 assume 0 == ~mode4~0 % 256; 217#L183 assume ~id1~0 != ~id2~0; 194#L184 assume ~id1~0 != ~id3~0; 195#L185 assume ~id1~0 != ~id4~0; 221#L186 assume ~id2~0 != ~id3~0; 236#L187 assume ~id2~0 != ~id4~0; 196#L188 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 189#L166-1 init_#res#1 := init_~tmp~0#1; 173#L259 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 174#L24 assume !(0 == assume_abort_if_not_~cond#1); 192#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 193#L325-2 [2021-12-15 17:23:01,617 INFO L793 eck$LassoCheckResult]: Loop: 193#L325-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 225#L66 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 226#L70 assume !(node1_~m1~0#1 != ~nomsg~0); 180#L70-1 ~mode1~0 := 0; 199#L66-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 232#L92 assume !(0 != ~mode2~0 % 256); 197#L105 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 198#L105-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 222#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 183#L117 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 184#L120 assume !(node3_~m3~0#1 != ~nomsg~0); 191#L120-1 ~mode3~0 := 0; 210#L117-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 211#L142 assume !(0 != ~mode4~0 % 256); 224#L155 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 220#L155-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 216#L142-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 213#L267 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 176#L267-1 check_#res#1 := check_~tmp~1#1; 227#L287 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 171#L351 assume !(0 == assert_~arg#1 % 256); 172#L346 assume { :end_inline_assert } true; 193#L325-2 [2021-12-15 17:23:01,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2021-12-15 17:23:01,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387678199] [2021-12-15 17:23:01,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:01,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:01,683 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1219507551, now seen corresponding path program 2 times [2021-12-15 17:23:01,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892777562] [2021-12-15 17:23:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:01,747 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:01,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:01,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892777562] [2021-12-15 17:23:01,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892777562] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:01,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:01,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:01,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158771837] [2021-12-15 17:23:01,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:01,749 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:01,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:01,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:01,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:01,750 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:01,804 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2021-12-15 17:23:01,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:01,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2021-12-15 17:23:01,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-12-15 17:23:01,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2021-12-15 17:23:01,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-12-15 17:23:01,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-12-15 17:23:01,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2021-12-15 17:23:01,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:01,808 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-12-15 17:23:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2021-12-15 17:23:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-15 17:23:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 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:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2021-12-15 17:23:01,810 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-12-15 17:23:01,811 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-12-15 17:23:01,811 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:23:01,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2021-12-15 17:23:01,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-12-15 17:23:01,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:01,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:01,812 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] [2021-12-15 17:23:01,812 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] [2021-12-15 17:23:01,812 INFO L791 eck$LassoCheckResult]: Stem: 392#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 385#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, 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~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 369#L166 assume 0 == ~r1~0 % 256; 360#L167 assume ~id1~0 >= 0; 338#L168 assume 0 == ~st1~0; 339#L169 assume ~send1~0 == ~id1~0; 396#L170 assume 0 == ~mode1~0 % 256; 390#L171 assume ~id2~0 >= 0; 386#L172 assume 0 == ~st2~0; 387#L173 assume ~send2~0 == ~id2~0; 394#L174 assume 0 == ~mode2~0 % 256; 334#L175 assume ~id3~0 >= 0; 335#L176 assume 0 == ~st3~0; 391#L177 assume ~send3~0 == ~id3~0; 375#L178 assume 0 == ~mode3~0 % 256; 376#L179 assume ~id4~0 >= 0; 326#L180 assume 0 == ~st4~0; 327#L181 assume ~send4~0 == ~id4~0; 372#L182 assume 0 == ~mode4~0 % 256; 374#L183 assume ~id1~0 != ~id2~0; 351#L184 assume ~id1~0 != ~id3~0; 352#L185 assume ~id1~0 != ~id4~0; 378#L186 assume ~id2~0 != ~id3~0; 393#L187 assume ~id2~0 != ~id4~0; 353#L188 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 346#L166-1 init_#res#1 := init_~tmp~0#1; 328#L259 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 329#L24 assume !(0 == assume_abort_if_not_~cond#1); 347#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 348#L325-2 [2021-12-15 17:23:01,812 INFO L793 eck$LassoCheckResult]: Loop: 348#L325-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 382#L66 assume !(0 != ~mode1~0 % 256); 344#L80 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 345#L80-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 356#L66-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 389#L92 assume !(0 != ~mode2~0 % 256); 354#L105 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 355#L105-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 379#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 340#L117 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 341#L120 assume !(node3_~m3~0#1 != ~nomsg~0); 350#L120-1 ~mode3~0 := 0; 367#L117-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 368#L142 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 380#L145 assume !(node4_~m4~0#1 != ~nomsg~0); 358#L145-1 ~mode4~0 := 0; 373#L142-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 370#L267 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 364#L268 assume ~r1~0 % 256 >= 4; 365#L272 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 333#L267-1 check_#res#1 := check_~tmp~1#1; 384#L287 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 330#L351 assume !(0 == assert_~arg#1 % 256); 331#L346 assume { :end_inline_assert } true; 348#L325-2 [2021-12-15 17:23:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2021-12-15 17:23:01,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109742872] [2021-12-15 17:23:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:01,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:01,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash 851750321, now seen corresponding path program 1 times [2021-12-15 17:23:01,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87646127] [2021-12-15 17:23:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:01,873 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:01,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:01,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87646127] [2021-12-15 17:23:01,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87646127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:01,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:01,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:01,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010049561] [2021-12-15 17:23:01,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:01,875 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:01,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:01,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:23:01,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:23:01,876 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:01,896 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2021-12-15 17:23:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:23:01,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2021-12-15 17:23:01,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-12-15 17:23:01,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2021-12-15 17:23:01,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2021-12-15 17:23:01,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2021-12-15 17:23:01,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2021-12-15 17:23:01,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:01,899 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-12-15 17:23:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2021-12-15 17:23:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-15 17:23:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 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:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2021-12-15 17:23:01,910 INFO L704 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-12-15 17:23:01,910 INFO L587 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-12-15 17:23:01,910 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:23:01,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2021-12-15 17:23:01,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-12-15 17:23:01,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:01,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:01,911 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] [2021-12-15 17:23:01,911 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:01,911 INFO L791 eck$LassoCheckResult]: Stem: 580#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, 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~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 552#L166 assume 0 == ~r1~0 % 256; 541#L167 assume ~id1~0 >= 0; 520#L168 assume 0 == ~st1~0; 521#L169 assume ~send1~0 == ~id1~0; 584#L170 assume 0 == ~mode1~0 % 256; 576#L171 assume ~id2~0 >= 0; 573#L172 assume 0 == ~st2~0; 574#L173 assume ~send2~0 == ~id2~0; 582#L174 assume 0 == ~mode2~0 % 256; 518#L175 assume ~id3~0 >= 0; 519#L176 assume 0 == ~st3~0; 578#L177 assume ~send3~0 == ~id3~0; 559#L178 assume 0 == ~mode3~0 % 256; 560#L179 assume ~id4~0 >= 0; 510#L180 assume 0 == ~st4~0; 511#L181 assume ~send4~0 == ~id4~0; 555#L182 assume 0 == ~mode4~0 % 256; 558#L183 assume ~id1~0 != ~id2~0; 535#L184 assume ~id1~0 != ~id3~0; 536#L185 assume ~id1~0 != ~id4~0; 562#L186 assume ~id2~0 != ~id3~0; 581#L187 assume ~id2~0 != ~id4~0; 537#L188 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 530#L166-1 init_#res#1 := init_~tmp~0#1; 512#L259 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 513#L24 assume !(0 == assume_abort_if_not_~cond#1); 531#L23 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 532#L325-2 [2021-12-15 17:23:01,911 INFO L793 eck$LassoCheckResult]: Loop: 532#L325-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 614#L66 assume !(0 != ~mode1~0 % 256); 613#L80 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 612#L80-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 556#L66-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 611#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 609#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 605#L95-1 ~mode2~0 := 0; 604#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 603#L117 assume !(0 != ~mode3~0 % 256); 599#L130 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 598#L130-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 596#L117-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 595#L142 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 592#L145 assume !(node4_~m4~0#1 != ~nomsg~0); 590#L145-1 ~mode4~0 := 0; 588#L142-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 587#L267 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 586#L268 assume !(~r1~0 % 256 >= 4); 566#L271 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 567#L272 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 616#L267-1 check_#res#1 := check_~tmp~1#1; 615#L287 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 514#L351 assume !(0 == assert_~arg#1 % 256); 515#L346 assume { :end_inline_assert } true; 532#L325-2 [2021-12-15 17:23:01,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,912 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2021-12-15 17:23:01,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121861431] [2021-12-15 17:23:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:01,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:01,957 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:01,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,958 INFO L85 PathProgramCache]: Analyzing trace with hash -340218129, now seen corresponding path program 1 times [2021-12-15 17:23:01,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795447855] [2021-12-15 17:23:01,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:01,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:01,982 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1298328247, now seen corresponding path program 1 times [2021-12-15 17:23:01,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313405935] [2021-12-15 17:23:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:02,041 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:02,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:02,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313405935] [2021-12-15 17:23:02,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313405935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:02,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:02,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:02,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565254279] [2021-12-15 17:23:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:02,704 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:02,707 INFO L158 Benchmark]: Toolchain (without parser) took 2469.79ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 75.8MB in the beginning and 67.6MB in the end (delta: 8.2MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2021-12-15 17:23:02,708 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 113.2MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:02,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.23ms. Allocated memory is still 113.2MB. Free memory was 75.7MB in the beginning and 84.2MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:23:02,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 113.2MB. Free memory was 84.2MB in the beginning and 82.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:02,709 INFO L158 Benchmark]: Boogie Preprocessor took 26.46ms. Allocated memory is still 113.2MB. Free memory was 82.2MB in the beginning and 80.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:02,709 INFO L158 Benchmark]: RCFGBuilder took 388.79ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 64.0MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 17:23:02,709 INFO L158 Benchmark]: BuchiAutomizer took 1702.44ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 64.0MB in the beginning and 67.6MB in the end (delta: -3.5MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:02,711 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.46ms. Allocated memory is still 113.2MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.23ms. Allocated memory is still 113.2MB. Free memory was 75.7MB in the beginning and 84.2MB in the end (delta: -8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 113.2MB. Free memory was 84.2MB in the beginning and 82.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.46ms. Allocated memory is still 113.2MB. Free memory was 82.2MB in the beginning and 80.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 388.79ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 64.0MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 1702.44ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 64.0MB in the beginning and 67.6MB in the end (delta: -3.5MB). Peak memory consumption was 36.1MB. 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:02,747 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