./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.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-var-start-time.3.2.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 850d02aa9cb18294f9975f6e4e447a197934bcfd77c20fda5c55e9f9e3e0a979 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:43,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:43,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:43,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:43,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:43,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:43,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:43,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:43,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:43,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:43,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:43,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:43,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:43,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:43,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:43,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:43,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:43,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:43,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:43,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:43,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:43,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:43,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:43,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:43,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:43,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:43,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:43,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:43,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:43,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:43,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:43,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:43,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:43,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:43,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:43,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:43,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:43,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:43,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:43,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:43,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:43,306 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:43,330 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:43,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:43,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:43,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:43,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:43,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:43,332 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:43,332 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:43,333 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:43,333 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:43,333 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:43,333 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:43,333 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:43,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:43,334 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:43,334 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:43,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:43,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:43,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:43,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:43,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:43,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:43,335 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:43,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:43,335 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:43,336 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:43,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:43,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:43,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:43,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:43,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:43,337 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:43,337 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:43,338 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 -> 850d02aa9cb18294f9975f6e4e447a197934bcfd77c20fda5c55e9f9e3e0a979 [2021-12-15 17:22:43,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:43,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:43,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:43,554 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:43,555 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:43,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:43,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60fcdf0b/898149b9fb87435eb204c3ed883c0396/FLAGd7702af47 [2021-12-15 17:22:44,004 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:44,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:44,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60fcdf0b/898149b9fb87435eb204c3ed883c0396/FLAGd7702af47 [2021-12-15 17:22:44,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60fcdf0b/898149b9fb87435eb204c3ed883c0396 [2021-12-15 17:22:44,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:44,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:44,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:44,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:44,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:44,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:44" (1/1) ... [2021-12-15 17:22:44,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a5dd6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:44, skipping insertion in model container [2021-12-15 17:22:44,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:44" (1/1) ... [2021-12-15 17:22:44,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:44,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:44,604 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-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2021-12-15 17:22:44,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:44,613 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:44,669 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-var-start-time.3.2.ufo.UNBOUNDED.pals.c[6787,6800] [2021-12-15 17:22:44,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:44,690 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:44,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:44 WrapperNode [2021-12-15 17:22:44,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:44,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:44,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:44,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:44,698 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:44" (1/1) ... [2021-12-15 17:22:44,717 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:44" (1/1) ... [2021-12-15 17:22:44,751 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 235 [2021-12-15 17:22:44,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:44,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:44,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:44,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:44,760 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:44" (1/1) ... [2021-12-15 17:22:44,760 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:44" (1/1) ... [2021-12-15 17:22:44,771 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:44" (1/1) ... [2021-12-15 17:22:44,772 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:44" (1/1) ... [2021-12-15 17:22:44,780 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:44" (1/1) ... [2021-12-15 17:22:44,787 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:44" (1/1) ... [2021-12-15 17:22:44,788 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:44" (1/1) ... [2021-12-15 17:22:44,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:44,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:44,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:44,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:44,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:44" (1/1) ... [2021-12-15 17:22:44,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:44,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:44,832 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:44,845 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:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:44,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:44,934 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:44,935 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:45,213 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:45,219 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:45,228 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:45,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:45 BoogieIcfgContainer [2021-12-15 17:22:45,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:45,232 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:45,232 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:45,240 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:45,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:45,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:44" (1/3) ... [2021-12-15 17:22:45,242 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63e6d103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:45, skipping insertion in model container [2021-12-15 17:22:45,242 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:45,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:44" (2/3) ... [2021-12-15 17:22:45,243 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63e6d103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:45, skipping insertion in model container [2021-12-15 17:22:45,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:45,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:45" (3/3) ... [2021-12-15 17:22:45,245 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:45,288 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:45,288 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:45,288 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:45,288 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:45,288 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:45,289 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:45,289 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:45,289 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:45,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 76 states have internal predecessors, (126), 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:45,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:22:45,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:45,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:45,348 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:45,349 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:45,349 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:45,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 76 states have internal predecessors, (126), 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:45,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:22:45,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:45,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:45,364 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:45,365 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:45,372 INFO L791 eck$LassoCheckResult]: Stem: 59#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; 40#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; 38#L162true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 51#L162-1true init_#res#1 := init_~tmp~0#1; 11#L231true 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; 45#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 33#L21true 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; 7#L286-2true [2021-12-15 17:22:45,375 INFO L793 eck$LassoCheckResult]: Loop: 7#L286-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; 73#L60true assume !(0 != ~mode1~0 % 256); 64#L81true assume !(0 != ~alive1~0 % 256); 30#L81-2true ~mode1~0 := 1; 24#L60-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 22#L95true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 39#L98true assume !(node2_~m2~0#1 != ~nomsg~0); 15#L98-1true ~mode2~0 := 0; 37#L95-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 49#L129true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 69#L132true assume !(node3_~m3~0#1 != ~nomsg~0); 75#L132-1true ~mode3~0 := 0; 10#L129-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; 31#L239true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 23#L239-1true check_#res#1 := check_~tmp~1#1; 12#L251true 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; 16#L309true assume !(0 == assert_~arg#1 % 256); 36#L304true assume { :end_inline_assert } true; 7#L286-2true [2021-12-15 17:22:45,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2021-12-15 17:22:45,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:45,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293121647] [2021-12-15 17:22:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:45,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:45,564 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:45,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:45,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293121647] [2021-12-15 17:22:45,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293121647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:45,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:45,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:22:45,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962442740] [2021-12-15 17:22:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:45,571 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:45,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:45,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2101762267, now seen corresponding path program 1 times [2021-12-15 17:22:45,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:45,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390284609] [2021-12-15 17:22:45,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:45,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:45,764 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:45,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390284609] [2021-12-15 17:22:45,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390284609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:45,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:45,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:45,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961611909] [2021-12-15 17:22:45,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:45,767 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:45,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:45,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:22:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:22:45,803 INFO L87 Difference]: Start difference. First operand has 77 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 76 states have internal predecessors, (126), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:45,819 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2021-12-15 17:22:45,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:22:45,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 119 transitions. [2021-12-15 17:22:45,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-15 17:22:45,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 118 transitions. [2021-12-15 17:22:45,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2021-12-15 17:22:45,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2021-12-15 17:22:45,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 118 transitions. [2021-12-15 17:22:45,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:45,839 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 118 transitions. [2021-12-15 17:22:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 118 transitions. [2021-12-15 17:22:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-15 17:22:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 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:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 118 transitions. [2021-12-15 17:22:45,871 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 118 transitions. [2021-12-15 17:22:45,871 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 118 transitions. [2021-12-15 17:22:45,871 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:45,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 118 transitions. [2021-12-15 17:22:45,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-15 17:22:45,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:45,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:45,876 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:45,876 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:45,877 INFO L791 eck$LassoCheckResult]: Stem: 227#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; 208#L162 assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 162#L162-1 init_#res#1 := init_~tmp~0#1; 176#L231 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; 177#L22 assume !(0 == assume_abort_if_not_~cond#1); 206#L21 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; 168#L286-2 [2021-12-15 17:22:45,877 INFO L793 eck$LassoCheckResult]: Loop: 168#L286-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; 169#L60 assume !(0 != ~mode1~0 % 256); 230#L81 assume !(0 != ~alive1~0 % 256); 202#L81-2 ~mode1~0 := 1; 197#L60-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 194#L95 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 195#L98 assume !(node2_~m2~0#1 != ~nomsg~0); 183#L98-1 ~mode2~0 := 0; 184#L95-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 207#L129 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 222#L132 assume !(node3_~m3~0#1 != ~nomsg~0); 217#L132-1 ~mode3~0 := 0; 174#L129-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; 175#L239 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 171#L239-1 check_#res#1 := check_~tmp~1#1; 178#L251 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; 179#L309 assume !(0 == assert_~arg#1 % 256); 185#L304 assume { :end_inline_assert } true; 168#L286-2 [2021-12-15 17:22:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2021-12-15 17:22:45,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:45,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280131530] [2021-12-15 17:22:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:45,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:45,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:45,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:45,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280131530] [2021-12-15 17:22:45,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280131530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:45,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:45,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:45,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583527957] [2021-12-15 17:22:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:45,938 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2101762267, now seen corresponding path program 2 times [2021-12-15 17:22:45,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:45,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282941941] [2021-12-15 17:22:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:45,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:46,022 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:46,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:46,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282941941] [2021-12-15 17:22:46,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282941941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:46,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:46,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:46,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347665109] [2021-12-15 17:22:46,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:46,024 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:46,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:46,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:46,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:46,025 INFO L87 Difference]: Start difference. First operand 72 states and 118 transitions. cyclomatic complexity: 47 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:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:46,072 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2021-12-15 17:22:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:46,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 120 transitions. [2021-12-15 17:22:46,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-15 17:22:46,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 72 states and 101 transitions. [2021-12-15 17:22:46,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2021-12-15 17:22:46,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2021-12-15 17:22:46,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 101 transitions. [2021-12-15 17:22:46,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:46,077 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2021-12-15 17:22:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 101 transitions. [2021-12-15 17:22:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-15 17:22:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 71 states have internal predecessors, (101), 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:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2021-12-15 17:22:46,082 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2021-12-15 17:22:46,082 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2021-12-15 17:22:46,082 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:46,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2021-12-15 17:22:46,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-15 17:22:46,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:46,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:46,084 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] [2021-12-15 17:22:46,085 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:46,085 INFO L791 eck$LassoCheckResult]: Stem: 389#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; 373#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; 370#L162 assume 0 == ~r1~0 % 256; 371#L163 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 349#L164 assume ~id1~0 >= 0; 333#L165 assume 0 == ~st1~0; 334#L166 assume ~send1~0 == ~id1~0; 351#L167 assume 0 == ~mode1~0 % 256; 327#L168 assume ~id2~0 >= 0; 328#L169 assume 0 == ~st2~0; 394#L170 assume ~send2~0 == ~id2~0; 377#L171 assume 0 == ~mode2~0 % 256; 374#L172 assume ~id3~0 >= 0; 375#L173 assume 0 == ~st3~0; 392#L174 assume ~send3~0 == ~id3~0; 323#L175 assume 0 == ~mode3~0 % 256; 324#L176 assume ~id1~0 != ~id2~0; 381#L177 assume ~id1~0 != ~id3~0; 366#L178 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 367#L162-1 init_#res#1 := init_~tmp~0#1; 337#L231 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; 338#L22 assume !(0 == assume_abort_if_not_~cond#1); 368#L21 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; 329#L286-2 [2021-12-15 17:22:46,085 INFO L793 eck$LassoCheckResult]: Loop: 329#L286-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; 330#L60 assume !(0 != ~mode1~0 % 256); 393#L81 assume !(0 != ~alive1~0 % 256); 363#L81-2 ~mode1~0 := 1; 358#L60-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 355#L95 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 356#L98 assume !(node2_~m2~0#1 != ~nomsg~0); 344#L98-1 ~mode2~0 := 0; 345#L95-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 369#L129 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 384#L132 assume !(node3_~m3~0#1 != ~nomsg~0); 379#L132-1 ~mode3~0 := 0; 335#L129-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; 336#L239 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 332#L239-1 check_#res#1 := check_~tmp~1#1; 339#L251 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; 340#L309 assume !(0 == assert_~arg#1 % 256); 346#L304 assume { :end_inline_assert } true; 329#L286-2 [2021-12-15 17:22:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2021-12-15 17:22:46,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:46,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582090628] [2021-12-15 17:22:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:46,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:46,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:46,148 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2101762267, now seen corresponding path program 3 times [2021-12-15 17:22:46,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:46,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195499254] [2021-12-15 17:22:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:46,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:46,207 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:46,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:46,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195499254] [2021-12-15 17:22:46,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195499254] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:46,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:46,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:46,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682830302] [2021-12-15 17:22:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:46,209 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:46,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:46,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:46,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:46,210 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. cyclomatic complexity: 30 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:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:46,242 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2021-12-15 17:22:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:46,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2021-12-15 17:22:46,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-15 17:22:46,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 72 states and 99 transitions. [2021-12-15 17:22:46,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2021-12-15 17:22:46,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2021-12-15 17:22:46,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 99 transitions. [2021-12-15 17:22:46,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:46,246 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 99 transitions. [2021-12-15 17:22:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 99 transitions. [2021-12-15 17:22:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-15 17:22:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.375) internal successors, (99), 71 states have internal predecessors, (99), 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:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2021-12-15 17:22:46,250 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 99 transitions. [2021-12-15 17:22:46,250 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 99 transitions. [2021-12-15 17:22:46,250 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:46,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 99 transitions. [2021-12-15 17:22:46,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-15 17:22:46,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:46,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:46,252 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] [2021-12-15 17:22:46,252 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] [2021-12-15 17:22:46,252 INFO L791 eck$LassoCheckResult]: Stem: 548#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0; 532#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive3~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; 529#L162 assume 0 == ~r1~0 % 256; 530#L163 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 506#L164 assume ~id1~0 >= 0; 492#L165 assume 0 == ~st1~0; 493#L166 assume ~send1~0 == ~id1~0; 510#L167 assume 0 == ~mode1~0 % 256; 486#L168 assume ~id2~0 >= 0; 487#L169 assume 0 == ~st2~0; 553#L170 assume ~send2~0 == ~id2~0; 536#L171 assume 0 == ~mode2~0 % 256; 533#L172 assume ~id3~0 >= 0; 534#L173 assume 0 == ~st3~0; 551#L174 assume ~send3~0 == ~id3~0; 482#L175 assume 0 == ~mode3~0 % 256; 483#L176 assume ~id1~0 != ~id2~0; 540#L177 assume ~id1~0 != ~id3~0; 525#L178 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 526#L162-1 init_#res#1 := init_~tmp~0#1; 496#L231 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; 497#L22 assume !(0 == assume_abort_if_not_~cond#1); 527#L21 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; 488#L286-2 [2021-12-15 17:22:46,252 INFO L793 eck$LassoCheckResult]: Loop: 488#L286-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; 489#L60 assume !(0 != ~mode1~0 % 256); 552#L81 assume !(0 != ~alive1~0 % 256); 522#L81-2 ~mode1~0 := 1; 517#L60-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 514#L95 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 515#L98 assume !(node2_~m2~0#1 != ~nomsg~0); 503#L98-1 ~mode2~0 := 0; 504#L95-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 528#L129 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 543#L132 assume !(node3_~m3~0#1 != ~nomsg~0); 538#L132-1 ~mode3~0 := 0; 494#L129-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; 495#L239 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 521#L240 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 491#L239-1 check_#res#1 := check_~tmp~1#1; 498#L251 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; 499#L309 assume !(0 == assert_~arg#1 % 256); 505#L304 assume { :end_inline_assert } true; 488#L286-2 [2021-12-15 17:22:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2021-12-15 17:22:46,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:46,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127147005] [2021-12-15 17:22:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:46,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:46,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:46,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1113448102, now seen corresponding path program 1 times [2021-12-15 17:22:46,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:46,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513227887] [2021-12-15 17:22:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:46,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:46,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:46,356 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:46,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1846643677, now seen corresponding path program 1 times [2021-12-15 17:22:46,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:46,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638438162] [2021-12-15 17:22:46,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:46,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:46,391 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:46,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:46,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638438162] [2021-12-15 17:22:46,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638438162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:46,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:46,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:46,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909675305] [2021-12-15 17:22:46,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:46,803 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:22:46,818 INFO L158 Benchmark]: Toolchain (without parser) took 2397.25ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 67.5MB in the beginning and 65.6MB in the end (delta: 1.9MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2021-12-15 17:22:46,818 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:46,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.78ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 67.2MB in the beginning and 99.7MB in the end (delta: -32.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:46,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.71ms. Allocated memory is still 125.8MB. Free memory was 99.7MB in the beginning and 97.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:46,820 INFO L158 Benchmark]: Boogie Preprocessor took 38.54ms. Allocated memory is still 125.8MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:46,822 INFO L158 Benchmark]: RCFGBuilder took 439.29ms. Allocated memory is still 125.8MB. Free memory was 95.6MB in the beginning and 80.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-15 17:22:46,823 INFO L158 Benchmark]: BuchiAutomizer took 1576.63ms. Allocated memory is still 125.8MB. Free memory was 80.3MB in the beginning and 65.6MB in the end (delta: 14.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:46,826 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.17ms. Allocated memory is still 94.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.78ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 67.2MB in the beginning and 99.7MB in the end (delta: -32.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.71ms. Allocated memory is still 125.8MB. Free memory was 99.7MB in the beginning and 97.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.54ms. Allocated memory is still 125.8MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 439.29ms. Allocated memory is still 125.8MB. Free memory was 95.6MB in the beginning and 80.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1576.63ms. Allocated memory is still 125.8MB. Free memory was 80.3MB in the beginning and 65.6MB in the end (delta: 14.8MB). Peak memory consumption was 15.4MB. 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:22:46,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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