./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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/systemc/token_ring.01.cil-1.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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:21:49,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:21:49,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:21:49,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:21:49,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:21:49,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:21:50,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:21:50,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:21:50,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:21:50,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:21:50,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:21:50,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:21:50,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:21:50,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:21:50,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:21:50,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:21:50,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:21:50,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:21:50,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:21:50,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:21:50,029 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:21:50,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:21:50,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:21:50,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:21:50,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:21:50,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:21:50,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:21:50,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:21:50,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:21:50,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:21:50,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:21:50,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:21:50,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:21:50,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:21:50,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:21:50,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:21:50,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:21:50,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:21:50,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:21:50,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:21:50,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:21:50,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:21:50,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:21:50,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:21:50,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:21:50,072 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:21:50,072 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:21:50,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:21:50,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:21:50,074 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:21:50,074 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:21:50,074 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:21:50,075 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:21:50,075 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:21:50,075 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:21:50,075 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:21:50,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:21:50,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:21:50,076 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:21:50,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:21:50,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:21:50,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:21:50,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:21:50,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:21:50,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:21:50,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:21:50,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:21:50,078 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:21:50,078 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:21:50,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:21:50,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:21:50,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:21:50,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:21:50,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:21:50,080 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:21:50,081 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2022-07-13 04:21:50,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:21:50,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:21:50,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:21:50,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:21:50,295 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:21:50,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-07-13 04:21:50,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8b64e64/d1253edbc9fd46bc9992ea9f240aafcf/FLAG1c3187b09 [2022-07-13 04:21:50,666 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:21:50,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-07-13 04:21:50,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8b64e64/d1253edbc9fd46bc9992ea9f240aafcf/FLAG1c3187b09 [2022-07-13 04:21:51,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8b64e64/d1253edbc9fd46bc9992ea9f240aafcf [2022-07-13 04:21:51,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:21:51,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:21:51,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:21:51,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:21:51,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:21:51,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438fdef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51, skipping insertion in model container [2022-07-13 04:21:51,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:21:51,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:21:51,256 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/systemc/token_ring.01.cil-1.c[671,684] [2022-07-13 04:21:51,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:21:51,302 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:21:51,309 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/systemc/token_ring.01.cil-1.c[671,684] [2022-07-13 04:21:51,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:21:51,330 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:21:51,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51 WrapperNode [2022-07-13 04:21:51,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:21:51,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:21:51,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:21:51,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:21:51,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,376 INFO L137 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 29, calls inlined = 38, statements flattened = 405 [2022-07-13 04:21:51,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:21:51,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:21:51,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:21:51,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:21:51,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:21:51,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:21:51,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:21:51,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:21:51,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (1/1) ... [2022-07-13 04:21:51,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:21:51,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:21:51,444 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) [2022-07-13 04:21:51,446 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 [2022-07-13 04:21:51,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:21:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:21:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:21:51,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:21:51,544 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:21:51,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:21:51,848 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:21:51,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:21:51,854 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:21:51,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:21:51 BoogieIcfgContainer [2022-07-13 04:21:51,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:21:51,857 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:21:51,857 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:21:51,859 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:21:51,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:21:51,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:21:51" (1/3) ... [2022-07-13 04:21:51,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@469b44ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:21:51, skipping insertion in model container [2022-07-13 04:21:51,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:21:51,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:21:51" (2/3) ... [2022-07-13 04:21:51,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@469b44ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:21:51, skipping insertion in model container [2022-07-13 04:21:51,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:21:51,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:21:51" (3/3) ... [2022-07-13 04:21:51,872 INFO L354 chiAutomizerObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-07-13 04:21:51,906 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:21:51,906 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:21:51,907 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:21:51,907 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:21:51,907 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:21:51,907 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:21:51,907 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:21:51,907 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:21:51,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 152 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 151 states have internal predecessors, (230), 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) [2022-07-13 04:21:51,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2022-07-13 04:21:51,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:51,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:51,943 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:51,944 INFO L180 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:51,944 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:21:51,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 152 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 151 states have internal predecessors, (230), 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) [2022-07-13 04:21:51,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2022-07-13 04:21:51,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:51,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:51,961 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:51,961 INFO L180 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:51,966 INFO L752 eck$LassoCheckResult]: Stem: 139#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 48#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 97#L391true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 59#L163true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 76#L170true assume !(1 == ~m_i~0);~m_st~0 := 2; 56#L170-2true assume 1 == ~t1_i~0;~t1_st~0 := 0; 140#L175-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 78#L259true assume !(0 == ~M_E~0); 135#L259-2true assume !(0 == ~T1_E~0); 95#L264-1true assume !(0 == ~E_M~0); 113#L269-1true assume !(0 == ~E_1~0); 88#L274-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 91#L124true assume 1 == ~m_pc~0; 99#L125true assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 126#L135true is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 19#L136true activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 153#L319true assume !(0 != activate_threads_~tmp~1#1); 20#L319-2true assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 118#L143true assume 1 == ~t1_pc~0; 7#L144true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 103#L154true is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 55#L155true activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 27#L327true assume !(0 != activate_threads_~tmp___0~0#1); 42#L327-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 73#L287true assume !(1 == ~M_E~0); 105#L287-2true assume !(1 == ~T1_E~0); 38#L292-1true assume !(1 == ~E_M~0); 41#L297-1true assume !(1 == ~E_1~0); 28#L302-1true assume { :end_inline_reset_delta_events } true; 53#L428-2true [2022-07-13 04:21:51,966 INFO L754 eck$LassoCheckResult]: Loop: 53#L428-2true assume !false; 92#L429true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 79#L234true assume false; 5#L249true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 25#L163-1true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 144#L259-3true assume 0 == ~M_E~0;~M_E~0 := 1; 137#L259-5true assume 0 == ~T1_E~0;~T1_E~0 := 1; 112#L264-3true assume 0 == ~E_M~0;~E_M~0 := 1; 17#L269-3true assume 0 == ~E_1~0;~E_1~0 := 1; 66#L274-3true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 13#L124-9true assume !(1 == ~m_pc~0); 101#L124-11true is_master_triggered_~__retres1~0#1 := 0; 71#L135-3true is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 24#L136-3true activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 89#L319-9true assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 50#L319-11true assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 64#L143-9true assume !(1 == ~t1_pc~0); 26#L143-11true is_transmit1_triggered_~__retres1~1#1 := 0; 65#L154-3true is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 16#L155-3true activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 115#L327-9true assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 152#L327-11true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 141#L287-3true assume !(1 == ~M_E~0); 74#L287-5true assume 1 == ~T1_E~0;~T1_E~0 := 2; 82#L292-3true assume 1 == ~E_M~0;~E_M~0 := 2; 86#L297-3true assume 1 == ~E_1~0;~E_1~0 := 2; 6#L302-3true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 129#L188-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 30#L200-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 110#L201-1true start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 37#L447true assume !(0 == start_simulation_~tmp~3#1); 107#L447-2true assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 8#L188-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 98#L200-2true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 133#L201-2true stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 100#L402true assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 143#L409true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 117#L410true start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 67#L460true assume !(0 != start_simulation_~tmp___0~1#1); 53#L428-2true [2022-07-13 04:21:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash -704910459, now seen corresponding path program 1 times [2022-07-13 04:21:51,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:51,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161663196] [2022-07-13 04:21:51,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161663196] [2022-07-13 04:21:52,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161663196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:21:52,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316029645] [2022-07-13 04:21:52,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,098 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:21:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash -791617431, now seen corresponding path program 1 times [2022-07-13 04:21:52,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364265843] [2022-07-13 04:21:52,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364265843] [2022-07-13 04:21:52,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364265843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:21:52,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057193801] [2022-07-13 04:21:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,115 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:21:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:52,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:21:52,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:21:52,137 INFO L87 Difference]: Start difference. First operand has 152 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 151 states have internal predecessors, (230), 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 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2022-07-13 04:21:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:52,161 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2022-07-13 04:21:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:21:52,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 219 transitions. [2022-07-13 04:21:52,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2022-07-13 04:21:52,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 146 states and 214 transitions. [2022-07-13 04:21:52,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 146 [2022-07-13 04:21:52,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 146 [2022-07-13 04:21:52,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 214 transitions. [2022-07-13 04:21:52,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:52,182 INFO L369 hiAutomatonCegarLoop]: Abstraction has 146 states and 214 transitions. [2022-07-13 04:21:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 214 transitions. [2022-07-13 04:21:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-07-13 04:21:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.4657534246575343) internal successors, (214), 145 states have internal predecessors, (214), 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) [2022-07-13 04:21:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 214 transitions. [2022-07-13 04:21:52,209 INFO L392 hiAutomatonCegarLoop]: Abstraction has 146 states and 214 transitions. [2022-07-13 04:21:52,209 INFO L374 stractBuchiCegarLoop]: Abstraction has 146 states and 214 transitions. [2022-07-13 04:21:52,209 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:21:52,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 214 transitions. [2022-07-13 04:21:52,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2022-07-13 04:21:52,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:52,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:52,217 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:52,217 INFO L180 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:52,217 INFO L752 eck$LassoCheckResult]: Stem: 456#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 396#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 408#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 409#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 404#L170-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 405#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 424#L259 assume !(0 == ~M_E~0); 425#L259-2 assume !(0 == ~T1_E~0); 441#L264-1 assume !(0 == ~E_M~0); 442#L269-1 assume !(0 == ~E_1~0); 435#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 436#L124 assume 1 == ~m_pc~0; 437#L125 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 416#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 344#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 345#L319 assume !(0 != activate_threads_~tmp~1#1); 346#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 347#L143 assume 1 == ~t1_pc~0; 326#L144 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 327#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 403#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 360#L327 assume !(0 != activate_threads_~tmp___0~0#1); 361#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 384#L287 assume !(1 == ~M_E~0); 423#L287-2 assume !(1 == ~T1_E~0); 379#L292-1 assume !(1 == ~E_M~0); 380#L297-1 assume !(1 == ~E_1~0); 362#L302-1 assume { :end_inline_reset_delta_events } true; 363#L428-2 [2022-07-13 04:21:52,217 INFO L754 eck$LassoCheckResult]: Loop: 363#L428-2 assume !false; 401#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 420#L234 assume !false; 426#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 348#L188 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 349#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 417#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 418#L215 assume !(0 != eval_~tmp~0#1); 319#L249 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 320#L163-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 355#L259-3 assume 0 == ~M_E~0;~M_E~0 := 1; 455#L259-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 447#L264-3 assume 0 == ~E_M~0;~E_M~0 := 1; 342#L269-3 assume 0 == ~E_1~0;~E_1~0 := 1; 343#L274-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 332#L124-9 assume 1 == ~m_pc~0; 333#L125-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 368#L135-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 353#L136-3 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 354#L319-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 397#L319-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 398#L143-9 assume !(1 == ~t1_pc~0); 356#L143-11 is_transmit1_triggered_~__retres1~1#1 := 0; 357#L154-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 337#L155-3 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 338#L327-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 449#L327-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 457#L287-3 assume !(1 == ~M_E~0); 421#L287-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 422#L292-3 assume 1 == ~E_M~0;~E_M~0 := 2; 432#L297-3 assume 1 == ~E_1~0;~E_1~0 := 2; 317#L302-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 318#L188-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 358#L200-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 359#L201-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 376#L447 assume !(0 == start_simulation_~tmp~3#1); 377#L447-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 321#L188-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 322#L200-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 443#L201-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 444#L402 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 445#L409 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 450#L410 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 414#L460 assume !(0 != start_simulation_~tmp___0~1#1); 363#L428-2 [2022-07-13 04:21:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash -845459069, now seen corresponding path program 1 times [2022-07-13 04:21:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656614705] [2022-07-13 04:21:52,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656614705] [2022-07-13 04:21:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656614705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:21:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364353813] [2022-07-13 04:21:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,261 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:21:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1897027051, now seen corresponding path program 1 times [2022-07-13 04:21:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026510171] [2022-07-13 04:21:52,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026510171] [2022-07-13 04:21:52,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026510171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:21:52,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955316989] [2022-07-13 04:21:52,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,310 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:21:52,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:21:52,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:21:52,310 INFO L87 Difference]: Start difference. First operand 146 states and 214 transitions. cyclomatic complexity: 69 Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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) [2022-07-13 04:21:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:52,346 INFO L93 Difference]: Finished difference Result 253 states and 362 transitions. [2022-07-13 04:21:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:21:52,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 253 states and 362 transitions. [2022-07-13 04:21:52,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 222 [2022-07-13 04:21:52,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 253 states to 253 states and 362 transitions. [2022-07-13 04:21:52,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2022-07-13 04:21:52,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2022-07-13 04:21:52,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 253 states and 362 transitions. [2022-07-13 04:21:52,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:52,352 INFO L369 hiAutomatonCegarLoop]: Abstraction has 253 states and 362 transitions. [2022-07-13 04:21:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states and 362 transitions. [2022-07-13 04:21:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2022-07-13 04:21:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 240 states have (on average 1.4375) internal successors, (345), 239 states have internal predecessors, (345), 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) [2022-07-13 04:21:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 345 transitions. [2022-07-13 04:21:52,359 INFO L392 hiAutomatonCegarLoop]: Abstraction has 240 states and 345 transitions. [2022-07-13 04:21:52,359 INFO L374 stractBuchiCegarLoop]: Abstraction has 240 states and 345 transitions. [2022-07-13 04:21:52,359 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:21:52,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 240 states and 345 transitions. [2022-07-13 04:21:52,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 209 [2022-07-13 04:21:52,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:52,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:52,361 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:52,361 INFO L180 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:52,361 INFO L752 eck$LassoCheckResult]: Stem: 876#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 803#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 804#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 818#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 819#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 814#L170-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 815#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 836#L259 assume !(0 == ~M_E~0); 837#L259-2 assume !(0 == ~T1_E~0); 855#L264-1 assume !(0 == ~E_M~0); 856#L269-1 assume !(0 == ~E_1~0); 849#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 850#L124 assume !(1 == ~m_pc~0); 826#L124-2 is_master_triggered_~__retres1~0#1 := 0; 827#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 749#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 750#L319 assume !(0 != activate_threads_~tmp~1#1); 751#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 752#L143 assume 1 == ~t1_pc~0; 732#L144 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 733#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 813#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 767#L327 assume !(0 != activate_threads_~tmp___0~0#1); 768#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 791#L287 assume !(1 == ~M_E~0); 835#L287-2 assume !(1 == ~T1_E~0); 786#L292-1 assume !(1 == ~E_M~0); 787#L297-1 assume !(1 == ~E_1~0); 769#L302-1 assume { :end_inline_reset_delta_events } true; 770#L428-2 [2022-07-13 04:21:52,361 INFO L754 eck$LassoCheckResult]: Loop: 770#L428-2 assume !false; 915#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 843#L234 assume !false; 844#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 753#L188 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 754#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 828#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 829#L215 assume !(0 != eval_~tmp~0#1); 725#L249 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 726#L163-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 760#L259-3 assume 0 == ~M_E~0;~M_E~0 := 1; 875#L259-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 862#L264-3 assume 0 == ~E_M~0;~E_M~0 := 1; 746#L269-3 assume 0 == ~E_1~0;~E_1~0 := 1; 747#L274-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 738#L124-9 assume !(1 == ~m_pc~0); 739#L124-11 is_master_triggered_~__retres1~0#1 := 0; 957#L135-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 956#L136-3 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 955#L319-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 954#L319-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 953#L143-9 assume !(1 == ~t1_pc~0); 951#L143-11 is_transmit1_triggered_~__retres1~1#1 := 0; 950#L154-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 744#L155-3 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 745#L327-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 865#L327-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 877#L287-3 assume !(1 == ~M_E~0); 833#L287-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 834#L292-3 assume 1 == ~E_M~0;~E_M~0 := 2; 845#L297-3 assume 1 == ~E_1~0;~E_1~0 := 2; 723#L302-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 724#L188-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 765#L200-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 766#L201-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 783#L447 assume !(0 == start_simulation_~tmp~3#1); 784#L447-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 928#L188-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 925#L200-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 924#L201-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 923#L402 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 922#L409 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 920#L410 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 918#L460 assume !(0 != start_simulation_~tmp___0~1#1); 770#L428-2 [2022-07-13 04:21:52,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1269536452, now seen corresponding path program 1 times [2022-07-13 04:21:52,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441986663] [2022-07-13 04:21:52,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441986663] [2022-07-13 04:21:52,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441986663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:21:52,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684151100] [2022-07-13 04:21:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,389 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:21:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1426265558, now seen corresponding path program 1 times [2022-07-13 04:21:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004912340] [2022-07-13 04:21:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004912340] [2022-07-13 04:21:52,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004912340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:21:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357566838] [2022-07-13 04:21:52,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,419 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:21:52,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:52,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:21:52,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:21:52,419 INFO L87 Difference]: Start difference. First operand 240 states and 345 transitions. cyclomatic complexity: 107 Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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) [2022-07-13 04:21:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:52,526 INFO L93 Difference]: Finished difference Result 512 states and 719 transitions. [2022-07-13 04:21:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:21:52,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 512 states and 719 transitions. [2022-07-13 04:21:52,530 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 461 [2022-07-13 04:21:52,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 512 states to 512 states and 719 transitions. [2022-07-13 04:21:52,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 512 [2022-07-13 04:21:52,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 512 [2022-07-13 04:21:52,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 512 states and 719 transitions. [2022-07-13 04:21:52,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:52,539 INFO L369 hiAutomatonCegarLoop]: Abstraction has 512 states and 719 transitions. [2022-07-13 04:21:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states and 719 transitions. [2022-07-13 04:21:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 407. [2022-07-13 04:21:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 407 states have (on average 1.425061425061425) internal successors, (580), 406 states have internal predecessors, (580), 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) [2022-07-13 04:21:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 580 transitions. [2022-07-13 04:21:52,554 INFO L392 hiAutomatonCegarLoop]: Abstraction has 407 states and 580 transitions. [2022-07-13 04:21:52,554 INFO L374 stractBuchiCegarLoop]: Abstraction has 407 states and 580 transitions. [2022-07-13 04:21:52,554 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:21:52,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 580 transitions. [2022-07-13 04:21:52,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 376 [2022-07-13 04:21:52,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:52,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:52,559 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:52,559 INFO L180 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:52,559 INFO L752 eck$LassoCheckResult]: Stem: 1641#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 1566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 1567#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 1579#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1580#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 1575#L170-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1576#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1596#L259 assume !(0 == ~M_E~0); 1597#L259-2 assume !(0 == ~T1_E~0); 1618#L264-1 assume !(0 == ~E_M~0); 1619#L269-1 assume !(0 == ~E_1~0); 1612#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 1613#L124 assume !(1 == ~m_pc~0); 1586#L124-2 is_master_triggered_~__retres1~0#1 := 0; 1587#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 1511#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 1512#L319 assume !(0 != activate_threads_~tmp~1#1); 1513#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 1514#L143 assume !(1 == ~t1_pc~0); 1497#L143-2 is_transmit1_triggered_~__retres1~1#1 := 0; 1498#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 1574#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 1529#L327 assume !(0 != activate_threads_~tmp___0~0#1); 1530#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1551#L287 assume !(1 == ~M_E~0); 1595#L287-2 assume !(1 == ~T1_E~0); 1546#L292-1 assume !(1 == ~E_M~0); 1547#L297-1 assume !(1 == ~E_1~0); 1531#L302-1 assume { :end_inline_reset_delta_events } true; 1532#L428-2 [2022-07-13 04:21:52,560 INFO L754 eck$LassoCheckResult]: Loop: 1532#L428-2 assume !false; 1572#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 1592#L234 assume !false; 1598#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1515#L188 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1516#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1589#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 1590#L215 assume !(0 != eval_~tmp~0#1); 1643#L249 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 1886#L163-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 1885#L259-3 assume 0 == ~M_E~0;~M_E~0 := 1; 1884#L259-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1883#L264-3 assume 0 == ~E_M~0;~E_M~0 := 1; 1882#L269-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1881#L274-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 1868#L124-9 assume !(1 == ~m_pc~0); 1623#L124-11 is_master_triggered_~__retres1~0#1 := 0; 1588#L135-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 1520#L136-3 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 1521#L319-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 1568#L319-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 1569#L143-9 assume !(1 == ~t1_pc~0); 1523#L143-11 is_transmit1_triggered_~__retres1~1#1 := 0; 1524#L154-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 1506#L155-3 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 1507#L327-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 1626#L327-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1642#L287-3 assume !(1 == ~M_E~0); 1593#L287-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1594#L292-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1604#L297-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1487#L302-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1488#L188-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1527#L200-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1528#L201-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 1543#L447 assume !(0 == start_simulation_~tmp~3#1); 1544#L447-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1489#L188-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1490#L200-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1620#L201-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 1621#L402 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 1622#L409 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 1628#L410 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 1585#L460 assume !(0 != start_simulation_~tmp___0~1#1); 1532#L428-2 [2022-07-13 04:21:52,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash 396697797, now seen corresponding path program 1 times [2022-07-13 04:21:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242443397] [2022-07-13 04:21:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:52,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:52,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1426265558, now seen corresponding path program 2 times [2022-07-13 04:21:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405888025] [2022-07-13 04:21:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405888025] [2022-07-13 04:21:52,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405888025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:21:52,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954410686] [2022-07-13 04:21:52,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,648 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:21:52,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:52,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:21:52,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:21:52,649 INFO L87 Difference]: Start difference. First operand 407 states and 580 transitions. cyclomatic complexity: 175 Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-07-13 04:21:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:52,666 INFO L93 Difference]: Finished difference Result 496 states and 698 transitions. [2022-07-13 04:21:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:21:52,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 496 states and 698 transitions. [2022-07-13 04:21:52,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 448 [2022-07-13 04:21:52,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 496 states to 496 states and 698 transitions. [2022-07-13 04:21:52,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 496 [2022-07-13 04:21:52,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 496 [2022-07-13 04:21:52,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 698 transitions. [2022-07-13 04:21:52,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:52,674 INFO L369 hiAutomatonCegarLoop]: Abstraction has 496 states and 698 transitions. [2022-07-13 04:21:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 698 transitions. [2022-07-13 04:21:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2022-07-13 04:21:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 496 states have (on average 1.407258064516129) internal successors, (698), 495 states have internal predecessors, (698), 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) [2022-07-13 04:21:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 698 transitions. [2022-07-13 04:21:52,695 INFO L392 hiAutomatonCegarLoop]: Abstraction has 496 states and 698 transitions. [2022-07-13 04:21:52,695 INFO L374 stractBuchiCegarLoop]: Abstraction has 496 states and 698 transitions. [2022-07-13 04:21:52,695 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:21:52,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 496 states and 698 transitions. [2022-07-13 04:21:52,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 448 [2022-07-13 04:21:52,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:52,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:52,700 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:52,700 INFO L180 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:52,701 INFO L752 eck$LassoCheckResult]: Stem: 2562#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 2474#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 2475#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 2488#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2489#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 2484#L170-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2485#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2507#L259 assume 0 == ~M_E~0;~M_E~0 := 1; 2508#L259-2 assume !(0 == ~T1_E~0); 2646#L264-1 assume !(0 == ~E_M~0); 2644#L269-1 assume !(0 == ~E_1~0); 2642#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 2641#L124 assume !(1 == ~m_pc~0); 2640#L124-2 is_master_triggered_~__retres1~0#1 := 0; 2639#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 2635#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 2634#L319 assume !(0 != activate_threads_~tmp~1#1); 2632#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 2631#L143 assume !(1 == ~t1_pc~0); 2628#L143-2 is_transmit1_triggered_~__retres1~1#1 := 0; 2626#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 2624#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 2614#L327 assume !(0 != activate_threads_~tmp___0~0#1); 2459#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2460#L287 assume 1 == ~M_E~0;~M_E~0 := 2; 2506#L287-2 assume !(1 == ~T1_E~0); 2454#L292-1 assume !(1 == ~E_M~0); 2455#L297-1 assume !(1 == ~E_1~0); 2439#L302-1 assume { :end_inline_reset_delta_events } true; 2440#L428-2 [2022-07-13 04:21:52,701 INFO L754 eck$LassoCheckResult]: Loop: 2440#L428-2 assume !false; 2845#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 2549#L234 assume !false; 2844#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 2842#L188 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 2841#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 2680#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 2678#L215 assume !(0 != eval_~tmp~0#1); 2679#L249 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 2839#L163-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 2836#L259-3 assume !(0 == ~M_E~0); 2834#L259-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2832#L264-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2830#L269-3 assume 0 == ~E_1~0;~E_1~0 := 1; 2828#L274-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 2826#L124-9 assume !(1 == ~m_pc~0); 2825#L124-11 is_master_triggered_~__retres1~0#1 := 0; 2824#L135-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 2823#L136-3 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 2525#L319-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 2526#L319-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 2822#L143-9 assume !(1 == ~t1_pc~0); 2790#L143-11 is_transmit1_triggered_~__retres1~1#1 := 0; 2818#L154-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 2815#L155-3 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 2807#L327-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 2808#L327-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2801#L287-3 assume !(1 == ~M_E~0); 2564#L287-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2516#L292-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2517#L297-3 assume 1 == ~E_1~0;~E_1~0 := 2; 2394#L302-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 2395#L188-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 2810#L200-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 2809#L201-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 2451#L447 assume !(0 == start_simulation_~tmp~3#1); 2452#L447-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 2853#L188-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 2851#L200-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 2850#L201-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 2849#L402 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 2848#L409 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 2847#L410 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 2846#L460 assume !(0 != start_simulation_~tmp___0~1#1); 2440#L428-2 [2022-07-13 04:21:52,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,702 INFO L85 PathProgramCache]: Analyzing trace with hash 175996037, now seen corresponding path program 1 times [2022-07-13 04:21:52,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665677346] [2022-07-13 04:21:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665677346] [2022-07-13 04:21:52,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665677346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:21:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314244746] [2022-07-13 04:21:52,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,753 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:21:52,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash -817717740, now seen corresponding path program 1 times [2022-07-13 04:21:52,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67571532] [2022-07-13 04:21:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67571532] [2022-07-13 04:21:52,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67571532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:21:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731038050] [2022-07-13 04:21:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,780 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:21:52,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:52,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:21:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:21:52,780 INFO L87 Difference]: Start difference. First operand 496 states and 698 transitions. cyclomatic complexity: 204 Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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) [2022-07-13 04:21:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:52,789 INFO L93 Difference]: Finished difference Result 407 states and 566 transitions. [2022-07-13 04:21:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:21:52,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 407 states and 566 transitions. [2022-07-13 04:21:52,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 376 [2022-07-13 04:21:52,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 407 states to 407 states and 566 transitions. [2022-07-13 04:21:52,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 407 [2022-07-13 04:21:52,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2022-07-13 04:21:52,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 566 transitions. [2022-07-13 04:21:52,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:52,796 INFO L369 hiAutomatonCegarLoop]: Abstraction has 407 states and 566 transitions. [2022-07-13 04:21:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 566 transitions. [2022-07-13 04:21:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2022-07-13 04:21:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 407 states have (on average 1.3906633906633907) internal successors, (566), 406 states have internal predecessors, (566), 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) [2022-07-13 04:21:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 566 transitions. [2022-07-13 04:21:52,801 INFO L392 hiAutomatonCegarLoop]: Abstraction has 407 states and 566 transitions. [2022-07-13 04:21:52,801 INFO L374 stractBuchiCegarLoop]: Abstraction has 407 states and 566 transitions. [2022-07-13 04:21:52,801 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:21:52,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 566 transitions. [2022-07-13 04:21:52,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 376 [2022-07-13 04:21:52,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:52,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:52,803 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:52,803 INFO L180 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:52,803 INFO L752 eck$LassoCheckResult]: Stem: 3479#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 3386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 3387#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 3402#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3403#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 3398#L170-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3399#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 3424#L259 assume !(0 == ~M_E~0); 3425#L259-2 assume !(0 == ~T1_E~0); 3449#L264-1 assume !(0 == ~E_M~0); 3450#L269-1 assume !(0 == ~E_1~0); 3440#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 3441#L124 assume !(1 == ~m_pc~0); 3411#L124-2 is_master_triggered_~__retres1~0#1 := 0; 3412#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 3332#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 3333#L319 assume !(0 != activate_threads_~tmp~1#1); 3334#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 3335#L143 assume !(1 == ~t1_pc~0); 3319#L143-2 is_transmit1_triggered_~__retres1~1#1 := 0; 3320#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 3397#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 3350#L327 assume !(0 != activate_threads_~tmp___0~0#1); 3351#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3374#L287 assume !(1 == ~M_E~0); 3420#L287-2 assume !(1 == ~T1_E~0); 3369#L292-1 assume !(1 == ~E_M~0); 3370#L297-1 assume !(1 == ~E_1~0); 3352#L302-1 assume { :end_inline_reset_delta_events } true; 3353#L428-2 [2022-07-13 04:21:52,803 INFO L754 eck$LassoCheckResult]: Loop: 3353#L428-2 assume !false; 3445#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 3417#L234 assume !false; 3646#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 3644#L188 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 3643#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 3642#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 3483#L215 assume !(0 != eval_~tmp~0#1); 3306#L249 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 3307#L163-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 3343#L259-3 assume !(0 == ~M_E~0); 3478#L259-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 3458#L264-3 assume 0 == ~E_M~0;~E_M~0 := 1; 3330#L269-3 assume 0 == ~E_1~0;~E_1~0 := 1; 3331#L274-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 3321#L124-9 assume !(1 == ~m_pc~0); 3322#L124-11 is_master_triggered_~__retres1~0#1 := 0; 3415#L135-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 3341#L136-3 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 3342#L319-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 3442#L319-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 3408#L143-9 assume !(1 == ~t1_pc~0); 3344#L143-11 is_transmit1_triggered_~__retres1~1#1 := 0; 3345#L154-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 3325#L155-3 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 3326#L327-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 3459#L327-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3480#L287-3 assume !(1 == ~M_E~0); 3418#L287-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 3419#L292-3 assume 1 == ~E_M~0;~E_M~0 := 2; 3433#L297-3 assume 1 == ~E_1~0;~E_1~0 := 2; 3308#L302-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 3309#L188-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 3346#L200-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 3347#L201-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 3366#L447 assume !(0 == start_simulation_~tmp~3#1); 3367#L447-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 3310#L188-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 3311#L200-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 3651#L201-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 3453#L402 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 3454#L409 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 3461#L410 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 3410#L460 assume !(0 != start_simulation_~tmp___0~1#1); 3353#L428-2 [2022-07-13 04:21:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash 396697797, now seen corresponding path program 2 times [2022-07-13 04:21:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148112262] [2022-07-13 04:21:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:52,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:52,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash -817717740, now seen corresponding path program 2 times [2022-07-13 04:21:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931465820] [2022-07-13 04:21:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:52,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:52,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931465820] [2022-07-13 04:21:52,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931465820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:52,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:52,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:21:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918274281] [2022-07-13 04:21:52,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:52,873 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:21:52,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:52,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:21:52,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:21:52,873 INFO L87 Difference]: Start difference. First operand 407 states and 566 transitions. cyclomatic complexity: 161 Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) [2022-07-13 04:21:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:52,942 INFO L93 Difference]: Finished difference Result 693 states and 942 transitions. [2022-07-13 04:21:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:21:52,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 693 states and 942 transitions. [2022-07-13 04:21:52,953 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 660 [2022-07-13 04:21:52,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 693 states to 693 states and 942 transitions. [2022-07-13 04:21:52,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 693 [2022-07-13 04:21:52,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 693 [2022-07-13 04:21:52,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 693 states and 942 transitions. [2022-07-13 04:21:52,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:52,957 INFO L369 hiAutomatonCegarLoop]: Abstraction has 693 states and 942 transitions. [2022-07-13 04:21:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states and 942 transitions. [2022-07-13 04:21:52,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 419. [2022-07-13 04:21:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 419 states have (on average 1.3794749403341289) internal successors, (578), 418 states have internal predecessors, (578), 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) [2022-07-13 04:21:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 578 transitions. [2022-07-13 04:21:52,962 INFO L392 hiAutomatonCegarLoop]: Abstraction has 419 states and 578 transitions. [2022-07-13 04:21:52,963 INFO L374 stractBuchiCegarLoop]: Abstraction has 419 states and 578 transitions. [2022-07-13 04:21:52,963 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 04:21:52,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 419 states and 578 transitions. [2022-07-13 04:21:52,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 388 [2022-07-13 04:21:52,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:52,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:52,969 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:52,969 INFO L180 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:52,969 INFO L752 eck$LassoCheckResult]: Stem: 4583#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 4500#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 4501#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 4516#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 4517#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 4512#L170-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 4513#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 4536#L259 assume !(0 == ~M_E~0); 4537#L259-2 assume !(0 == ~T1_E~0); 4558#L264-1 assume !(0 == ~E_M~0); 4559#L269-1 assume !(0 == ~E_1~0); 4553#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 4554#L124 assume !(1 == ~m_pc~0); 4525#L124-2 is_master_triggered_~__retres1~0#1 := 0; 4526#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 4448#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 4449#L319 assume !(0 != activate_threads_~tmp~1#1); 4450#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 4451#L143 assume !(1 == ~t1_pc~0); 4434#L143-2 is_transmit1_triggered_~__retres1~1#1 := 0; 4435#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 4511#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 4466#L327 assume !(0 != activate_threads_~tmp___0~0#1); 4467#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4488#L287 assume !(1 == ~M_E~0); 4535#L287-2 assume !(1 == ~T1_E~0); 4483#L292-1 assume !(1 == ~E_M~0); 4484#L297-1 assume !(1 == ~E_1~0); 4468#L302-1 assume { :end_inline_reset_delta_events } true; 4469#L428-2 [2022-07-13 04:21:52,969 INFO L754 eck$LassoCheckResult]: Loop: 4469#L428-2 assume !false; 4691#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 4676#L234 assume !false; 4674#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 4671#L188 assume !(0 == ~m_st~0); 4667#L192 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 4663#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 4654#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 4653#L215 assume !(0 != eval_~tmp~0#1); 4652#L249 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 4651#L163-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 4650#L259-3 assume !(0 == ~M_E~0); 4649#L259-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 4648#L264-3 assume 0 == ~E_M~0;~E_M~0 := 1; 4444#L269-3 assume 0 == ~E_1~0;~E_1~0 := 1; 4445#L274-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 4436#L124-9 assume !(1 == ~m_pc~0); 4437#L124-11 is_master_triggered_~__retres1~0#1 := 0; 4527#L135-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 4457#L136-3 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 4458#L319-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 4504#L319-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 4505#L143-9 assume !(1 == ~t1_pc~0); 4730#L143-11 is_transmit1_triggered_~__retres1~1#1 := 0; 4770#L154-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 4769#L155-3 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 4768#L327-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 4767#L327-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4766#L287-3 assume !(1 == ~M_E~0); 4765#L287-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 4764#L292-3 assume 1 == ~E_M~0;~E_M~0 := 2; 4763#L297-3 assume 1 == ~E_1~0;~E_1~0 := 2; 4762#L302-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 4761#L188-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 4758#L200-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 4756#L201-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 4753#L447 assume !(0 == start_simulation_~tmp~3#1); 4750#L447-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 4749#L188-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 4731#L200-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 4706#L201-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 4704#L402 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 4702#L409 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 4700#L410 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 4698#L460 assume !(0 != start_simulation_~tmp___0~1#1); 4469#L428-2 [2022-07-13 04:21:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 396697797, now seen corresponding path program 3 times [2022-07-13 04:21:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:52,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888671748] [2022-07-13 04:21:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:52,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:52,982 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:53,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,002 INFO L85 PathProgramCache]: Analyzing trace with hash 56440981, now seen corresponding path program 1 times [2022-07-13 04:21:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147008313] [2022-07-13 04:21:53,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:53,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:53,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147008313] [2022-07-13 04:21:53,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147008313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:53,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:53,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:21:53,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319108120] [2022-07-13 04:21:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:53,063 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:21:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:53,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:21:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:21:53,064 INFO L87 Difference]: Start difference. First operand 419 states and 578 transitions. cyclomatic complexity: 161 Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) [2022-07-13 04:21:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:53,145 INFO L93 Difference]: Finished difference Result 792 states and 1077 transitions. [2022-07-13 04:21:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 04:21:53,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 792 states and 1077 transitions. [2022-07-13 04:21:53,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 761 [2022-07-13 04:21:53,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 792 states to 792 states and 1077 transitions. [2022-07-13 04:21:53,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 792 [2022-07-13 04:21:53,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 792 [2022-07-13 04:21:53,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 792 states and 1077 transitions. [2022-07-13 04:21:53,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:53,165 INFO L369 hiAutomatonCegarLoop]: Abstraction has 792 states and 1077 transitions. [2022-07-13 04:21:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states and 1077 transitions. [2022-07-13 04:21:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 440. [2022-07-13 04:21:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 440 states have (on average 1.3477272727272727) internal successors, (593), 439 states have internal predecessors, (593), 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) [2022-07-13 04:21:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 593 transitions. [2022-07-13 04:21:53,171 INFO L392 hiAutomatonCegarLoop]: Abstraction has 440 states and 593 transitions. [2022-07-13 04:21:53,171 INFO L374 stractBuchiCegarLoop]: Abstraction has 440 states and 593 transitions. [2022-07-13 04:21:53,171 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 04:21:53,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 593 transitions. [2022-07-13 04:21:53,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 409 [2022-07-13 04:21:53,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:53,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:53,175 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:53,175 INFO L180 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:53,175 INFO L752 eck$LassoCheckResult]: Stem: 5815#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 5725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 5726#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 5743#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 5744#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 5738#L170-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5739#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 5764#L259 assume !(0 == ~M_E~0); 5765#L259-2 assume !(0 == ~T1_E~0); 5786#L264-1 assume !(0 == ~E_M~0); 5787#L269-1 assume !(0 == ~E_1~0); 5780#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 5781#L124 assume !(1 == ~m_pc~0); 5752#L124-2 is_master_triggered_~__retres1~0#1 := 0; 5753#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 5672#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 5673#L319 assume !(0 != activate_threads_~tmp~1#1); 5674#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 5675#L143 assume !(1 == ~t1_pc~0); 5658#L143-2 is_transmit1_triggered_~__retres1~1#1 := 0; 5659#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 5737#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 5686#L327 assume !(0 != activate_threads_~tmp___0~0#1); 5687#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 5712#L287 assume !(1 == ~M_E~0); 5760#L287-2 assume !(1 == ~T1_E~0); 5707#L292-1 assume !(1 == ~E_M~0); 5708#L297-1 assume !(1 == ~E_1~0); 5688#L302-1 assume { :end_inline_reset_delta_events } true; 5689#L428-2 [2022-07-13 04:21:53,175 INFO L754 eck$LassoCheckResult]: Loop: 5689#L428-2 assume !false; 5866#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 5867#L234 assume !false; 5862#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 5863#L188 assume !(0 == ~m_st~0); 5856#L192 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 5858#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 5852#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 5853#L215 assume !(0 != eval_~tmp~0#1); 5847#L249 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 5848#L163-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 5843#L259-3 assume !(0 == ~M_E~0); 5844#L259-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 5839#L264-3 assume 0 == ~E_M~0;~E_M~0 := 1; 5840#L269-3 assume 0 == ~E_1~0;~E_1~0 := 1; 5748#L274-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 5749#L124-9 assume !(1 == ~m_pc~0); 5989#L124-11 is_master_triggered_~__retres1~0#1 := 0; 5986#L135-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 5983#L136-3 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 5980#L319-9 assume !(0 != activate_threads_~tmp~1#1); 5977#L319-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 5974#L143-9 assume !(1 == ~t1_pc~0); 5971#L143-11 is_transmit1_triggered_~__retres1~1#1 := 0; 5969#L154-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 5967#L155-3 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 5965#L327-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 5963#L327-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 5947#L287-3 assume !(1 == ~M_E~0); 5948#L287-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 5939#L292-3 assume 1 == ~E_M~0;~E_M~0 := 2; 5940#L297-3 assume 1 == ~E_1~0;~E_1~0 := 2; 5931#L302-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 5932#L188-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 5922#L200-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 5923#L201-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 5915#L447 assume !(0 == start_simulation_~tmp~3#1); 5914#L447-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 5910#L188-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 5909#L200-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 5904#L201-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 5905#L402 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 5900#L409 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 5901#L410 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 5897#L460 assume !(0 != start_simulation_~tmp___0~1#1); 5689#L428-2 [2022-07-13 04:21:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 396697797, now seen corresponding path program 4 times [2022-07-13 04:21:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088377149] [2022-07-13 04:21:53,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash 196989591, now seen corresponding path program 1 times [2022-07-13 04:21:53,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558753830] [2022-07-13 04:21:53,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:53,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558753830] [2022-07-13 04:21:53,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558753830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:53,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:53,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:21:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331673423] [2022-07-13 04:21:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:53,202 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:21:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:21:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:21:53,203 INFO L87 Difference]: Start difference. First operand 440 states and 593 transitions. cyclomatic complexity: 155 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2022-07-13 04:21:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:53,224 INFO L93 Difference]: Finished difference Result 641 states and 847 transitions. [2022-07-13 04:21:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:21:53,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 641 states and 847 transitions. [2022-07-13 04:21:53,228 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 606 [2022-07-13 04:21:53,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 641 states to 641 states and 847 transitions. [2022-07-13 04:21:53,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 641 [2022-07-13 04:21:53,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 641 [2022-07-13 04:21:53,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 641 states and 847 transitions. [2022-07-13 04:21:53,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:53,233 INFO L369 hiAutomatonCegarLoop]: Abstraction has 641 states and 847 transitions. [2022-07-13 04:21:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states and 847 transitions. [2022-07-13 04:21:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 624. [2022-07-13 04:21:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 624 states have (on average 1.3237179487179487) internal successors, (826), 623 states have internal predecessors, (826), 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) [2022-07-13 04:21:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 826 transitions. [2022-07-13 04:21:53,240 INFO L392 hiAutomatonCegarLoop]: Abstraction has 624 states and 826 transitions. [2022-07-13 04:21:53,240 INFO L374 stractBuchiCegarLoop]: Abstraction has 624 states and 826 transitions. [2022-07-13 04:21:53,241 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 04:21:53,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 624 states and 826 transitions. [2022-07-13 04:21:53,243 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 589 [2022-07-13 04:21:53,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:53,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:53,244 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:53,245 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:53,245 INFO L752 eck$LassoCheckResult]: Stem: 6898#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 6811#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 6812#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 6826#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 6827#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 6821#L170-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 6822#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 6845#L259 assume !(0 == ~M_E~0); 6846#L259-2 assume !(0 == ~T1_E~0); 6866#L264-1 assume !(0 == ~E_M~0); 6867#L269-1 assume !(0 == ~E_1~0); 6862#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 6863#L124 assume !(1 == ~m_pc~0); 6833#L124-2 is_master_triggered_~__retres1~0#1 := 0; 6834#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 6756#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 6757#L319 assume !(0 != activate_threads_~tmp~1#1); 6758#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 6759#L143 assume !(1 == ~t1_pc~0); 6743#L143-2 is_transmit1_triggered_~__retres1~1#1 := 0; 6744#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 6820#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 6773#L327 assume !(0 != activate_threads_~tmp___0~0#1); 6774#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6796#L287 assume !(1 == ~M_E~0); 6842#L287-2 assume !(1 == ~T1_E~0); 6791#L292-1 assume !(1 == ~E_M~0); 6792#L297-1 assume !(1 == ~E_1~0); 6775#L302-1 assume { :end_inline_reset_delta_events } true; 6776#L428-2 assume !false; 7339#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 7114#L234 [2022-07-13 04:21:53,245 INFO L754 eck$LassoCheckResult]: Loop: 7114#L234 assume !false; 7336#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 7334#L188 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 7325#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 7324#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 7322#L215 assume 0 != eval_~tmp~0#1; 7321#L215-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 6843#L223 assume !(0 != eval_~tmp_ndt_1~0#1); 6844#L220 assume !(0 == ~t1_st~0); 7114#L234 [2022-07-13 04:21:53,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1025502329, now seen corresponding path program 1 times [2022-07-13 04:21:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711816013] [2022-07-13 04:21:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,252 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2078330545, now seen corresponding path program 1 times [2022-07-13 04:21:53,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507586921] [2022-07-13 04:21:53,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:53,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1188516331, now seen corresponding path program 1 times [2022-07-13 04:21:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437079991] [2022-07-13 04:21:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:53,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437079991] [2022-07-13 04:21:53,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437079991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:53,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:53,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:21:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899960843] [2022-07-13 04:21:53,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:53,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:21:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:21:53,361 INFO L87 Difference]: Start difference. First operand 624 states and 826 transitions. cyclomatic complexity: 206 Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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) [2022-07-13 04:21:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:53,410 INFO L93 Difference]: Finished difference Result 1035 states and 1346 transitions. [2022-07-13 04:21:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:21:53,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1035 states and 1346 transitions. [2022-07-13 04:21:53,414 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 973 [2022-07-13 04:21:53,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1035 states to 1035 states and 1346 transitions. [2022-07-13 04:21:53,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1035 [2022-07-13 04:21:53,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1035 [2022-07-13 04:21:53,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1035 states and 1346 transitions. [2022-07-13 04:21:53,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:53,419 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1035 states and 1346 transitions. [2022-07-13 04:21:53,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states and 1346 transitions. [2022-07-13 04:21:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1019. [2022-07-13 04:21:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1019 states have (on average 1.3052011776251227) internal successors, (1330), 1018 states have internal predecessors, (1330), 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) [2022-07-13 04:21:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1330 transitions. [2022-07-13 04:21:53,429 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1019 states and 1330 transitions. [2022-07-13 04:21:53,429 INFO L374 stractBuchiCegarLoop]: Abstraction has 1019 states and 1330 transitions. [2022-07-13 04:21:53,429 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 04:21:53,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1019 states and 1330 transitions. [2022-07-13 04:21:53,432 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 957 [2022-07-13 04:21:53,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:53,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:53,432 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:53,432 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:53,433 INFO L752 eck$LassoCheckResult]: Stem: 8580#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 8476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 8477#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 8494#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 8495#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 8489#L170-2 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 8490#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 9140#L259 assume !(0 == ~M_E~0); 9139#L259-2 assume !(0 == ~T1_E~0); 9138#L264-1 assume !(0 == ~E_M~0); 9137#L269-1 assume !(0 == ~E_1~0); 9136#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 9135#L124 assume !(1 == ~m_pc~0); 9134#L124-2 is_master_triggered_~__retres1~0#1 := 0; 9133#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 9132#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 9131#L319 assume !(0 != activate_threads_~tmp~1#1); 9130#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 9129#L143 assume !(1 == ~t1_pc~0); 9128#L143-2 is_transmit1_triggered_~__retres1~1#1 := 0; 9127#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 9126#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 9125#L327 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 8439#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 8463#L287 assume !(1 == ~M_E~0); 8514#L287-2 assume !(1 == ~T1_E~0); 8458#L292-1 assume !(1 == ~E_M~0); 8459#L297-1 assume !(1 == ~E_1~0); 8440#L302-1 assume { :end_inline_reset_delta_events } true; 8441#L428-2 assume !false; 9121#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 9119#L234 [2022-07-13 04:21:53,433 INFO L754 eck$LassoCheckResult]: Loop: 9119#L234 assume !false; 9117#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 9105#L188 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 9102#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 9103#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 9096#L215 assume 0 != eval_~tmp~0#1; 9097#L215-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 9088#L223 assume !(0 != eval_~tmp_ndt_1~0#1); 8512#L220 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;eval_~tmp_ndt_2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 8513#L237 assume !(0 != eval_~tmp_ndt_2~0#1); 9119#L234 [2022-07-13 04:21:53,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1643521085, now seen corresponding path program 1 times [2022-07-13 04:21:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043550946] [2022-07-13 04:21:53,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:21:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:21:53,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:21:53,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043550946] [2022-07-13 04:21:53,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043550946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:21:53,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:21:53,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:21:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46926399] [2022-07-13 04:21:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:21:53,474 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:21:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash 3735164, now seen corresponding path program 1 times [2022-07-13 04:21:53,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271956567] [2022-07-13 04:21:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:53,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:21:53,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:21:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:21:53,552 INFO L87 Difference]: Start difference. First operand 1019 states and 1330 transitions. cyclomatic complexity: 316 Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-07-13 04:21:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:21:53,558 INFO L93 Difference]: Finished difference Result 984 states and 1283 transitions. [2022-07-13 04:21:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:21:53,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 984 states and 1283 transitions. [2022-07-13 04:21:53,562 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 948 [2022-07-13 04:21:53,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 984 states to 984 states and 1283 transitions. [2022-07-13 04:21:53,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 984 [2022-07-13 04:21:53,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 984 [2022-07-13 04:21:53,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 984 states and 1283 transitions. [2022-07-13 04:21:53,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:21:53,567 INFO L369 hiAutomatonCegarLoop]: Abstraction has 984 states and 1283 transitions. [2022-07-13 04:21:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states and 1283 transitions. [2022-07-13 04:21:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2022-07-13 04:21:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 984 states have (on average 1.3038617886178863) internal successors, (1283), 983 states have internal predecessors, (1283), 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) [2022-07-13 04:21:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1283 transitions. [2022-07-13 04:21:53,577 INFO L392 hiAutomatonCegarLoop]: Abstraction has 984 states and 1283 transitions. [2022-07-13 04:21:53,577 INFO L374 stractBuchiCegarLoop]: Abstraction has 984 states and 1283 transitions. [2022-07-13 04:21:53,577 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 04:21:53,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 984 states and 1283 transitions. [2022-07-13 04:21:53,580 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 948 [2022-07-13 04:21:53,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:21:53,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:21:53,581 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-13 04:21:53,581 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:21:53,581 INFO L752 eck$LassoCheckResult]: Stem: 10578#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(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 10484#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 10485#L391 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 10501#L163 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 10502#L170 assume 1 == ~m_i~0;~m_st~0 := 0; 10496#L170-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 10497#L175-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 10521#L259 assume !(0 == ~M_E~0); 10522#L259-2 assume !(0 == ~T1_E~0); 10546#L264-1 assume !(0 == ~E_M~0); 10547#L269-1 assume !(0 == ~E_1~0); 10539#L274-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 10540#L124 assume !(1 == ~m_pc~0); 10509#L124-2 is_master_triggered_~__retres1~0#1 := 0; 10510#L135 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 10432#L136 activate_threads_#t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 10433#L319 assume !(0 != activate_threads_~tmp~1#1); 10434#L319-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 10435#L143 assume !(1 == ~t1_pc~0); 10419#L143-2 is_transmit1_triggered_~__retres1~1#1 := 0; 10420#L154 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 10495#L155 activate_threads_#t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 10447#L327 assume !(0 != activate_threads_~tmp___0~0#1); 10448#L327-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 10471#L287 assume !(1 == ~M_E~0); 10515#L287-2 assume !(1 == ~T1_E~0); 10466#L292-1 assume !(1 == ~E_M~0); 10467#L297-1 assume !(1 == ~E_1~0); 10449#L302-1 assume { :end_inline_reset_delta_events } true; 10450#L428-2 assume !false; 10832#L429 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 10814#L234 [2022-07-13 04:21:53,581 INFO L754 eck$LassoCheckResult]: Loop: 10814#L234 assume !false; 10829#L211 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 10827#L188 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 10825#L200 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 10823#L201 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 10821#L215 assume 0 != eval_~tmp~0#1; 10819#L215-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 10817#L223 assume !(0 != eval_~tmp_ndt_1~0#1); 10815#L220 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;eval_~tmp_ndt_2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 10813#L237 assume !(0 != eval_~tmp_ndt_2~0#1); 10814#L234 [2022-07-13 04:21:53,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1025502329, now seen corresponding path program 2 times [2022-07-13 04:21:53,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398900316] [2022-07-13 04:21:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 3735164, now seen corresponding path program 2 times [2022-07-13 04:21:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002713751] [2022-07-13 04:21:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:21:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1810701694, now seen corresponding path program 1 times [2022-07-13 04:21:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:21:53,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39367170] [2022-07-13 04:21:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:21:53,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:21:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:21:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:21:53,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:21:54,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 04:21:54 BoogieIcfgContainer [2022-07-13 04:21:54,044 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 04:21:54,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 04:21:54,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 04:21:54,044 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 04:21:54,045 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:21:51" (3/4) ... [2022-07-13 04:21:54,046 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 04:21:54,070 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 04:21:54,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 04:21:54,070 INFO L158 Benchmark]: Toolchain (without parser) took 2973.04ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 57.0MB in the beginning and 98.0MB in the end (delta: -41.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2022-07-13 04:21:54,071 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:21:54,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.64ms. Allocated memory is still 90.2MB. Free memory was 56.8MB in the beginning and 64.0MB in the end (delta: -7.2MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-13 04:21:54,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.37ms. Allocated memory is still 90.2MB. Free memory was 64.0MB in the beginning and 61.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:21:54,071 INFO L158 Benchmark]: Boogie Preprocessor took 39.92ms. Allocated memory is still 90.2MB. Free memory was 61.3MB in the beginning and 59.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:21:54,071 INFO L158 Benchmark]: RCFGBuilder took 438.40ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 59.4MB in the beginning and 85.7MB in the end (delta: -26.2MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2022-07-13 04:21:54,072 INFO L158 Benchmark]: BuchiAutomizer took 2187.01ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 85.2MB in the beginning and 100.1MB in the end (delta: -14.8MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2022-07-13 04:21:54,072 INFO L158 Benchmark]: Witness Printer took 25.84ms. Allocated memory is still 136.3MB. Free memory was 100.1MB in the beginning and 98.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:21:54,073 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 90.2MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.64ms. Allocated memory is still 90.2MB. Free memory was 56.8MB in the beginning and 64.0MB in the end (delta: -7.2MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.37ms. Allocated memory is still 90.2MB. Free memory was 64.0MB in the beginning and 61.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.92ms. Allocated memory is still 90.2MB. Free memory was 61.3MB in the beginning and 59.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.40ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 59.4MB in the beginning and 85.7MB in the end (delta: -26.2MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 2187.01ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 85.2MB in the beginning and 100.1MB in the end (delta: -14.8MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. * Witness Printer took 25.84ms. Allocated memory is still 136.3MB. Free memory was 100.1MB in the beginning and 98.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 984 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 777 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2356 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2356 mSDsluCounter, 4359 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2303 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 2056 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN1 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 210]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47874306=0, token=0, NULL=1, \result=0, tmp=0, __retres1=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@799534f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76aec799=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@683a2810=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f6d733b=0, t1_pc=0, tmp_ndt_2=0, tmp___0=0, T1_E=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26bd0727=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7db56e6b=0, E_1=2, __retres1=0, M_E=2, tmp_ndt_1=0, __retres1=1, tmp=1, \result=0, m_i=1, t1_st=0, __retres1=0, local=0, m_st=0, E_M=2, NULL=0, kernel_st=1, tmp___0=0, t1_i=1, m_pc=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 210]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 [L421] FCALL update_channels() [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 [L422] RET init_threads() [L423] CALL fire_delta_events() [L259] COND FALSE !(M_E == 0) [L264] COND FALSE !(T1_E == 0) [L269] COND FALSE !(E_M == 0) [L274] COND FALSE !(E_1 == 0) [L423] RET fire_delta_events() [L424] CALL activate_threads() [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; [L124] COND FALSE !(m_pc == 1) [L134] __retres1 = 0 [L136] return (__retres1); [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; [L143] COND FALSE !(t1_pc == 1) [L153] __retres1 = 0 [L155] return (__retres1); [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) [L424] RET activate_threads() [L425] CALL reset_delta_events() [L287] COND FALSE !(M_E == 1) [L292] COND FALSE !(T1_E == 1) [L297] COND FALSE !(E_M == 1) [L302] COND FALSE !(E_1 == 1) [L425] RET reset_delta_events() [L428] COND TRUE 1 [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; Loop: [L210] COND TRUE 1 [L213] CALL, EXPR exists_runnable_thread() [L185] int __retres1 ; [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 [L201] return (__retres1); [L213] RET, EXPR exists_runnable_thread() [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 04:21:54,108 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)