./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.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.6.1.ufo.BOUNDED-12.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 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:51,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:51,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:52,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:52,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:52,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:52,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:52,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:52,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:52,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:52,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:52,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:52,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:52,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:52,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:52,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:52,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:52,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:52,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:52,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:52,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:52,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:52,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:52,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:52,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:52,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:52,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:52,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:52,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:52,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:52,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:52,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:52,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:52,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:52,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:52,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:52,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:52,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:52,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:52,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:52,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:52,069 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:52,097 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:52,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:52,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:52,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:52,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:52,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:52,099 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:52,099 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:52,099 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:52,099 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:52,100 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:52,100 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:52,100 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:52,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:52,101 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:52,101 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:52,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:52,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:52,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:52,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:52,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:52,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:52,102 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:52,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:52,102 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:52,102 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:52,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:52,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:52,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:52,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:52,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:52,104 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:52,105 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:52,105 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 -> 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f [2021-12-15 17:22:52,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:52,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:52,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:52,342 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:52,342 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:52,343 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.6.1.ufo.BOUNDED-12.pals.c [2021-12-15 17:22:52,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c267a97/93247acbc13244b182a08dfe582da8a0/FLAG7b319111d [2021-12-15 17:22:52,792 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:52,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2021-12-15 17:22:52,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c267a97/93247acbc13244b182a08dfe582da8a0/FLAG7b319111d [2021-12-15 17:22:53,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c267a97/93247acbc13244b182a08dfe582da8a0 [2021-12-15 17:22:53,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:53,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:53,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:53,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:53,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:53,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:53" (1/1) ... [2021-12-15 17:22:53,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a25bf31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:53, skipping insertion in model container [2021-12-15 17:22:53,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:53" (1/1) ... [2021-12-15 17:22:53,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:53,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:53,415 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.6.1.ufo.BOUNDED-12.pals.c[16977,16990] [2021-12-15 17:22:53,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:53,426 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:53,486 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.6.1.ufo.BOUNDED-12.pals.c[16977,16990] [2021-12-15 17:22:53,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:53,502 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:53,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:53 WrapperNode [2021-12-15 17:22:53,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:53,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:53,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:53,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:53,508 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:53" (1/1) ... [2021-12-15 17:22:53,526 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:53" (1/1) ... [2021-12-15 17:22:53,559 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 441 [2021-12-15 17:22:53,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:53,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:53,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:53,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:53,570 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:53" (1/1) ... [2021-12-15 17:22:53,570 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:53" (1/1) ... [2021-12-15 17:22:53,576 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:53" (1/1) ... [2021-12-15 17:22:53,576 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:53" (1/1) ... [2021-12-15 17:22:53,583 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:53" (1/1) ... [2021-12-15 17:22:53,594 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:53" (1/1) ... [2021-12-15 17:22:53,601 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:53" (1/1) ... [2021-12-15 17:22:53,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:53,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:53,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:53,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:53,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:53" (1/1) ... [2021-12-15 17:22:53,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:53,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:53,635 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:53,684 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:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:53,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:53,807 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:53,809 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:54,406 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:54,412 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:54,427 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:54,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:54 BoogieIcfgContainer [2021-12-15 17:22:54,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:54,431 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:54,431 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:54,433 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:54,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:54,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:53" (1/3) ... [2021-12-15 17:22:54,434 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e8b1f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:54, skipping insertion in model container [2021-12-15 17:22:54,435 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:54,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:53" (2/3) ... [2021-12-15 17:22:54,435 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e8b1f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:54, skipping insertion in model container [2021-12-15 17:22:54,435 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:54,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:54" (3/3) ... [2021-12-15 17:22:54,436 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2021-12-15 17:22:54,478 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:54,479 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:54,479 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:54,479 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:54,479 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:54,479 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:54,479 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:54,480 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:54,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 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:54,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:22:54,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:54,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:54,520 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:54,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:54,521 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:54,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 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:54,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:22:54,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:54,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:54,528 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:54,529 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:54,534 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 38#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 134#L290true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 122#L290-1true init_#res#1 := init_~tmp~0#1; 5#L455true main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 43#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 103#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 116#L531-2true [2021-12-15 17:22:54,535 INFO L793 eck$LassoCheckResult]: Loop: 116#L531-2true assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 123#L84true 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 98#L88true assume !(node1_~m1~0#1 != ~nomsg~0); 119#L88-1true ~mode1~0 := 0; 25#L84-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 26#L121true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 82#L124true assume !(node2_~m2~0#1 != ~nomsg~0); 37#L124-1true ~mode2~0 := 0; 10#L121-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 48#L155true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 16#L158true assume !(node3_~m3~0#1 != ~nomsg~0); 97#L158-1true ~mode3~0 := 0; 104#L155-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 89#L189true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 99#L192true assume !(node4_~m4~0#1 != ~nomsg~0); 139#L192-1true ~mode4~0 := 0; 49#L189-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 63#L223true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 14#L226true assume !(node5_~m5~0#1 != ~nomsg~0); 42#L226-1true ~mode5~0 := 0; 54#L223-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 129#L257true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 64#L260true assume !(node6_~m6~0#1 != ~nomsg~0); 81#L260-1true ~mode6~0 := 0; 41#L257-2true assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 39#L463true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 138#L463-1true check_#res#1 := check_~tmp~1#1; 71#L475true main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 15#L564true assume !(0 == assert_~arg#1 % 256); 46#L559true assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 116#L531-2true [2021-12-15 17:22:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2021-12-15 17:22:54,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853636736] [2021-12-15 17:22:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:54,641 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:54,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:54,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853636736] [2021-12-15 17:22:54,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853636736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:54,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:54,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:22:54,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599119509] [2021-12-15 17:22:54,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:54,649 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:54,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 1 times [2021-12-15 17:22:54,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531062846] [2021-12-15 17:22:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:54,800 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:54,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:54,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531062846] [2021-12-15 17:22:54,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531062846] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:54,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:54,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:54,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249550329] [2021-12-15 17:22:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:54,803 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:54,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:54,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:22:54,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:22:54,827 INFO L87 Difference]: Start difference. First operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 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:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:54,862 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2021-12-15 17:22:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:22:54,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 242 transitions. [2021-12-15 17:22:54,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:54,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 139 states and 237 transitions. [2021-12-15 17:22:54,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-15 17:22:54,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-15 17:22:54,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 237 transitions. [2021-12-15 17:22:54,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:54,898 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2021-12-15 17:22:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 237 transitions. [2021-12-15 17:22:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-15 17:22:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 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:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 237 transitions. [2021-12-15 17:22:54,922 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2021-12-15 17:22:54,922 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2021-12-15 17:22:54,922 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:54,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 237 transitions. [2021-12-15 17:22:54,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:54,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:54,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:54,925 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:54,925 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:54,925 INFO L791 eck$LassoCheckResult]: Stem: 435#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(50, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 368#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 369#L290 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 302#L290-1 init_#res#1 := init_~tmp~0#1; 304#L455 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 305#L22 assume !(0 == assume_abort_if_not_~cond#1); 373#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 374#L531-2 [2021-12-15 17:22:54,926 INFO L793 eck$LassoCheckResult]: Loop: 374#L531-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 434#L84 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 428#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 362#L88-1 ~mode1~0 := 0; 345#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 346#L121 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 348#L124 assume !(node2_~m2~0#1 != ~nomsg~0); 364#L124-1 ~mode2~0 := 0; 315#L121-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 316#L155 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 326#L158 assume !(node3_~m3~0#1 != ~nomsg~0); 328#L158-1 ~mode3~0 := 0; 409#L155-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 421#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 422#L192 assume !(node4_~m4~0#1 != ~nomsg~0); 391#L192-1 ~mode4~0 := 0; 381#L189-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 382#L223 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 321#L226 assume !(node5_~m5~0#1 != ~nomsg~0); 323#L226-1 ~mode5~0 := 0; 372#L223-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 385#L257 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 399#L260 assume !(node6_~m6~0#1 != ~nomsg~0); 393#L260-1 ~mode6~0 := 0; 371#L257-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 365#L463 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 366#L463-1 check_#res#1 := check_~tmp~1#1; 406#L475 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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#L564 assume !(0 == assert_~arg#1 % 256); 325#L559 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 374#L531-2 [2021-12-15 17:22:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2021-12-15 17:22:54,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155230754] [2021-12-15 17:22:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:54,966 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:54,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:54,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155230754] [2021-12-15 17:22:54,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155230754] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:54,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:54,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:54,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825806812] [2021-12-15 17:22:54,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:54,968 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:54,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 2 times [2021-12-15 17:22:54,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:54,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344062466] [2021-12-15 17:22:54,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:54,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:55,091 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:55,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:55,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344062466] [2021-12-15 17:22:55,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344062466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:55,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:55,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:55,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59731341] [2021-12-15 17:22:55,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:55,093 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:55,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:55,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:55,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:55,094 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. cyclomatic complexity: 99 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:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:55,176 INFO L93 Difference]: Finished difference Result 142 states and 239 transitions. [2021-12-15 17:22:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:55,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 239 transitions. [2021-12-15 17:22:55,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:55,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 196 transitions. [2021-12-15 17:22:55,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-15 17:22:55,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-15 17:22:55,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 196 transitions. [2021-12-15 17:22:55,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:55,189 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2021-12-15 17:22:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 196 transitions. [2021-12-15 17:22:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-15 17:22:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 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:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 196 transitions. [2021-12-15 17:22:55,202 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2021-12-15 17:22:55,202 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2021-12-15 17:22:55,202 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:55,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 196 transitions. [2021-12-15 17:22:55,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:55,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:55,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:55,206 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:55,208 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:55,208 INFO L791 eck$LassoCheckResult]: Stem: 731#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(50, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 663#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 664#L290 assume 0 == ~r1~0; 709#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 710#L292 assume ~id1~0 >= 0; 723#L293 assume 0 == ~st1~0; 729#L294 assume ~send1~0 == ~id1~0; 606#L295 assume 0 == ~mode1~0 % 256; 607#L296 assume ~id2~0 >= 0; 649#L297 assume 0 == ~st2~0; 647#L298 assume ~send2~0 == ~id2~0; 648#L299 assume 0 == ~mode2~0 % 256; 658#L300 assume ~id3~0 >= 0; 697#L301 assume 0 == ~st3~0; 714#L302 assume ~send3~0 == ~id3~0; 715#L303 assume 0 == ~mode3~0 % 256; 726#L304 assume ~id4~0 >= 0; 691#L305 assume 0 == ~st4~0; 692#L306 assume ~send4~0 == ~id4~0; 708#L307 assume 0 == ~mode4~0 % 256; 617#L308 assume ~id5~0 >= 0; 618#L309 assume 0 == ~st5~0; 704#L310 assume ~send5~0 == ~id5~0; 678#L311 assume 0 == ~mode5~0 % 256; 679#L312 assume ~id6~0 >= 0; 635#L313 assume 0 == ~st6~0; 636#L314 assume ~send6~0 == ~id6~0; 671#L315 assume 0 == ~mode6~0 % 256; 672#L316 assume ~id1~0 != ~id2~0; 604#L317 assume ~id1~0 != ~id3~0; 605#L318 assume ~id1~0 != ~id4~0; 732#L319 assume ~id1~0 != ~id5~0; 713#L320 assume ~id1~0 != ~id6~0; 693#L321 assume ~id2~0 != ~id3~0; 694#L322 assume ~id2~0 != ~id4~0; 600#L323 assume ~id2~0 != ~id5~0; 601#L324 assume ~id2~0 != ~id6~0; 624#L325 assume ~id3~0 != ~id4~0; 644#L326 assume ~id3~0 != ~id5~0; 631#L327 assume ~id3~0 != ~id6~0; 632#L328 assume ~id4~0 != ~id5~0; 654#L329 assume ~id4~0 != ~id6~0; 655#L330 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 680#L290-1 init_#res#1 := init_~tmp~0#1; 602#L455 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 603#L22 assume !(0 == assume_abort_if_not_~cond#1); 668#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 670#L531-2 [2021-12-15 17:22:55,210 INFO L793 eck$LassoCheckResult]: Loop: 670#L531-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 730#L84 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 724#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 657#L88-1 ~mode1~0 := 0; 640#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 641#L121 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 643#L124 assume !(node2_~m2~0#1 != ~nomsg~0); 659#L124-1 ~mode2~0 := 0; 608#L121-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 609#L155 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 621#L158 assume !(node3_~m3~0#1 != ~nomsg~0); 623#L158-1 ~mode3~0 := 0; 705#L155-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 717#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 718#L192 assume !(node4_~m4~0#1 != ~nomsg~0); 687#L192-1 ~mode4~0 := 0; 676#L189-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 677#L223 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 614#L226 assume !(node5_~m5~0#1 != ~nomsg~0); 616#L226-1 ~mode5~0 := 0; 667#L223-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 682#L257 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 695#L260 assume !(node6_~m6~0#1 != ~nomsg~0); 689#L260-1 ~mode6~0 := 0; 666#L257-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 660#L463 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 661#L463-1 check_#res#1 := check_~tmp~1#1; 702#L475 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 619#L564 assume !(0 == assert_~arg#1 % 256); 620#L559 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 670#L531-2 [2021-12-15 17:22:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2021-12-15 17:22:55,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:55,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080767682] [2021-12-15 17:22:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:55,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:55,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:55,333 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:55,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 3 times [2021-12-15 17:22:55,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:55,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951515637] [2021-12-15 17:22:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:55,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:55,401 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:55,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:55,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951515637] [2021-12-15 17:22:55,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951515637] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:55,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:55,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:55,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207662255] [2021-12-15 17:22:55,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:55,403 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:55,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:55,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:55,404 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. cyclomatic complexity: 58 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:55,437 INFO L93 Difference]: Finished difference Result 142 states and 198 transitions. [2021-12-15 17:22:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:55,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 198 transitions. [2021-12-15 17:22:55,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:55,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 194 transitions. [2021-12-15 17:22:55,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-12-15 17:22:55,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-12-15 17:22:55,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 194 transitions. [2021-12-15 17:22:55,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:55,446 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2021-12-15 17:22:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 194 transitions. [2021-12-15 17:22:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-15 17:22:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 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:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2021-12-15 17:22:55,459 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2021-12-15 17:22:55,459 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2021-12-15 17:22:55,459 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:55,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. [2021-12-15 17:22:55,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-12-15 17:22:55,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:55,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:55,464 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:55,465 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:55,465 INFO L791 eck$LassoCheckResult]: Stem: 1024#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(50, 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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 955#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 956#L290 assume 0 == ~r1~0; 1001#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 1002#L292 assume ~id1~0 >= 0; 1015#L293 assume 0 == ~st1~0; 1023#L294 assume ~send1~0 == ~id1~0; 899#L295 assume 0 == ~mode1~0 % 256; 900#L296 assume ~id2~0 >= 0; 942#L297 assume 0 == ~st2~0; 940#L298 assume ~send2~0 == ~id2~0; 941#L299 assume 0 == ~mode2~0 % 256; 951#L300 assume ~id3~0 >= 0; 989#L301 assume 0 == ~st3~0; 1006#L302 assume ~send3~0 == ~id3~0; 1007#L303 assume 0 == ~mode3~0 % 256; 1018#L304 assume ~id4~0 >= 0; 983#L305 assume 0 == ~st4~0; 984#L306 assume ~send4~0 == ~id4~0; 1000#L307 assume 0 == ~mode4~0 % 256; 910#L308 assume ~id5~0 >= 0; 911#L309 assume 0 == ~st5~0; 996#L310 assume ~send5~0 == ~id5~0; 970#L311 assume 0 == ~mode5~0 % 256; 971#L312 assume ~id6~0 >= 0; 928#L313 assume 0 == ~st6~0; 929#L314 assume ~send6~0 == ~id6~0; 961#L315 assume 0 == ~mode6~0 % 256; 962#L316 assume ~id1~0 != ~id2~0; 897#L317 assume ~id1~0 != ~id3~0; 898#L318 assume ~id1~0 != ~id4~0; 1025#L319 assume ~id1~0 != ~id5~0; 1005#L320 assume ~id1~0 != ~id6~0; 985#L321 assume ~id2~0 != ~id3~0; 986#L322 assume ~id2~0 != ~id4~0; 890#L323 assume ~id2~0 != ~id5~0; 891#L324 assume ~id2~0 != ~id6~0; 917#L325 assume ~id3~0 != ~id4~0; 937#L326 assume ~id3~0 != ~id5~0; 924#L327 assume ~id3~0 != ~id6~0; 925#L328 assume ~id4~0 != ~id5~0; 947#L329 assume ~id4~0 != ~id6~0; 948#L330 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 972#L290-1 init_#res#1 := init_~tmp~0#1; 892#L455 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 893#L22 assume !(0 == assume_abort_if_not_~cond#1); 960#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 964#L531-2 [2021-12-15 17:22:55,465 INFO L793 eck$LassoCheckResult]: Loop: 964#L531-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1022#L84 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1016#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 950#L88-1 ~mode1~0 := 0; 933#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 934#L121 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 936#L124 assume !(node2_~m2~0#1 != ~nomsg~0); 952#L124-1 ~mode2~0 := 0; 901#L121-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 902#L155 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 914#L158 assume !(node3_~m3~0#1 != ~nomsg~0); 916#L158-1 ~mode3~0 := 0; 997#L155-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1009#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1010#L192 assume !(node4_~m4~0#1 != ~nomsg~0); 979#L192-1 ~mode4~0 := 0; 968#L189-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 969#L223 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 907#L226 assume !(node5_~m5~0#1 != ~nomsg~0); 909#L226-1 ~mode5~0 := 0; 959#L223-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 974#L257 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 987#L260 assume !(node6_~m6~0#1 != ~nomsg~0); 981#L260-1 ~mode6~0 := 0; 958#L257-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 953#L463 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 954#L464 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 1019#L463-1 check_#res#1 := check_~tmp~1#1; 994#L475 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 912#L564 assume !(0 == assert_~arg#1 % 256); 913#L559 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 964#L531-2 [2021-12-15 17:22:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2021-12-15 17:22:55,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:55,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526897887] [2021-12-15 17:22:55,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:55,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:55,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:55,504 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash 911844111, now seen corresponding path program 1 times [2021-12-15 17:22:55,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:55,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806010024] [2021-12-15 17:22:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:55,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:55,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:55,554 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:55,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1786874990, now seen corresponding path program 1 times [2021-12-15 17:22:55,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:55,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081191781] [2021-12-15 17:22:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:55,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:55,596 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:55,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:55,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081191781] [2021-12-15 17:22:55,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081191781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:55,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:55,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:55,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263425881] [2021-12-15 17:22:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:56,557 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:56,561 INFO L158 Benchmark]: Toolchain (without parser) took 3372.81ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 95.7MB in the beginning and 129.0MB in the end (delta: -33.3MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2021-12-15 17:22:56,561 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:56,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.82ms. Allocated memory is still 130.0MB. Free memory was 95.5MB in the beginning and 97.9MB in the end (delta: -2.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:56,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.69ms. Allocated memory is still 130.0MB. Free memory was 97.9MB in the beginning and 95.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 17:22:56,562 INFO L158 Benchmark]: Boogie Preprocessor took 45.55ms. Allocated memory is still 130.0MB. Free memory was 95.1MB in the beginning and 93.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:56,563 INFO L158 Benchmark]: RCFGBuilder took 819.35ms. Allocated memory is still 130.0MB. Free memory was 93.0MB in the beginning and 67.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-15 17:22:56,564 INFO L158 Benchmark]: BuchiAutomizer took 2128.00ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 67.9MB in the beginning and 129.0MB in the end (delta: -61.2MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2021-12-15 17:22:56,566 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.14ms. Allocated memory is still 79.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.82ms. Allocated memory is still 130.0MB. Free memory was 95.5MB in the beginning and 97.9MB in the end (delta: -2.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.69ms. Allocated memory is still 130.0MB. Free memory was 97.9MB in the beginning and 95.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.55ms. Allocated memory is still 130.0MB. Free memory was 95.1MB in the beginning and 93.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 819.35ms. Allocated memory is still 130.0MB. Free memory was 93.0MB in the beginning and 67.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 2128.00ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 67.9MB in the beginning and 129.0MB in the end (delta: -61.2MB). Peak memory consumption was 42.3MB. 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:56,617 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