./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_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.3_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 e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:57,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:57,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:57,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:57,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:57,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:57,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:57,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:57,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:57,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:57,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:57,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:57,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:57,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:57,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:57,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:57,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:57,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:57,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:57,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:57,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:57,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:57,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:57,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:57,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:57,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:57,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:57,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:57,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:57,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:57,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:57,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:57,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:57,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:57,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:57,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:57,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:57,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:57,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:57,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:57,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:57,127 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:57,141 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:57,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:57,145 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:57,145 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:57,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:57,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:57,148 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:57,148 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:57,148 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:57,158 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:57,158 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:57,158 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:57,159 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:57,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:57,159 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:57,159 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:57,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:57,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:57,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:57,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:57,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:57,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:57,161 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:57,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:57,161 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:57,161 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:57,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:57,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:57,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:57,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:57,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:57,162 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:57,163 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:57,163 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 -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2021-12-15 17:22:57,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:57,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:57,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:57,375 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:57,376 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:57,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:57,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99065d9d0/8bfb2edd94f34329a238954f1e9943f7/FLAGf080f164f [2021-12-15 17:22:57,745 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:57,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:57,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99065d9d0/8bfb2edd94f34329a238954f1e9943f7/FLAGf080f164f [2021-12-15 17:22:58,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99065d9d0/8bfb2edd94f34329a238954f1e9943f7 [2021-12-15 17:22:58,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:58,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:58,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:58,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:58,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:58,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bc7a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58, skipping insertion in model container [2021-12-15 17:22:58,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:58,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:58,390 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.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2021-12-15 17:22:58,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:58,397 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:58,445 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.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2021-12-15 17:22:58,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:58,462 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:58,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58 WrapperNode [2021-12-15 17:22:58,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:58,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:58,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:58,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:58,471 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:22:58" (1/1) ... [2021-12-15 17:22:58,488 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:22:58" (1/1) ... [2021-12-15 17:22:58,515 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 206 [2021-12-15 17:22:58,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:58,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:58,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:58,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:58,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:58,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:58,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:58,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:58,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58" (1/1) ... [2021-12-15 17:22:58,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:58,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:58,596 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:22:58,604 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:22:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:58,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:58,730 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:58,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:58,946 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:58,951 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:58,952 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:58,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:58 BoogieIcfgContainer [2021-12-15 17:22:58,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:58,954 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:58,954 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:58,957 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:58,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:58,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:58" (1/3) ... [2021-12-15 17:22:58,961 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c22c3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:58, skipping insertion in model container [2021-12-15 17:22:58,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:58,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:58" (2/3) ... [2021-12-15 17:22:58,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c22c3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:58, skipping insertion in model container [2021-12-15 17:22:58,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:58,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:58" (3/3) ... [2021-12-15 17:22:58,963 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:58,990 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:58,991 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:58,991 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:58,991 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:58,991 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:58,991 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:58,991 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:58,991 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:59,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 60 states have internal predecessors, (100), 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:22:59,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-15 17:22:59,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:59,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:59,044 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:59,045 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:22:59,045 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:59,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 60 states have internal predecessors, (100), 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:22:59,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-15 17:22:59,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:59,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:59,058 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:59,058 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:22:59,065 INFO L791 eck$LassoCheckResult]: Stem: 52#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; 37#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, 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~ret20#1, main_#t~ret21#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~nondet7#1;havoc main_#t~nondet7#1;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 53#L134true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 48#L134-1true init_#res#1 := init_~tmp~0#1; 50#L199true main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#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; 46#L24true assume !(0 == assume_abort_if_not_~cond#1); 13#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;main_~i2~0#1 := 0; 44#L259-2true [2021-12-15 17:22:59,067 INFO L793 eck$LassoCheckResult]: Loop: 44#L259-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; 32#L59true assume !(0 != ~mode1~0 % 256); 26#L73true assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 27#L73-2true ~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; 55#L59-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; 33#L85true assume !(0 != ~mode2~0 % 256); 29#L98true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 14#L98-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; 8#L85-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; 4#L110true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 42#L113true assume !(node3_~m3~0#1 != ~nomsg~0); 16#L113-1true ~mode3~0 := 0; 39#L110-2true assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 10#L207true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 30#L207-1true check_#res#1 := check_~tmp~1#1; 22#L227true main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 5#L282true assume !(0 == assert_~arg#1 % 256); 59#L277true assume { :end_inline_assert } true; 44#L259-2true [2021-12-15 17:22:59,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:59,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2021-12-15 17:22:59,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:59,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775889044] [2021-12-15 17:22:59,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:59,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:59,276 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:22:59,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:59,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775889044] [2021-12-15 17:22:59,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775889044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:59,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:59,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:59,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482888269] [2021-12-15 17:22:59,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:59,283 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1759665830, now seen corresponding path program 1 times [2021-12-15 17:22:59,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:59,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904344422] [2021-12-15 17:22:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:59,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:59,433 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:22:59,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:59,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904344422] [2021-12-15 17:22:59,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904344422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:59,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:59,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:59,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300143298] [2021-12-15 17:22:59,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:59,434 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:59,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:59,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:59,464 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 60 states have internal predecessors, (100), 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:22:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:59,528 INFO L93 Difference]: Finished difference Result 60 states and 95 transitions. [2021-12-15 17:22:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:59,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 95 transitions. [2021-12-15 17:22:59,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-15 17:22:59,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 56 states and 76 transitions. [2021-12-15 17:22:59,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-12-15 17:22:59,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-12-15 17:22:59,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 76 transitions. [2021-12-15 17:22:59,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:59,547 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-15 17:22:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 76 transitions. [2021-12-15 17:22:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-15 17:22:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 55 states have internal predecessors, (76), 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:22:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-12-15 17:22:59,568 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-15 17:22:59,568 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-15 17:22:59,568 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:59,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2021-12-15 17:22:59,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-15 17:22:59,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:59,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:59,574 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] [2021-12-15 17:22:59,574 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:22:59,579 INFO L791 eck$LassoCheckResult]: Stem: 193#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; 187#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, 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~ret20#1, main_#t~ret21#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~nondet7#1;havoc main_#t~nondet7#1;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 188#L134 assume 0 == ~r1~0 % 256; 186#L135 assume ~id1~0 >= 0; 163#L136 assume 0 == ~st1~0; 164#L137 assume ~send1~0 == ~id1~0; 194#L138 assume 0 == ~mode1~0 % 256; 174#L139 assume ~id2~0 >= 0; 175#L140 assume 0 == ~st2~0; 190#L141 assume ~send2~0 == ~id2~0; 181#L142 assume 0 == ~mode2~0 % 256; 177#L143 assume ~id3~0 >= 0; 158#L144 assume 0 == ~st3~0; 159#L145 assume ~send3~0 == ~id3~0; 166#L146 assume 0 == ~mode3~0 % 256; 167#L147 assume ~id1~0 != ~id2~0; 176#L148 assume ~id1~0 != ~id3~0; 170#L149 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 171#L134-1 init_#res#1 := init_~tmp~0#1; 192#L199 main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#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; 191#L24 assume !(0 == assume_abort_if_not_~cond#1); 160#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;main_~i2~0#1 := 0; 161#L259-2 [2021-12-15 17:22:59,579 INFO L793 eck$LassoCheckResult]: Loop: 161#L259-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; 184#L59 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 144#L63 assume !(node1_~m1~0#1 != ~nomsg~0); 145#L63-1 ~mode1~0 := 0; 180#L59-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; 185#L85 assume !(0 != ~mode2~0 % 256); 183#L98 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 162#L98-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; 150#L85-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; 139#L110 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 140#L113 assume !(node3_~m3~0#1 != ~nomsg~0); 152#L113-1 ~mode3~0 := 0; 165#L110-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 153#L207 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 154#L207-1 check_#res#1 := check_~tmp~1#1; 173#L227 main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 142#L282 assume !(0 == assert_~arg#1 % 256); 143#L277 assume { :end_inline_assert } true; 161#L259-2 [2021-12-15 17:22:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2021-12-15 17:22:59,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:59,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921630172] [2021-12-15 17:22:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:59,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:59,605 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:59,655 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash 855687206, now seen corresponding path program 1 times [2021-12-15 17:22:59,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:59,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4232992] [2021-12-15 17:22:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:59,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:59,723 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:22:59,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:59,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4232992] [2021-12-15 17:22:59,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4232992] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:59,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:59,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:59,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752024131] [2021-12-15 17:22:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:59,726 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:59,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:59,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:59,727 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 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:22:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:59,764 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2021-12-15 17:22:59,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:59,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2021-12-15 17:22:59,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-15 17:22:59,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2021-12-15 17:22:59,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-12-15 17:22:59,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-12-15 17:22:59,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2021-12-15 17:22:59,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:59,770 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-15 17:22:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2021-12-15 17:22:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-15 17:22:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 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:22:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2021-12-15 17:22:59,774 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-15 17:22:59,774 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-15 17:22:59,774 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:59,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2021-12-15 17:22:59,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-15 17:22:59,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:59,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:59,775 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] [2021-12-15 17:22:59,775 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] [2021-12-15 17:22:59,776 INFO L791 eck$LassoCheckResult]: Stem: 320#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; 314#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, 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~ret20#1, main_#t~ret21#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~nondet7#1;havoc main_#t~nondet7#1;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 315#L134 assume 0 == ~r1~0 % 256; 313#L135 assume ~id1~0 >= 0; 290#L136 assume 0 == ~st1~0; 291#L137 assume ~send1~0 == ~id1~0; 321#L138 assume 0 == ~mode1~0 % 256; 301#L139 assume ~id2~0 >= 0; 302#L140 assume 0 == ~st2~0; 317#L141 assume ~send2~0 == ~id2~0; 308#L142 assume 0 == ~mode2~0 % 256; 304#L143 assume ~id3~0 >= 0; 285#L144 assume 0 == ~st3~0; 286#L145 assume ~send3~0 == ~id3~0; 293#L146 assume 0 == ~mode3~0 % 256; 294#L147 assume ~id1~0 != ~id2~0; 303#L148 assume ~id1~0 != ~id3~0; 297#L149 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 298#L134-1 init_#res#1 := init_~tmp~0#1; 319#L199 main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#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; 318#L24 assume !(0 == assume_abort_if_not_~cond#1); 287#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;main_~i2~0#1 := 0; 288#L259-2 [2021-12-15 17:22:59,776 INFO L793 eck$LassoCheckResult]: Loop: 288#L259-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; 311#L59 assume !(0 != ~mode1~0 % 256); 305#L73 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 306#L73-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; 307#L59-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; 312#L85 assume !(0 != ~mode2~0 % 256); 310#L98 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 289#L98-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; 277#L85-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; 266#L110 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 267#L113 assume !(node3_~m3~0#1 != ~nomsg~0); 279#L113-1 ~mode3~0 := 0; 292#L110-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 280#L207 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 281#L208 assume ~r1~0 % 256 >= 3; 282#L212 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 283#L207-1 check_#res#1 := check_~tmp~1#1; 300#L227 main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 269#L282 assume !(0 == assert_~arg#1 % 256); 270#L277 assume { :end_inline_assert } true; 288#L259-2 [2021-12-15 17:22:59,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2021-12-15 17:22:59,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:59,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189033306] [2021-12-15 17:22:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:59,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:59,789 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:59,802 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:59,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:59,803 INFO L85 PathProgramCache]: Analyzing trace with hash -237571638, now seen corresponding path program 1 times [2021-12-15 17:22:59,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:59,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116193215] [2021-12-15 17:22:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:59,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:59,825 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:22:59,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:59,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116193215] [2021-12-15 17:22:59,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116193215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:59,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:59,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:59,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647601903] [2021-12-15 17:22:59,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:59,827 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:59,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:59,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:22:59,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:22:59,827 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:59,845 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2021-12-15 17:22:59,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:22:59,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2021-12-15 17:22:59,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-12-15 17:22:59,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2021-12-15 17:22:59,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2021-12-15 17:22:59,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2021-12-15 17:22:59,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2021-12-15 17:22:59,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:59,849 INFO L681 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-15 17:22:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2021-12-15 17:22:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-15 17:22:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 83 states have internal predecessors, (113), 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:22:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-12-15 17:22:59,854 INFO L704 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-15 17:22:59,854 INFO L587 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-15 17:22:59,854 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:59,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2021-12-15 17:22:59,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-12-15 17:22:59,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:59,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:59,855 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:59,855 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:59,856 INFO L791 eck$LassoCheckResult]: Stem: 469#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; 461#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, 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~ret20#1, main_#t~ret21#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~nondet7#1;havoc main_#t~nondet7#1;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 462#L134 assume 0 == ~r1~0 % 256; 460#L135 assume ~id1~0 >= 0; 435#L136 assume 0 == ~st1~0; 436#L137 assume ~send1~0 == ~id1~0; 470#L138 assume 0 == ~mode1~0 % 256; 446#L139 assume ~id2~0 >= 0; 447#L140 assume 0 == ~st2~0; 464#L141 assume ~send2~0 == ~id2~0; 453#L142 assume 0 == ~mode2~0 % 256; 449#L143 assume ~id3~0 >= 0; 430#L144 assume 0 == ~st3~0; 431#L145 assume ~send3~0 == ~id3~0; 438#L146 assume 0 == ~mode3~0 % 256; 439#L147 assume ~id1~0 != ~id2~0; 448#L148 assume ~id1~0 != ~id3~0; 442#L149 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 443#L134-1 init_#res#1 := init_~tmp~0#1; 468#L199 main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#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; 467#L24 assume !(0 == assume_abort_if_not_~cond#1); 433#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;main_~i2~0#1 := 0; 434#L259-2 [2021-12-15 17:22:59,856 INFO L793 eck$LassoCheckResult]: Loop: 434#L259-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; 491#L59 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 421#L63 assume !(node1_~m1~0#1 != ~nomsg~0); 422#L63-1 ~mode1~0 := 0; 466#L59-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; 488#L85 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 485#L88 assume !(node2_~m2~0#1 != ~nomsg~0); 481#L88-1 ~mode2~0 := 0; 479#L85-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; 477#L110 assume !(0 != ~mode3~0 % 256); 476#L123 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 474#L123-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; 473#L110-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 472#L207 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 471#L208 assume !(~r1~0 % 256 >= 3); 455#L211 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 456#L212 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 495#L207-1 check_#res#1 := check_~tmp~1#1; 494#L227 main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 493#L282 assume !(0 == assert_~arg#1 % 256); 492#L277 assume { :end_inline_assert } true; 434#L259-2 [2021-12-15 17:22:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2021-12-15 17:22:59,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:59,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437189947] [2021-12-15 17:22:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:59,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:59,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:59,894 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1410446497, now seen corresponding path program 1 times [2021-12-15 17:22:59,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:59,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011705173] [2021-12-15 17:22:59,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:59,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:59,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:59,909 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1606496161, now seen corresponding path program 1 times [2021-12-15 17:22:59,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:59,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501441689] [2021-12-15 17:22:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:59,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:59,933 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:22:59,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:59,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501441689] [2021-12-15 17:22:59,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501441689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:59,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:59,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:59,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140347792] [2021-12-15 17:22:59,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:00,379 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:00,382 INFO L158 Benchmark]: Toolchain (without parser) took 2205.01ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 43.6MB in the beginning and 36.3MB in the end (delta: 7.3MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2021-12-15 17:23:00,383 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:00,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.08ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 43.4MB in the beginning and 72.3MB in the end (delta: -28.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 17:23:00,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.92ms. Allocated memory is still 104.9MB. Free memory was 72.3MB in the beginning and 70.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:00,384 INFO L158 Benchmark]: Boogie Preprocessor took 48.85ms. Allocated memory is still 104.9MB. Free memory was 70.4MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 17:23:00,385 INFO L158 Benchmark]: RCFGBuilder took 387.87ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 54.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 17:23:00,385 INFO L158 Benchmark]: BuchiAutomizer took 1427.58ms. Allocated memory is still 104.9MB. Free memory was 54.4MB in the beginning and 36.3MB in the end (delta: 18.1MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2021-12-15 17:23:00,387 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.16ms. Allocated memory is still 83.9MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.08ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 43.4MB in the beginning and 72.3MB in the end (delta: -28.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.92ms. Allocated memory is still 104.9MB. Free memory was 72.3MB in the beginning and 70.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.85ms. Allocated memory is still 104.9MB. Free memory was 70.4MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 387.87ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 54.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 1427.58ms. Allocated memory is still 104.9MB. Free memory was 54.4MB in the beginning and 36.3MB in the end (delta: 18.1MB). Peak memory consumption was 20.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:00,461 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