./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:54,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:54,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:54,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:54,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:54,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:54,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:54,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:54,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:54,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:54,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:54,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:54,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:54,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:54,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:54,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:54,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:54,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:54,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:54,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:54,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:54,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:54,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:54,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:54,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:54,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:54,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:54,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:54,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:54,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:54,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:54,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:54,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:54,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:54,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:54,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:54,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:54,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:54,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:54,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:54,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:54,338 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:54,364 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:54,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:54,365 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:54,365 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:54,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:54,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:54,366 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:54,366 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:54,367 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:54,367 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:54,367 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:54,368 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:54,368 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:54,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:54,368 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:54,368 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:54,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:54,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:54,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:54,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:54,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:54,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:54,369 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:54,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:54,370 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:54,370 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:54,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:54,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:54,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:54,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:54,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:54,371 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:54,372 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:54,372 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 -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2021-12-15 17:22:54,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:54,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:54,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:54,630 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:54,631 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:54,631 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:54,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f6022aa/fc4faa8cb6114b15b324c984f5eb21ec/FLAG3a47f894a [2021-12-15 17:22:55,051 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:55,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:55,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f6022aa/fc4faa8cb6114b15b324c984f5eb21ec/FLAG3a47f894a [2021-12-15 17:22:55,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f6022aa/fc4faa8cb6114b15b324c984f5eb21ec [2021-12-15 17:22:55,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:55,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:55,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:55,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:55,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:55,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:55" (1/1) ... [2021-12-15 17:22:55,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cd99a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:55, skipping insertion in model container [2021-12-15 17:22:55,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:55" (1/1) ... [2021-12-15 17:22:55,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:55,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:55,619 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.1.ufo.BOUNDED-6.pals.c[5984,5997] [2021-12-15 17:22:55,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:55,630 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:55,651 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.1.ufo.BOUNDED-6.pals.c[5984,5997] [2021-12-15 17:22:55,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:55,662 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:55,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:55 WrapperNode [2021-12-15 17:22:55,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:55,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:55,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:55,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:55,668 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:55" (1/1) ... [2021-12-15 17:22:55,691 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:55" (1/1) ... [2021-12-15 17:22:55,712 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2021-12-15 17:22:55,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:55,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:55,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:55,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:55,719 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:55" (1/1) ... [2021-12-15 17:22:55,719 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:55" (1/1) ... [2021-12-15 17:22:55,721 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:55" (1/1) ... [2021-12-15 17:22:55,721 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:55" (1/1) ... [2021-12-15 17:22:55,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:55" (1/1) ... [2021-12-15 17:22:55,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:55" (1/1) ... [2021-12-15 17:22:55,729 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:55" (1/1) ... [2021-12-15 17:22:55,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:55,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:55,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:55,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:55,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:55" (1/1) ... [2021-12-15 17:22:55,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:55,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:55,774 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:55,779 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:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:55,935 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:55,936 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:56,234 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:56,239 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:56,242 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:56,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:56 BoogieIcfgContainer [2021-12-15 17:22:56,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:56,246 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:56,247 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:56,249 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:56,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:56,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:55" (1/3) ... [2021-12-15 17:22:56,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@660840f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:56, skipping insertion in model container [2021-12-15 17:22:56,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:56,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:55" (2/3) ... [2021-12-15 17:22:56,252 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@660840f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:56, skipping insertion in model container [2021-12-15 17:22:56,252 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:56,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:56" (3/3) ... [2021-12-15 17:22:56,254 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:56,293 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:56,294 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:56,294 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:56,294 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:56,294 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:56,294 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:56,294 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:56,294 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:56,306 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:56,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-15 17:22:56,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:56,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:56,327 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:56,328 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:56,328 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:56,329 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:56,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-15 17:22:56,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:56,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:56,332 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:56,332 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:56,338 INFO L791 eck$LassoCheckResult]: Stem: 44#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(34, 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; 36#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_#t~post22#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; 41#L131true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 24#L131-1true init_#res#1 := init_~tmp~0#1; 59#L196true 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; 60#L248true assume !(0 == main_~i2~0#1); 30#L248-2true ~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; 12#L256-2true [2021-12-15 17:22:56,339 INFO L793 eck$LassoCheckResult]: Loop: 12#L256-2true assume !!(main_~i2~0#1 < 6);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; 4#L54true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 34#L58true assume !(node1_~m1~0#1 != ~nomsg~0); 11#L58-1true ~mode1~0 := 0; 13#L54-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; 20#L82true assume !(0 != ~mode2~0 % 256); 18#L95true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 29#L95-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; 55#L82-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; 50#L107true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 6#L110true assume !(node3_~m3~0#1 != ~nomsg~0); 16#L110-1true ~mode3~0 := 0; 61#L107-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; 37#L204true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 49#L204-1true check_#res#1 := check_~tmp~1#1; 14#L224true 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; 22#L280true assume !(0 == assert_~arg#1 % 256); 39#L275true assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 12#L256-2true [2021-12-15 17:22:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2021-12-15 17:22:56,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732326147] [2021-12-15 17:22:56,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:56,517 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:56,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:56,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732326147] [2021-12-15 17:22:56,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732326147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:56,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:56,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:56,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631968028] [2021-12-15 17:22:56,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:56,525 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 855687206, now seen corresponding path program 1 times [2021-12-15 17:22:56,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186184095] [2021-12-15 17:22:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:56,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:56,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186184095] [2021-12-15 17:22:56,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186184095] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:56,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:56,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:56,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216748693] [2021-12-15 17:22:56,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:56,673 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:56,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:56,708 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:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:56,781 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2021-12-15 17:22:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:22:56,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2021-12-15 17:22:56,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-15 17:22:56,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2021-12-15 17:22:56,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-12-15 17:22:56,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-12-15 17:22:56,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2021-12-15 17:22:56,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:56,806 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2021-12-15 17:22:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2021-12-15 17:22:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2021-12-15 17:22:56,828 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:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-12-15 17:22:56,830 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-15 17:22:56,831 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-15 17:22:56,831 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:56,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2021-12-15 17:22:56,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-15 17:22:56,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:56,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:56,838 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:56,838 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:56,843 INFO L791 eck$LassoCheckResult]: Stem: 230#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(34, 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; 221#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_#t~post22#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; 222#L131 assume 0 == ~r1~0; 227#L132 assume ~id1~0 >= 0; 225#L133 assume 0 == ~st1~0; 226#L134 assume ~send1~0 == ~id1~0; 219#L135 assume 0 == ~mode1~0 % 256; 198#L136 assume ~id2~0 >= 0; 199#L137 assume 0 == ~st2~0; 232#L138 assume ~send2~0 == ~id2~0; 210#L139 assume 0 == ~mode2~0 % 256; 211#L140 assume ~id3~0 >= 0; 228#L141 assume 0 == ~st3~0; 215#L142 assume ~send3~0 == ~id3~0; 213#L143 assume 0 == ~mode3~0 % 256; 187#L144 assume ~id1~0 != ~id2~0; 188#L145 assume ~id1~0 != ~id3~0; 201#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 202#L131-1 init_#res#1 := init_~tmp~0#1; 209#L196 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; 233#L248 assume !(0 == main_~i2~0#1); 216#L248-2 ~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; 194#L256-2 [2021-12-15 17:22:56,843 INFO L793 eck$LassoCheckResult]: Loop: 194#L256-2 assume !!(main_~i2~0#1 < 6);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; 178#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 179#L58 assume !(node1_~m1~0#1 != ~nomsg~0); 192#L58-1 ~mode1~0 := 0; 193#L54-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; 195#L82 assume !(0 != ~mode2~0 % 256); 203#L95 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 204#L95-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; 214#L82-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; 231#L107 assume !(0 != ~mode3~0 % 256); 229#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 212#L120-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; 200#L107-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; 223#L204 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 220#L204-1 check_#res#1 := check_~tmp~1#1; 196#L224 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; 197#L280 assume !(0 == assert_~arg#1 % 256); 207#L275 assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 194#L256-2 [2021-12-15 17:22:56,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2021-12-15 17:22:56,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459119180] [2021-12-15 17:22:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:56,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:56,913 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2073672604, now seen corresponding path program 1 times [2021-12-15 17:22:56,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:56,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713586012] [2021-12-15 17:22:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:56,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:57,000 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:57,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:57,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713586012] [2021-12-15 17:22:57,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713586012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:57,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:57,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:57,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312084818] [2021-12-15 17:22:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:57,002 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:57,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:57,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:57,003 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:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:57,032 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2021-12-15 17:22:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:57,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2021-12-15 17:22:57,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-15 17:22:57,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2021-12-15 17:22:57,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-12-15 17:22:57,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-12-15 17:22:57,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2021-12-15 17:22:57,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:57,038 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-15 17:22:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2021-12-15 17:22:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-15 17:22:57,042 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:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2021-12-15 17:22:57,044 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-15 17:22:57,044 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-15 17:22:57,044 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:57,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2021-12-15 17:22:57,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-15 17:22:57,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:57,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:57,047 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:57,047 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:57,047 INFO L791 eck$LassoCheckResult]: Stem: 357#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(34, 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; 347#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_#t~post22#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; 348#L131 assume 0 == ~r1~0; 354#L132 assume ~id1~0 >= 0; 352#L133 assume 0 == ~st1~0; 353#L134 assume ~send1~0 == ~id1~0; 346#L135 assume 0 == ~mode1~0 % 256; 325#L136 assume ~id2~0 >= 0; 326#L137 assume 0 == ~st2~0; 359#L138 assume ~send2~0 == ~id2~0; 337#L139 assume 0 == ~mode2~0 % 256; 338#L140 assume ~id3~0 >= 0; 355#L141 assume 0 == ~st3~0; 342#L142 assume ~send3~0 == ~id3~0; 340#L143 assume 0 == ~mode3~0 % 256; 314#L144 assume ~id1~0 != ~id2~0; 315#L145 assume ~id1~0 != ~id3~0; 328#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 329#L131-1 init_#res#1 := init_~tmp~0#1; 336#L196 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; 360#L248 assume !(0 == main_~i2~0#1); 343#L248-2 ~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; 321#L256-2 [2021-12-15 17:22:57,047 INFO L793 eck$LassoCheckResult]: Loop: 321#L256-2 assume !!(main_~i2~0#1 < 6);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; 305#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 306#L58 assume !(node1_~m1~0#1 != ~nomsg~0); 319#L58-1 ~mode1~0 := 0; 320#L54-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; 322#L82 assume !(0 != ~mode2~0 % 256); 330#L95 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 331#L95-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; 341#L82-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; 358#L107 assume !(0 != ~mode3~0 % 256); 356#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 339#L120-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; 327#L107-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; 349#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 316#L205 assume ~r1~0 >= 3; 318#L209 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 350#L204-1 check_#res#1 := check_~tmp~1#1; 323#L224 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; 324#L280 assume !(0 == assert_~arg#1 % 256); 334#L275 assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 321#L256-2 [2021-12-15 17:22:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:57,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2021-12-15 17:22:57,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:57,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650148729] [2021-12-15 17:22:57,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:57,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:57,064 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:57,078 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:57,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1481276532, now seen corresponding path program 1 times [2021-12-15 17:22:57,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:57,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49383029] [2021-12-15 17:22:57,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:57,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:57,101 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:57,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:57,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49383029] [2021-12-15 17:22:57,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49383029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:57,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:57,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:57,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416568528] [2021-12-15 17:22:57,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:57,103 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:57,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:57,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:22:57,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:22:57,105 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:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:57,123 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2021-12-15 17:22:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:22:57,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2021-12-15 17:22:57,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-12-15 17:22:57,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2021-12-15 17:22:57,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2021-12-15 17:22:57,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2021-12-15 17:22:57,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2021-12-15 17:22:57,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:57,127 INFO L681 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-15 17:22:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2021-12-15 17:22:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-15 17:22:57,130 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:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-12-15 17:22:57,130 INFO L704 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-15 17:22:57,130 INFO L587 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-15 17:22:57,130 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:57,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2021-12-15 17:22:57,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-12-15 17:22:57,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:57,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:57,132 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:57,132 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:57,132 INFO L791 eck$LassoCheckResult]: Stem: 506#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(34, 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; 495#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_#t~post22#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; 496#L131 assume 0 == ~r1~0; 503#L132 assume ~id1~0 >= 0; 501#L133 assume 0 == ~st1~0; 502#L134 assume ~send1~0 == ~id1~0; 492#L135 assume 0 == ~mode1~0 % 256; 470#L136 assume ~id2~0 >= 0; 471#L137 assume 0 == ~st2~0; 511#L138 assume ~send2~0 == ~id2~0; 482#L139 assume 0 == ~mode2~0 % 256; 483#L140 assume ~id3~0 >= 0; 504#L141 assume 0 == ~st3~0; 487#L142 assume ~send3~0 == ~id3~0; 485#L143 assume 0 == ~mode3~0 % 256; 460#L144 assume ~id1~0 != ~id2~0; 461#L145 assume ~id1~0 != ~id3~0; 473#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 474#L131-1 init_#res#1 := init_~tmp~0#1; 481#L196 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; 512#L248 assume !(0 == main_~i2~0#1); 488#L248-2 ~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; 466#L256-2 [2021-12-15 17:22:57,132 INFO L793 eck$LassoCheckResult]: Loop: 466#L256-2 assume !!(main_~i2~0#1 < 6);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; 451#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 452#L58 assume !(node1_~m1~0#1 != ~nomsg~0); 464#L58-1 ~mode1~0 := 0; 465#L54-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; 467#L82 assume !(0 != ~mode2~0 % 256); 475#L95 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 476#L95-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; 486#L82-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; 509#L107 assume !(0 != ~mode3~0 % 256); 505#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 484#L120-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; 472#L107-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; 513#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 514#L205 assume !(~r1~0 >= 3); 493#L208 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 494#L209 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 508#L204-1 check_#res#1 := check_~tmp~1#1; 468#L224 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; 469#L280 assume !(0 == assert_~arg#1 % 256); 479#L275 assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 466#L256-2 [2021-12-15 17:22:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:57,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2021-12-15 17:22:57,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:57,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855964879] [2021-12-15 17:22:57,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:57,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:57,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:57,155 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1323327703, now seen corresponding path program 1 times [2021-12-15 17:22:57,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:57,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105150448] [2021-12-15 17:22:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:57,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:57,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:57,202 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1693614955, now seen corresponding path program 1 times [2021-12-15 17:22:57,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:57,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165457428] [2021-12-15 17:22:57,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:57,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:57,239 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:57,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:57,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165457428] [2021-12-15 17:22:57,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165457428] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:57,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:57,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:57,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380866999] [2021-12-15 17:22:57,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:57,904 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:57,907 INFO L158 Benchmark]: Toolchain (without parser) took 2454.60ms. Allocated memory was 109.1MB in the beginning and 163.6MB in the end (delta: 54.5MB). Free memory was 71.8MB in the beginning and 87.0MB in the end (delta: -15.2MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,907 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 109.1MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:57,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.85ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 82.5MB in the end (delta: -10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.79ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,908 INFO L158 Benchmark]: Boogie Preprocessor took 22.66ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 78.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,908 INFO L158 Benchmark]: RCFGBuilder took 508.34ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 64.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,909 INFO L158 Benchmark]: BuchiAutomizer took 1659.89ms. Allocated memory was 109.1MB in the beginning and 163.6MB in the end (delta: 54.5MB). Free memory was 64.4MB in the beginning and 87.0MB in the end (delta: -22.6MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:57,911 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.10ms. Allocated memory is still 109.1MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.85ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 82.5MB in the end (delta: -10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.79ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.66ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 78.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 508.34ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 64.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 1659.89ms. Allocated memory was 109.1MB in the beginning and 163.6MB in the end (delta: 54.5MB). Free memory was 64.4MB in the beginning and 87.0MB in the end (delta: -22.6MB). Peak memory consumption was 34.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:57,947 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