./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt --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 f6768ec4cb10c0d030986cdc2e459713dbcdaadd .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:16:54,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:16:54,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:16:55,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:16:55,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:16:55,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:16:55,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:16:55,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:16:55,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:16:55,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:16:55,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:16:55,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:16:55,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:16:55,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:16:55,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:16:55,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:16:55,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:16:55,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:16:55,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:16:55,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:16:55,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:16:55,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:16:55,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:16:55,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:16:55,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:16:55,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:16:55,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:16:55,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:16:55,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:16:55,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:16:55,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:16:55,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:16:55,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:16:55,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:16:55,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:16:55,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:16:55,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:16:55,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:16:55,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:16:55,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:16:55,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:16:55,089 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-13 00:16:55,138 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:16:55,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:16:55,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:16:55,146 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:16:55,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:16:55,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:16:55,150 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:16:55,150 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-13 00:16:55,150 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-13 00:16:55,151 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-13 00:16:55,152 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-13 00:16:55,152 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-13 00:16:55,153 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-13 00:16:55,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:16:55,153 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:16:55,154 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 00:16:55,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:16:55,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:16:55,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:16:55,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-13 00:16:55,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-13 00:16:55,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-13 00:16:55,155 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:16:55,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:16:55,156 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-13 00:16:55,156 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:16:55,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-13 00:16:55,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:16:55,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:16:55,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:16:55,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:16:55,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:16:55,162 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-13 00:16:55,162 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt 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 -> f6768ec4cb10c0d030986cdc2e459713dbcdaadd [2021-10-13 00:16:55,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:16:55,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:16:55,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:16:55,653 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:16:55,655 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:16:55,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2021-10-13 00:16:55,753 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/data/15fbfc743/4febfce8c66b49f59d76532b02859854/FLAG6a5219a05 [2021-10-13 00:16:56,351 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:16:56,356 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/sv-benchmarks/c/systemc/transmitter.03.cil.c [2021-10-13 00:16:56,395 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/data/15fbfc743/4febfce8c66b49f59d76532b02859854/FLAG6a5219a05 [2021-10-13 00:16:56,686 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/data/15fbfc743/4febfce8c66b49f59d76532b02859854 [2021-10-13 00:16:56,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:16:56,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:16:56,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:16:56,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:16:56,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:16:56,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:16:56" (1/1) ... [2021-10-13 00:16:56,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729eeeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:56, skipping insertion in model container [2021-10-13 00:16:56,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:16:56" (1/1) ... [2021-10-13 00:16:56,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:16:56,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:16:56,936 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/sv-benchmarks/c/systemc/transmitter.03.cil.c[401,414] [2021-10-13 00:16:57,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:16:57,020 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:16:57,035 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/sv-benchmarks/c/systemc/transmitter.03.cil.c[401,414] [2021-10-13 00:16:57,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:16:57,098 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:16:57,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57 WrapperNode [2021-10-13 00:16:57,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:16:57,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:16:57,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:16:57,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:16:57,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:16:57,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:16:57,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:16:57,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:16:57,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:16:57,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:16:57,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:16:57,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:16:57,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (1/1) ... [2021-10-13 00:16:57,344 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:16:57,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:16:57,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:16:57,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-13 00:16:57,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:16:57,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:16:57,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:16:57,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:16:58,423 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:16:58,423 INFO L299 CfgBuilder]: Removed 119 assume(true) statements. [2021-10-13 00:16:58,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:16:58 BoogieIcfgContainer [2021-10-13 00:16:58,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:16:58,428 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-13 00:16:58,428 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-13 00:16:58,435 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-13 00:16:58,436 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:16:58,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 12:16:56" (1/3) ... [2021-10-13 00:16:58,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55351b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:16:58, skipping insertion in model container [2021-10-13 00:16:58,440 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:16:58,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:16:57" (2/3) ... [2021-10-13 00:16:58,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55351b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:16:58, skipping insertion in model container [2021-10-13 00:16:58,440 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:16:58,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:16:58" (3/3) ... [2021-10-13 00:16:58,442 INFO L389 chiAutomizerObserver]: Analyzing ICFG transmitter.03.cil.c [2021-10-13 00:16:58,501 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-13 00:16:58,501 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-13 00:16:58,502 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-13 00:16:58,502 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-13 00:16:58,502 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-13 00:16:58,502 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-13 00:16:58,502 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-13 00:16:58,502 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-13 00:16:58,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 275 states, 274 states have (on average 1.572992700729927) internal successors, (431), 274 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:58,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2021-10-13 00:16:58,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:16:58,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:16:58,590 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:58,590 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:58,590 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-13 00:16:58,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 275 states, 274 states have (on average 1.572992700729927) internal successors, (431), 274 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:58,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2021-10-13 00:16:58,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:16:58,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:16:58,615 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:58,616 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:58,625 INFO L791 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 177#L-1true havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 37#L607true havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 18#L266true assume !(1 == ~m_i~0);~m_st~0 := 2; 195#L273-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 104#L278-1true assume !(1 == ~t2_i~0);~t2_st~0 := 2; 73#L283-1true assume !(1 == ~t3_i~0);~t3_st~0 := 2; 201#L288-1true assume !(0 == ~M_E~0); 126#L410-1true assume !(0 == ~T1_E~0); 154#L415-1true assume !(0 == ~T2_E~0); 55#L420-1true assume !(0 == ~T3_E~0); 84#L425-1true assume !(0 == ~E_1~0); 42#L430-1true assume 0 == ~E_2~0;~E_2~0 := 1; 131#L435-1true assume !(0 == ~E_3~0); 160#L440-1true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 90#L189true assume !(1 == ~m_pc~0); 56#L189-2true is_master_triggered_~__retres1~0 := 0; 108#L200true is_master_triggered_#res := is_master_triggered_~__retres1~0; 198#L201true activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 46#L502true assume !(0 != activate_threads_~tmp~1); 123#L502-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 252#L208true assume 1 == ~t1_pc~0; 256#L209true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 273#L219true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 68#L220true activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 221#L510true assume !(0 != activate_threads_~tmp___0~0); 10#L510-2true havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 99#L227true assume !(1 == ~t2_pc~0); 43#L227-2true is_transmit2_triggered_~__retres1~2 := 0; 161#L238true is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 163#L239true activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 11#L518true assume !(0 != activate_threads_~tmp___1~0); 116#L518-2true havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 69#L246true assume 1 == ~t3_pc~0; 109#L247true assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 127#L257true is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 166#L258true activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 235#L526true assume !(0 != activate_threads_~tmp___2~0); 243#L526-2true assume !(1 == ~M_E~0); 172#L453-1true assume 1 == ~T1_E~0;~T1_E~0 := 2; 129#L458-1true assume !(1 == ~T2_E~0); 271#L463-1true assume !(1 == ~T3_E~0); 274#L468-1true assume !(1 == ~E_1~0); 97#L473-1true assume !(1 == ~E_2~0); 118#L478-1true assume !(1 == ~E_3~0); 119#L644-1true [2021-10-13 00:16:58,627 INFO L793 eck$LassoCheckResult]: Loop: 119#L644-1true assume !false; 138#L645true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 152#L385true assume false; 75#L400true start_simulation_~kernel_st~0 := 2; 164#L266-1true start_simulation_~kernel_st~0 := 3; 4#L410-2true assume 0 == ~M_E~0;~M_E~0 := 1; 165#L410-4true assume 0 == ~T1_E~0;~T1_E~0 := 1; 20#L415-3true assume 0 == ~T2_E~0;~T2_E~0 := 1; 232#L420-3true assume 0 == ~T3_E~0;~T3_E~0 := 1; 155#L425-3true assume 0 == ~E_1~0;~E_1~0 := 1; 204#L430-3true assume 0 == ~E_2~0;~E_2~0 := 1; 159#L435-3true assume 0 == ~E_3~0;~E_3~0 := 1; 158#L440-3true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 44#L189-12true assume !(1 == ~m_pc~0); 156#L189-14true is_master_triggered_~__retres1~0 := 0; 176#L200-4true is_master_triggered_#res := is_master_triggered_~__retres1~0; 112#L201-4true activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 49#L502-12true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 41#L502-14true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 94#L208-12true assume !(1 == ~t1_pc~0); 122#L208-14true is_transmit1_triggered_~__retres1~1 := 0; 7#L219-4true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 34#L220-4true activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 14#L510-12true assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 86#L510-14true havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 185#L227-12true assume !(1 == ~t2_pc~0); 120#L227-14true is_transmit2_triggered_~__retres1~2 := 0; 171#L238-4true is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 174#L239-4true activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 61#L518-12true assume !(0 != activate_threads_~tmp___1~0); 32#L518-14true havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 250#L246-12true assume !(1 == ~t3_pc~0); 143#L246-14true is_transmit3_triggered_~__retres1~3 := 0; 191#L257-4true is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 219#L258-4true activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 269#L526-12true assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 106#L526-14true assume 1 == ~M_E~0;~M_E~0 := 2; 192#L453-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 59#L458-3true assume 1 == ~T2_E~0;~T2_E~0 := 2; 110#L463-3true assume !(1 == ~T3_E~0); 151#L468-3true assume 1 == ~E_1~0;~E_1~0 := 2; 101#L473-3true assume 1 == ~E_2~0;~E_2~0 := 2; 193#L478-3true assume 1 == ~E_3~0;~E_3~0 := 2; 89#L483-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 103#L301-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 98#L323-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 229#L324-1true start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 22#L663true assume !(0 == start_simulation_~tmp~3); 184#L663-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 31#L301-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 194#L323-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 144#L324-2true stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 188#L618true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 125#L625true stop_simulation_#res := stop_simulation_~__retres2~0; 205#L626true start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 202#L676true assume !(0 != start_simulation_~tmp___0~1); 119#L644-1true [2021-10-13 00:16:58,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:58,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1271326673, now seen corresponding path program 1 times [2021-10-13 00:16:58,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:58,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165870351] [2021-10-13 00:16:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:58,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:16:58,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:58,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165870351] [2021-10-13 00:16:58,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165870351] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:58,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:58,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:58,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895382977] [2021-10-13 00:16:58,971 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:16:58,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1071508586, now seen corresponding path program 1 times [2021-10-13 00:16:58,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:58,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020676337] [2021-10-13 00:16:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:58,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:16:59,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:59,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020676337] [2021-10-13 00:16:59,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020676337] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:59,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:59,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:16:59,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678610934] [2021-10-13 00:16:59,047 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:16:59,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:59,070 INFO L87 Difference]: Start difference. First operand has 275 states, 274 states have (on average 1.572992700729927) internal successors, (431), 274 states have internal predecessors, (431), 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 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) [2021-10-13 00:16:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:59,168 INFO L93 Difference]: Finished difference Result 275 states and 415 transitions. [2021-10-13 00:16:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:59,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 415 transitions. [2021-10-13 00:16:59,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2021-10-13 00:16:59,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 270 states and 410 transitions. [2021-10-13 00:16:59,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2021-10-13 00:16:59,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2021-10-13 00:16:59,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 410 transitions. [2021-10-13 00:16:59,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:16:59,207 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 410 transitions. [2021-10-13 00:16:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 410 transitions. [2021-10-13 00:16:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-13 00:16:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5185185185185186) internal successors, (410), 269 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 410 transitions. [2021-10-13 00:16:59,270 INFO L704 BuchiCegarLoop]: Abstraction has 270 states and 410 transitions. [2021-10-13 00:16:59,270 INFO L587 BuchiCegarLoop]: Abstraction has 270 states and 410 transitions. [2021-10-13 00:16:59,271 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-13 00:16:59,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 410 transitions. [2021-10-13 00:16:59,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2021-10-13 00:16:59,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:16:59,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:16:59,286 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:59,286 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:59,287 INFO L791 eck$LassoCheckResult]: Stem: 827#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 794#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 622#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 589#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 590#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 730#L278-1 assume !(1 == ~t2_i~0);~t2_st~0 := 2; 694#L283-1 assume !(1 == ~t3_i~0);~t3_st~0 := 2; 695#L288-1 assume !(0 == ~M_E~0); 753#L410-1 assume !(0 == ~T1_E~0); 754#L415-1 assume !(0 == ~T2_E~0); 659#L420-1 assume !(0 == ~T3_E~0); 660#L425-1 assume !(0 == ~E_1~0); 632#L430-1 assume 0 == ~E_2~0;~E_2~0 := 1; 633#L435-1 assume !(0 == ~E_3~0); 762#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 718#L189 assume !(1 == ~m_pc~0); 661#L189-2 is_master_triggered_~__retres1~0 := 0; 662#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 737#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 641#L502 assume !(0 != activate_threads_~tmp~1); 642#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 749#L208 assume 1 == ~t1_pc~0; 821#L209 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 823#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 681#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 682#L510 assume !(0 != activate_threads_~tmp___0~0); 575#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 576#L227 assume !(1 == ~t2_pc~0); 636#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 637#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 787#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 579#L518 assume !(0 != activate_threads_~tmp___1~0); 580#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 683#L246 assume 1 == ~t3_pc~0; 684#L247 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 738#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 755#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 789#L526 assume !(0 != activate_threads_~tmp___2~0); 815#L526-2 assume !(1 == ~M_E~0); 792#L453-1 assume 1 == ~T1_E~0;~T1_E~0 := 2; 758#L458-1 assume !(1 == ~T2_E~0); 759#L463-1 assume !(1 == ~T3_E~0); 828#L468-1 assume !(1 == ~E_1~0); 724#L473-1 assume !(1 == ~E_2~0); 725#L478-1 assume !(1 == ~E_3~0); 747#L644-1 [2021-10-13 00:16:59,287 INFO L793 eck$LassoCheckResult]: Loop: 747#L644-1 assume !false; 748#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 607#L385 assume !false; 623#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 624#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 562#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 563#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 594#L338 assume !(0 != eval_~tmp~0); 669#L400 start_simulation_~kernel_st~0 := 2; 696#L266-1 start_simulation_~kernel_st~0 := 3; 564#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 565#L410-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 592#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 593#L420-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 781#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 782#L430-3 assume 0 == ~E_2~0;~E_2~0 := 1; 786#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 785#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 638#L189-12 assume !(1 == ~m_pc~0); 640#L189-14 is_master_triggered_~__retres1~0 := 0; 783#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 743#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 647#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 630#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 631#L208-12 assume 1 == ~t1_pc~0; 721#L209-4 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 573#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 574#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 583#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 584#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 713#L227-12 assume 1 == ~t2_pc~0; 627#L228-4 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 628#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 791#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 670#L518-12 assume !(0 != activate_threads_~tmp___1~0); 615#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 616#L246-12 assume !(1 == ~t3_pc~0); 772#L246-14 is_transmit3_triggered_~__retres1~3 := 0; 773#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 803#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 810#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 735#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 736#L453-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 666#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 667#L463-3 assume !(1 == ~T3_E~0); 739#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 728#L473-3 assume 1 == ~E_2~0;~E_2~0 := 2; 729#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 716#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 717#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 602#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 726#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 595#L663 assume !(0 == start_simulation_~tmp~3); 597#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 612#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 613#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 774#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 775#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 751#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 752#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 805#L676 assume !(0 != start_simulation_~tmp___0~1); 747#L644-1 [2021-10-13 00:16:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:59,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1023180179, now seen corresponding path program 1 times [2021-10-13 00:16:59,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:59,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581461228] [2021-10-13 00:16:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:59,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:16:59,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:59,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581461228] [2021-10-13 00:16:59,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581461228] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:59,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:59,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:59,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707025150] [2021-10-13 00:16:59,428 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:16:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1826274219, now seen corresponding path program 1 times [2021-10-13 00:16:59,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:59,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472998511] [2021-10-13 00:16:59,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:59,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:16:59,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:59,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472998511] [2021-10-13 00:16:59,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472998511] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:59,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:59,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:59,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357403964] [2021-10-13 00:16:59,576 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:16:59,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:59,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:59,578 INFO L87 Difference]: Start difference. First operand 270 states and 410 transitions. cyclomatic complexity: 141 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) [2021-10-13 00:16:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:59,598 INFO L93 Difference]: Finished difference Result 270 states and 409 transitions. [2021-10-13 00:16:59,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:59,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 409 transitions. [2021-10-13 00:16:59,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2021-10-13 00:16:59,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 409 transitions. [2021-10-13 00:16:59,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2021-10-13 00:16:59,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2021-10-13 00:16:59,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 409 transitions. [2021-10-13 00:16:59,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:16:59,613 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 409 transitions. [2021-10-13 00:16:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 409 transitions. [2021-10-13 00:16:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-13 00:16:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5148148148148148) internal successors, (409), 269 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 409 transitions. [2021-10-13 00:16:59,638 INFO L704 BuchiCegarLoop]: Abstraction has 270 states and 409 transitions. [2021-10-13 00:16:59,638 INFO L587 BuchiCegarLoop]: Abstraction has 270 states and 409 transitions. [2021-10-13 00:16:59,638 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-13 00:16:59,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 409 transitions. [2021-10-13 00:16:59,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2021-10-13 00:16:59,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:16:59,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:16:59,644 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:59,644 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:59,644 INFO L791 eck$LassoCheckResult]: Stem: 1374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 1341#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 1169#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 1136#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 1137#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1277#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 1241#L283-1 assume !(1 == ~t3_i~0);~t3_st~0 := 2; 1242#L288-1 assume !(0 == ~M_E~0); 1300#L410-1 assume !(0 == ~T1_E~0); 1301#L415-1 assume !(0 == ~T2_E~0); 1206#L420-1 assume !(0 == ~T3_E~0); 1207#L425-1 assume !(0 == ~E_1~0); 1179#L430-1 assume 0 == ~E_2~0;~E_2~0 := 1; 1180#L435-1 assume !(0 == ~E_3~0); 1309#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1265#L189 assume !(1 == ~m_pc~0); 1208#L189-2 is_master_triggered_~__retres1~0 := 0; 1209#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1284#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1188#L502 assume !(0 != activate_threads_~tmp~1); 1189#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1296#L208 assume 1 == ~t1_pc~0; 1368#L209 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 1370#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1228#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1229#L510 assume !(0 != activate_threads_~tmp___0~0); 1122#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 1123#L227 assume !(1 == ~t2_pc~0); 1183#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 1184#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 1334#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1126#L518 assume !(0 != activate_threads_~tmp___1~0); 1127#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 1230#L246 assume 1 == ~t3_pc~0; 1231#L247 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 1285#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 1302#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 1336#L526 assume !(0 != activate_threads_~tmp___2~0); 1362#L526-2 assume !(1 == ~M_E~0); 1339#L453-1 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1305#L458-1 assume !(1 == ~T2_E~0); 1306#L463-1 assume !(1 == ~T3_E~0); 1375#L468-1 assume !(1 == ~E_1~0); 1271#L473-1 assume !(1 == ~E_2~0); 1272#L478-1 assume !(1 == ~E_3~0); 1294#L644-1 [2021-10-13 00:16:59,645 INFO L793 eck$LassoCheckResult]: Loop: 1294#L644-1 assume !false; 1295#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 1154#L385 assume !false; 1170#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 1171#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 1109#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 1110#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 1144#L338 assume !(0 != eval_~tmp~0); 1216#L400 start_simulation_~kernel_st~0 := 2; 1243#L266-1 start_simulation_~kernel_st~0 := 3; 1111#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1112#L410-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1139#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 1140#L420-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 1328#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1329#L430-3 assume 0 == ~E_2~0;~E_2~0 := 1; 1333#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 1332#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1185#L189-12 assume 1 == ~m_pc~0; 1186#L190-4 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 1331#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1290#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1196#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1177#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1178#L208-12 assume 1 == ~t1_pc~0; 1268#L209-4 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 1120#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1121#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1130#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 1131#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 1260#L227-12 assume 1 == ~t2_pc~0; 1174#L228-4 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 1175#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 1338#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1217#L518-12 assume !(0 != activate_threads_~tmp___1~0); 1162#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 1163#L246-12 assume 1 == ~t3_pc~0; 1360#L247-4 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 1318#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 1350#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 1357#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 1278#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 1279#L453-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1213#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 1214#L463-3 assume !(1 == ~T3_E~0); 1286#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1274#L473-3 assume 1 == ~E_2~0;~E_2~0 := 2; 1275#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 1262#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 1263#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 1149#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 1273#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 1141#L663 assume !(0 == start_simulation_~tmp~3); 1143#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 1159#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 1160#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 1321#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 1322#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1298#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 1299#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 1352#L676 assume !(0 != start_simulation_~tmp___0~1); 1294#L644-1 [2021-10-13 00:16:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:59,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1899979819, now seen corresponding path program 1 times [2021-10-13 00:16:59,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:59,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140396770] [2021-10-13 00:16:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:59,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:16:59,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:59,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140396770] [2021-10-13 00:16:59,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140396770] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:59,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:59,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:59,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557652190] [2021-10-13 00:16:59,712 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:16:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1985347945, now seen corresponding path program 1 times [2021-10-13 00:16:59,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:59,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078920912] [2021-10-13 00:16:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:59,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:16:59,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:59,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078920912] [2021-10-13 00:16:59,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078920912] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:59,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:59,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:16:59,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621404344] [2021-10-13 00:16:59,784 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:16:59,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:16:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:16:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:16:59,785 INFO L87 Difference]: Start difference. First operand 270 states and 409 transitions. cyclomatic complexity: 140 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) [2021-10-13 00:16:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:16:59,812 INFO L93 Difference]: Finished difference Result 270 states and 408 transitions. [2021-10-13 00:16:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:16:59,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 408 transitions. [2021-10-13 00:16:59,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2021-10-13 00:16:59,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 408 transitions. [2021-10-13 00:16:59,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2021-10-13 00:16:59,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2021-10-13 00:16:59,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 408 transitions. [2021-10-13 00:16:59,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:16:59,834 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 408 transitions. [2021-10-13 00:16:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 408 transitions. [2021-10-13 00:16:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-13 00:16:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.511111111111111) internal successors, (408), 269 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:16:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 408 transitions. [2021-10-13 00:16:59,863 INFO L704 BuchiCegarLoop]: Abstraction has 270 states and 408 transitions. [2021-10-13 00:16:59,863 INFO L587 BuchiCegarLoop]: Abstraction has 270 states and 408 transitions. [2021-10-13 00:16:59,863 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-13 00:16:59,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 408 transitions. [2021-10-13 00:16:59,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2021-10-13 00:16:59,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:16:59,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:16:59,870 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:59,871 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:16:59,875 INFO L791 eck$LassoCheckResult]: Stem: 1921#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 1888#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 1716#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 1683#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 1684#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1824#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 1788#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 1789#L288-1 assume !(0 == ~M_E~0); 1847#L410-1 assume !(0 == ~T1_E~0); 1848#L415-1 assume !(0 == ~T2_E~0); 1753#L420-1 assume !(0 == ~T3_E~0); 1754#L425-1 assume !(0 == ~E_1~0); 1726#L430-1 assume 0 == ~E_2~0;~E_2~0 := 1; 1727#L435-1 assume !(0 == ~E_3~0); 1856#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1812#L189 assume !(1 == ~m_pc~0); 1755#L189-2 is_master_triggered_~__retres1~0 := 0; 1756#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1831#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1735#L502 assume !(0 != activate_threads_~tmp~1); 1736#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1843#L208 assume 1 == ~t1_pc~0; 1915#L209 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 1917#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1775#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1776#L510 assume !(0 != activate_threads_~tmp___0~0); 1669#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 1670#L227 assume !(1 == ~t2_pc~0); 1730#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 1731#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 1881#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1673#L518 assume !(0 != activate_threads_~tmp___1~0); 1674#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 1777#L246 assume 1 == ~t3_pc~0; 1778#L247 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 1832#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 1849#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 1883#L526 assume !(0 != activate_threads_~tmp___2~0); 1909#L526-2 assume !(1 == ~M_E~0); 1886#L453-1 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1852#L458-1 assume !(1 == ~T2_E~0); 1853#L463-1 assume !(1 == ~T3_E~0); 1922#L468-1 assume !(1 == ~E_1~0); 1818#L473-1 assume !(1 == ~E_2~0); 1819#L478-1 assume !(1 == ~E_3~0); 1841#L644-1 [2021-10-13 00:16:59,876 INFO L793 eck$LassoCheckResult]: Loop: 1841#L644-1 assume !false; 1842#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 1702#L385 assume !false; 1717#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 1718#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 1656#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 1657#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 1691#L338 assume !(0 != eval_~tmp~0); 1763#L400 start_simulation_~kernel_st~0 := 2; 1790#L266-1 start_simulation_~kernel_st~0 := 3; 1658#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1659#L410-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1686#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 1687#L420-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 1875#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1876#L430-3 assume 0 == ~E_2~0;~E_2~0 := 1; 1880#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 1879#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1732#L189-12 assume 1 == ~m_pc~0; 1733#L190-4 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 1878#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1837#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1743#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1724#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1725#L208-12 assume 1 == ~t1_pc~0; 1815#L209-4 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 1660#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1661#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1677#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 1678#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 1807#L227-12 assume 1 == ~t2_pc~0; 1721#L228-4 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 1722#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 1885#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1764#L518-12 assume !(0 != activate_threads_~tmp___1~0); 1709#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 1710#L246-12 assume 1 == ~t3_pc~0; 1907#L247-4 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 1865#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 1897#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 1904#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 1825#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 1826#L453-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1760#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 1761#L463-3 assume !(1 == ~T3_E~0); 1833#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1821#L473-3 assume 1 == ~E_2~0;~E_2~0 := 2; 1822#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 1809#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 1810#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 1696#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 1820#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 1688#L663 assume !(0 == start_simulation_~tmp~3); 1690#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 1706#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 1707#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 1868#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 1869#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1845#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 1846#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 1899#L676 assume !(0 != start_simulation_~tmp___0~1); 1841#L644-1 [2021-10-13 00:16:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:59,877 INFO L82 PathProgramCache]: Analyzing trace with hash -54612653, now seen corresponding path program 1 times [2021-10-13 00:16:59,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:59,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452367771] [2021-10-13 00:16:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:59,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:16:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:16:59,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:16:59,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452367771] [2021-10-13 00:16:59,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452367771] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:16:59,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:16:59,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:16:59,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167596006] [2021-10-13 00:16:59,946 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:16:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:16:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1985347945, now seen corresponding path program 2 times [2021-10-13 00:16:59,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:16:59,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189418078] [2021-10-13 00:16:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:16:59,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:16:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:00,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:00,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189418078] [2021-10-13 00:17:00,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189418078] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:00,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:00,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:00,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921182655] [2021-10-13 00:17:00,018 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:17:00,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:00,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:17:00,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:17:00,019 INFO L87 Difference]: Start difference. First operand 270 states and 408 transitions. cyclomatic complexity: 139 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 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) [2021-10-13 00:17:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:00,060 INFO L93 Difference]: Finished difference Result 270 states and 398 transitions. [2021-10-13 00:17:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:17:00,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 398 transitions. [2021-10-13 00:17:00,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2021-10-13 00:17:00,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 398 transitions. [2021-10-13 00:17:00,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2021-10-13 00:17:00,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2021-10-13 00:17:00,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 398 transitions. [2021-10-13 00:17:00,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:00,070 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 398 transitions. [2021-10-13 00:17:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 398 transitions. [2021-10-13 00:17:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-10-13 00:17:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.474074074074074) internal successors, (398), 269 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 398 transitions. [2021-10-13 00:17:00,091 INFO L704 BuchiCegarLoop]: Abstraction has 270 states and 398 transitions. [2021-10-13 00:17:00,091 INFO L587 BuchiCegarLoop]: Abstraction has 270 states and 398 transitions. [2021-10-13 00:17:00,091 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-13 00:17:00,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 398 transitions. [2021-10-13 00:17:00,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2021-10-13 00:17:00,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:00,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:00,095 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:00,095 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:00,096 INFO L791 eck$LassoCheckResult]: Stem: 2468#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 2435#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 2263#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 2230#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 2231#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2370#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 2334#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 2335#L288-1 assume !(0 == ~M_E~0); 2394#L410-1 assume !(0 == ~T1_E~0); 2395#L415-1 assume !(0 == ~T2_E~0); 2299#L420-1 assume !(0 == ~T3_E~0); 2300#L425-1 assume !(0 == ~E_1~0); 2272#L430-1 assume !(0 == ~E_2~0); 2273#L435-1 assume !(0 == ~E_3~0); 2403#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2358#L189 assume !(1 == ~m_pc~0); 2301#L189-2 is_master_triggered_~__retres1~0 := 0; 2302#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2377#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2281#L502 assume !(0 != activate_threads_~tmp~1); 2282#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2390#L208 assume 1 == ~t1_pc~0; 2462#L209 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 2464#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2321#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 2322#L510 assume !(0 != activate_threads_~tmp___0~0); 2216#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 2217#L227 assume !(1 == ~t2_pc~0); 2276#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 2277#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 2429#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 2220#L518 assume !(0 != activate_threads_~tmp___1~0); 2221#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 2323#L246 assume 1 == ~t3_pc~0; 2324#L247 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 2378#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 2396#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 2430#L526 assume !(0 != activate_threads_~tmp___2~0); 2456#L526-2 assume !(1 == ~M_E~0); 2433#L453-1 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2399#L458-1 assume !(1 == ~T2_E~0); 2400#L463-1 assume !(1 == ~T3_E~0); 2469#L468-1 assume !(1 == ~E_1~0); 2364#L473-1 assume !(1 == ~E_2~0); 2365#L478-1 assume !(1 == ~E_3~0); 2387#L644-1 [2021-10-13 00:17:00,096 INFO L793 eck$LassoCheckResult]: Loop: 2387#L644-1 assume !false; 2388#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 2249#L385 assume !false; 2264#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 2265#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 2203#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 2204#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 2238#L338 assume !(0 != eval_~tmp~0); 2309#L400 start_simulation_~kernel_st~0 := 2; 2336#L266-1 start_simulation_~kernel_st~0 := 3; 2205#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2206#L410-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2233#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 2234#L420-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 2422#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 2423#L430-3 assume !(0 == ~E_2~0); 2427#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 2426#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2278#L189-12 assume 1 == ~m_pc~0; 2279#L190-4 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 2424#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2381#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2287#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2270#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2271#L208-12 assume 1 == ~t1_pc~0; 2360#L209-4 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 2209#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2210#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 2224#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 2225#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 2353#L227-12 assume !(1 == ~t2_pc~0); 2269#L227-14 is_transmit2_triggered_~__retres1~2 := 0; 2389#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 2432#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 2310#L518-12 assume !(0 != activate_threads_~tmp___1~0); 2256#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 2257#L246-12 assume 1 == ~t3_pc~0; 2454#L247-4 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 2412#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 2444#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 2451#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 2371#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 2372#L453-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2306#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 2307#L463-3 assume !(1 == ~T3_E~0); 2379#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 2368#L473-3 assume !(1 == ~E_2~0); 2369#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 2355#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 2356#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 2243#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 2366#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 2235#L663 assume !(0 == start_simulation_~tmp~3); 2237#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 2253#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 2254#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 2415#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 2416#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2392#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 2393#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 2446#L676 assume !(0 != start_simulation_~tmp___0~1); 2387#L644-1 [2021-10-13 00:17:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:00,096 INFO L82 PathProgramCache]: Analyzing trace with hash -126999211, now seen corresponding path program 1 times [2021-10-13 00:17:00,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:00,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717537653] [2021-10-13 00:17:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:00,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:00,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:00,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717537653] [2021-10-13 00:17:00,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717537653] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:00,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:00,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:00,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635622105] [2021-10-13 00:17:00,177 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:17:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:00,178 INFO L82 PathProgramCache]: Analyzing trace with hash 862285994, now seen corresponding path program 1 times [2021-10-13 00:17:00,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:00,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324019929] [2021-10-13 00:17:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:00,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:00,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:00,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324019929] [2021-10-13 00:17:00,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324019929] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:00,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:00,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:00,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401723196] [2021-10-13 00:17:00,248 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:17:00,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:00,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:17:00,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:17:00,250 INFO L87 Difference]: Start difference. First operand 270 states and 398 transitions. cyclomatic complexity: 129 Second operand has 4 states, 4 states have (on average 11.25) 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) [2021-10-13 00:17:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:00,475 INFO L93 Difference]: Finished difference Result 659 states and 947 transitions. [2021-10-13 00:17:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:17:00,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 947 transitions. [2021-10-13 00:17:00,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 576 [2021-10-13 00:17:00,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 659 states and 947 transitions. [2021-10-13 00:17:00,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2021-10-13 00:17:00,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 659 [2021-10-13 00:17:00,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 659 states and 947 transitions. [2021-10-13 00:17:00,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:00,498 INFO L681 BuchiCegarLoop]: Abstraction has 659 states and 947 transitions. [2021-10-13 00:17:00,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states and 947 transitions. [2021-10-13 00:17:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 607. [2021-10-13 00:17:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 607 states have (on average 1.4497528830313016) internal successors, (880), 606 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 880 transitions. [2021-10-13 00:17:00,525 INFO L704 BuchiCegarLoop]: Abstraction has 607 states and 880 transitions. [2021-10-13 00:17:00,526 INFO L587 BuchiCegarLoop]: Abstraction has 607 states and 880 transitions. [2021-10-13 00:17:00,526 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-13 00:17:00,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 880 transitions. [2021-10-13 00:17:00,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 555 [2021-10-13 00:17:00,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:00,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:00,534 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:00,535 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:00,536 INFO L791 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 3388#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 3201#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 3168#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 3169#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3309#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 3269#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 3270#L288-1 assume !(0 == ~M_E~0); 3333#L410-1 assume !(0 == ~T1_E~0); 3334#L415-1 assume !(0 == ~T2_E~0); 3236#L420-1 assume !(0 == ~T3_E~0); 3237#L425-1 assume !(0 == ~E_1~0); 3210#L430-1 assume !(0 == ~E_2~0); 3211#L435-1 assume !(0 == ~E_3~0); 3343#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 3295#L189 assume !(1 == ~m_pc~0); 3238#L189-2 is_master_triggered_~__retres1~0 := 0; 3239#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3316#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3218#L502 assume !(0 != activate_threads_~tmp~1); 3219#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3329#L208 assume !(1 == ~t1_pc~0); 3424#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 3425#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3258#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 3259#L510 assume !(0 != activate_threads_~tmp___0~0); 3154#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 3155#L227 assume !(1 == ~t2_pc~0); 3214#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 3215#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 3373#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 3156#L518 assume !(0 != activate_threads_~tmp___1~0); 3157#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 3260#L246 assume 1 == ~t3_pc~0; 3261#L247 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 3317#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 3335#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 3375#L526 assume !(0 != activate_threads_~tmp___2~0); 3414#L526-2 assume !(1 == ~M_E~0); 3386#L453-1 assume 1 == ~T1_E~0;~T1_E~0 := 2; 3339#L458-1 assume !(1 == ~T2_E~0); 3340#L463-1 assume !(1 == ~T3_E~0); 3436#L468-1 assume !(1 == ~E_1~0); 3303#L473-1 assume !(1 == ~E_2~0); 3304#L478-1 assume !(1 == ~E_3~0); 3326#L644-1 [2021-10-13 00:17:00,536 INFO L793 eck$LassoCheckResult]: Loop: 3326#L644-1 assume !false; 3327#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 3365#L385 assume !false; 3202#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 3203#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 3141#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 3142#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 3173#L338 assume !(0 != eval_~tmp~0); 3246#L400 start_simulation_~kernel_st~0 := 2; 3273#L266-1 start_simulation_~kernel_st~0 := 3; 3143#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 3144#L410-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 3171#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 3172#L420-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 3366#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 3367#L430-3 assume !(0 == ~E_2~0); 3636#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 3370#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 3216#L189-12 assume !(1 == ~m_pc~0); 3217#L189-14 is_master_triggered_~__retres1~0 := 0; 3368#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3320#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3224#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 3208#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3209#L208-12 assume !(1 == ~t1_pc~0); 3300#L208-14 is_transmit1_triggered_~__retres1~1 := 0; 3152#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3153#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 3162#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 3163#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 3290#L227-12 assume !(1 == ~t2_pc~0); 3207#L227-14 is_transmit2_triggered_~__retres1~2 := 0; 3328#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 3385#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 3247#L518-12 assume !(0 != activate_threads_~tmp___1~0); 3194#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 3195#L246-12 assume 1 == ~t3_pc~0; 3412#L247-4 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 3357#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 3398#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 3405#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 3313#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 3314#L453-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 3243#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 3244#L463-3 assume !(1 == ~T3_E~0); 3318#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 3307#L473-3 assume !(1 == ~E_2~0); 3308#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 3293#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 3294#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 3181#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 3409#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 3410#L663 assume !(0 == start_simulation_~tmp~3); 3302#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 3191#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 3192#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 3358#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 3359#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3331#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 3332#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 3400#L676 assume !(0 != start_simulation_~tmp___0~1); 3326#L644-1 [2021-10-13 00:17:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:00,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1717394188, now seen corresponding path program 1 times [2021-10-13 00:17:00,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:00,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59306218] [2021-10-13 00:17:00,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:00,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:00,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:00,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59306218] [2021-10-13 00:17:00,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59306218] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:00,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:00,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:00,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268922505] [2021-10-13 00:17:00,632 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:17:00,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:00,633 INFO L82 PathProgramCache]: Analyzing trace with hash -408891028, now seen corresponding path program 1 times [2021-10-13 00:17:00,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:00,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963872373] [2021-10-13 00:17:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:00,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:00,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:00,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963872373] [2021-10-13 00:17:00,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963872373] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:00,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:00,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:00,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485203816] [2021-10-13 00:17:00,698 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:17:00,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:00,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:17:00,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:17:00,702 INFO L87 Difference]: Start difference. First operand 607 states and 880 transitions. cyclomatic complexity: 275 Second operand has 4 states, 4 states have (on average 11.25) 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) [2021-10-13 00:17:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:00,869 INFO L93 Difference]: Finished difference Result 1687 states and 2396 transitions. [2021-10-13 00:17:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:17:00,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1687 states and 2396 transitions. [2021-10-13 00:17:00,891 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1551 [2021-10-13 00:17:00,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1687 states to 1687 states and 2396 transitions. [2021-10-13 00:17:00,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1687 [2021-10-13 00:17:00,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1687 [2021-10-13 00:17:00,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1687 states and 2396 transitions. [2021-10-13 00:17:00,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:00,924 INFO L681 BuchiCegarLoop]: Abstraction has 1687 states and 2396 transitions. [2021-10-13 00:17:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states and 2396 transitions. [2021-10-13 00:17:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1606. [2021-10-13 00:17:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1606 states have (on average 1.4290161892901618) internal successors, (2295), 1605 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2295 transitions. [2021-10-13 00:17:00,977 INFO L704 BuchiCegarLoop]: Abstraction has 1606 states and 2295 transitions. [2021-10-13 00:17:00,977 INFO L587 BuchiCegarLoop]: Abstraction has 1606 states and 2295 transitions. [2021-10-13 00:17:00,977 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-13 00:17:00,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1606 states and 2295 transitions. [2021-10-13 00:17:00,991 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1545 [2021-10-13 00:17:00,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:00,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:00,993 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:00,994 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:01,001 INFO L791 eck$LassoCheckResult]: Stem: 5743#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 5687#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 5508#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 5473#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 5474#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5612#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 5577#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 5578#L288-1 assume !(0 == ~M_E~0); 5638#L410-1 assume !(0 == ~T1_E~0); 5639#L415-1 assume !(0 == ~T2_E~0); 5542#L420-1 assume !(0 == ~T3_E~0); 5543#L425-1 assume !(0 == ~E_1~0); 5515#L430-1 assume !(0 == ~E_2~0); 5516#L435-1 assume !(0 == ~E_3~0); 5649#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 5602#L189 assume !(1 == ~m_pc~0); 5544#L189-2 is_master_triggered_~__retres1~0 := 0; 5545#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5618#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5524#L502 assume !(0 != activate_threads_~tmp~1); 5525#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5635#L208 assume !(1 == ~t1_pc~0); 5729#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 5730#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5565#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 5566#L510 assume !(0 != activate_threads_~tmp___0~0); 5459#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 5460#L227 assume !(1 == ~t2_pc~0); 5522#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 5523#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 5677#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 5463#L518 assume !(0 != activate_threads_~tmp___1~0); 5464#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 5567#L246 assume !(1 == ~t3_pc~0); 5568#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 5640#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 5641#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 5681#L526 assume !(0 != activate_threads_~tmp___2~0); 5720#L526-2 assume !(1 == ~M_E~0); 5684#L453-1 assume 1 == ~T1_E~0;~T1_E~0 := 2; 5644#L458-1 assume !(1 == ~T2_E~0); 5645#L463-1 assume !(1 == ~T3_E~0); 5745#L468-1 assume !(1 == ~E_1~0); 5606#L473-1 assume !(1 == ~E_2~0); 5607#L478-1 assume !(1 == ~E_3~0); 5628#L644-1 [2021-10-13 00:17:01,001 INFO L793 eck$LassoCheckResult]: Loop: 5628#L644-1 assume !false; 6665#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 6660#L385 assume !false; 6658#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 6653#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 6647#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 6646#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 6642#L338 assume !(0 != eval_~tmp~0); 6644#L400 start_simulation_~kernel_st~0 := 2; 7019#L266-1 start_simulation_~kernel_st~0 := 3; 7018#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 7017#L410-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 7016#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 7015#L420-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 7014#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 7013#L430-3 assume !(0 == ~E_2~0); 7012#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 7011#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 7010#L189-12 assume !(1 == ~m_pc~0); 7009#L189-14 is_master_triggered_~__retres1~0 := 0; 7008#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 7007#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 7006#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 7005#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 7004#L208-12 assume !(1 == ~t1_pc~0); 7003#L208-14 is_transmit1_triggered_~__retres1~1 := 0; 7002#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 7001#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 7000#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 6750#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 6751#L227-12 assume !(1 == ~t2_pc~0); 6998#L227-14 is_transmit2_triggered_~__retres1~2 := 0; 6997#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 6996#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 6995#L518-12 assume !(0 != activate_threads_~tmp___1~0); 6994#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 6993#L246-12 assume !(1 == ~t3_pc~0); 6992#L246-14 is_transmit3_triggered_~__retres1~3 := 0; 6991#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 6990#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 6989#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 6988#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 6987#L453-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 6986#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 6985#L463-3 assume !(1 == ~T3_E~0); 6984#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 6983#L473-3 assume !(1 == ~E_2~0); 6714#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 6715#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 6706#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 6702#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 6700#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 6697#L663 assume !(0 == start_simulation_~tmp~3); 6694#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 6685#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 6682#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 6679#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 6678#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6674#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 6672#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 6671#L676 assume !(0 != start_simulation_~tmp___0~1); 5628#L644-1 [2021-10-13 00:17:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1289378579, now seen corresponding path program 1 times [2021-10-13 00:17:01,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:01,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627563929] [2021-10-13 00:17:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:01,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:01,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:01,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627563929] [2021-10-13 00:17:01,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627563929] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:01,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:01,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:17:01,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400572888] [2021-10-13 00:17:01,067 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:17:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:01,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1828472237, now seen corresponding path program 1 times [2021-10-13 00:17:01,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:01,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859915152] [2021-10-13 00:17:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:01,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:01,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:01,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859915152] [2021-10-13 00:17:01,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859915152] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:01,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:01,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:01,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974450499] [2021-10-13 00:17:01,111 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:17:01,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:01,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:17:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:17:01,112 INFO L87 Difference]: Start difference. First operand 1606 states and 2295 transitions. cyclomatic complexity: 693 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 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) [2021-10-13 00:17:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:01,144 INFO L93 Difference]: Finished difference Result 1606 states and 2266 transitions. [2021-10-13 00:17:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:17:01,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1606 states and 2266 transitions. [2021-10-13 00:17:01,163 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1545 [2021-10-13 00:17:01,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1606 states to 1606 states and 2266 transitions. [2021-10-13 00:17:01,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1606 [2021-10-13 00:17:01,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1606 [2021-10-13 00:17:01,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1606 states and 2266 transitions. [2021-10-13 00:17:01,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:01,220 INFO L681 BuchiCegarLoop]: Abstraction has 1606 states and 2266 transitions. [2021-10-13 00:17:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states and 2266 transitions. [2021-10-13 00:17:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2021-10-13 00:17:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1606 states have (on average 1.4109589041095891) internal successors, (2266), 1605 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2266 transitions. [2021-10-13 00:17:01,268 INFO L704 BuchiCegarLoop]: Abstraction has 1606 states and 2266 transitions. [2021-10-13 00:17:01,268 INFO L587 BuchiCegarLoop]: Abstraction has 1606 states and 2266 transitions. [2021-10-13 00:17:01,268 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-13 00:17:01,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1606 states and 2266 transitions. [2021-10-13 00:17:01,282 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1545 [2021-10-13 00:17:01,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:01,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:01,286 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:01,287 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:01,287 INFO L791 eck$LassoCheckResult]: Stem: 8979#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 8926#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 8726#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 8693#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 8694#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 8839#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 8797#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 8798#L288-1 assume !(0 == ~M_E~0); 8865#L410-1 assume !(0 == ~T1_E~0); 8866#L415-1 assume !(0 == ~T2_E~0); 8761#L420-1 assume !(0 == ~T3_E~0); 8762#L425-1 assume !(0 == ~E_1~0); 8735#L430-1 assume !(0 == ~E_2~0); 8736#L435-1 assume !(0 == ~E_3~0); 8875#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 8824#L189 assume !(1 == ~m_pc~0); 8763#L189-2 is_master_triggered_~__retres1~0 := 0; 8764#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8845#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8743#L502 assume !(0 != activate_threads_~tmp~1); 8744#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8861#L208 assume !(1 == ~t1_pc~0); 8966#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 8967#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8785#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 8786#L510 assume !(0 != activate_threads_~tmp___0~0); 8677#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 8678#L227 assume !(1 == ~t2_pc~0); 8741#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 8742#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 8909#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 8681#L518 assume !(0 != activate_threads_~tmp___1~0); 8682#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 8787#L246 assume !(1 == ~t3_pc~0); 8788#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 8867#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 8868#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 8910#L526 assume !(0 != activate_threads_~tmp___2~0); 8953#L526-2 assume !(1 == ~M_E~0); 8921#L453-1 assume !(1 == ~T1_E~0); 8871#L458-1 assume !(1 == ~T2_E~0); 8872#L463-1 assume !(1 == ~T3_E~0); 8982#L468-1 assume !(1 == ~E_1~0); 8832#L473-1 assume !(1 == ~E_2~0); 8833#L478-1 assume !(1 == ~E_3~0); 8857#L644-1 [2021-10-13 00:17:01,287 INFO L793 eck$LassoCheckResult]: Loop: 8857#L644-1 assume !false; 8858#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 8886#L385 assume !false; 8727#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 8728#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 8664#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 8665#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 8701#L338 assume !(0 != eval_~tmp~0); 8771#L400 start_simulation_~kernel_st~0 := 2; 10267#L266-1 start_simulation_~kernel_st~0 := 3; 10266#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 10265#L410-4 assume !(0 == ~T1_E~0); 10264#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 10263#L420-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 10262#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 10261#L430-3 assume !(0 == ~E_2~0); 10260#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 10259#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 10258#L189-12 assume !(1 == ~m_pc~0); 10257#L189-14 is_master_triggered_~__retres1~0 := 0; 10256#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 10254#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 10251#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 10249#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 10248#L208-12 assume !(1 == ~t1_pc~0); 10245#L208-14 is_transmit1_triggered_~__retres1~1 := 0; 10244#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 10243#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 10241#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 10239#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 10237#L227-12 assume !(1 == ~t2_pc~0); 10234#L227-14 is_transmit2_triggered_~__retres1~2 := 0; 10233#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 8922#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 8923#L518-12 assume !(0 != activate_threads_~tmp___1~0); 10230#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 8964#L246-12 assume !(1 == ~t3_pc~0); 8965#L246-14 is_transmit3_triggered_~__retres1~3 := 0; 10226#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 10225#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 10224#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 8843#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 8844#L453-3 assume !(1 == ~T1_E~0); 8768#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 8769#L463-3 assume !(1 == ~T3_E~0); 8846#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 8835#L473-3 assume !(1 == ~E_2~0); 8836#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 8822#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 8823#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 8706#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 8834#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 8698#L663 assume !(0 == start_simulation_~tmp~3); 8700#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 8716#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 8717#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 8894#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 8895#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8863#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 8864#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 8939#L676 assume !(0 != start_simulation_~tmp___0~1); 8857#L644-1 [2021-10-13 00:17:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1346636881, now seen corresponding path program 1 times [2021-10-13 00:17:01,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:01,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889417144] [2021-10-13 00:17:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:01,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:01,311 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:01,373 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:01,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash -341551763, now seen corresponding path program 1 times [2021-10-13 00:17:01,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:01,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072654629] [2021-10-13 00:17:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:01,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:01,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:01,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072654629] [2021-10-13 00:17:01,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072654629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:01,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:01,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:01,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852552603] [2021-10-13 00:17:01,403 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:17:01,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:01,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:17:01,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:17:01,405 INFO L87 Difference]: Start difference. First operand 1606 states and 2266 transitions. cyclomatic complexity: 664 Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:01,442 INFO L93 Difference]: Finished difference Result 1936 states and 2706 transitions. [2021-10-13 00:17:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:17:01,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1936 states and 2706 transitions. [2021-10-13 00:17:01,464 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1843 [2021-10-13 00:17:01,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1936 states to 1936 states and 2706 transitions. [2021-10-13 00:17:01,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1936 [2021-10-13 00:17:01,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1936 [2021-10-13 00:17:01,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1936 states and 2706 transitions. [2021-10-13 00:17:01,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:01,491 INFO L681 BuchiCegarLoop]: Abstraction has 1936 states and 2706 transitions. [2021-10-13 00:17:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states and 2706 transitions. [2021-10-13 00:17:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1936. [2021-10-13 00:17:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1936 states have (on average 1.3977272727272727) internal successors, (2706), 1935 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2706 transitions. [2021-10-13 00:17:01,546 INFO L704 BuchiCegarLoop]: Abstraction has 1936 states and 2706 transitions. [2021-10-13 00:17:01,546 INFO L587 BuchiCegarLoop]: Abstraction has 1936 states and 2706 transitions. [2021-10-13 00:17:01,546 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-13 00:17:01,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1936 states and 2706 transitions. [2021-10-13 00:17:01,561 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1843 [2021-10-13 00:17:01,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:01,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:01,562 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:01,563 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:01,563 INFO L791 eck$LassoCheckResult]: Stem: 12535#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 12470#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 12274#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 12240#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 12241#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 12382#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 12342#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 12343#L288-1 assume !(0 == ~M_E~0); 12409#L410-1 assume !(0 == ~T1_E~0); 12410#L415-1 assume !(0 == ~T2_E~0); 12309#L420-1 assume 0 == ~T3_E~0;~T3_E~0 := 1; 12310#L425-1 assume !(0 == ~E_1~0); 14107#L430-1 assume !(0 == ~E_2~0); 14106#L435-1 assume !(0 == ~E_3~0); 14105#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 14104#L189 assume !(1 == ~m_pc~0); 14103#L189-2 is_master_triggered_~__retres1~0 := 0; 12389#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 12390#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 14081#L502 assume !(0 != activate_threads_~tmp~1); 14079#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 12522#L208 assume !(1 == ~t1_pc~0); 12523#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 12524#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 12332#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 12333#L510 assume !(0 != activate_threads_~tmp___0~0); 12497#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 12378#L227 assume !(1 == ~t2_pc~0); 12285#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 12286#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 12453#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 12228#L518 assume !(0 != activate_threads_~tmp___1~0); 12229#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 12334#L246 assume !(1 == ~t3_pc~0); 12335#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 13999#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 13998#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 13997#L526 assume !(0 != activate_threads_~tmp___2~0); 13996#L526-2 assume !(1 == ~M_E~0); 13995#L453-1 assume !(1 == ~T1_E~0); 12546#L458-1 assume !(1 == ~T2_E~0); 12539#L463-1 assume 1 == ~T3_E~0;~T3_E~0 := 2; 12540#L468-1 assume !(1 == ~E_1~0); 12375#L473-1 assume !(1 == ~E_2~0); 12376#L478-1 assume !(1 == ~E_3~0); 12400#L644-1 [2021-10-13 00:17:01,563 INFO L793 eck$LassoCheckResult]: Loop: 12400#L644-1 assume !false; 12822#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 12817#L385 assume !false; 12811#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 12805#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 12799#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 12797#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 12793#L338 assume !(0 != eval_~tmp~0); 12346#L400 start_simulation_~kernel_st~0 := 2; 12347#L266-1 start_simulation_~kernel_st~0 := 3; 12215#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 12216#L410-4 assume !(0 == ~T1_E~0); 12243#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 12244#L420-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 12510#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 14047#L430-3 assume !(0 == ~E_2~0); 14045#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 14043#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 14041#L189-12 assume !(1 == ~m_pc~0); 14040#L189-14 is_master_triggered_~__retres1~0 := 0; 14039#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 14038#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 14037#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 14035#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 14033#L208-12 assume !(1 == ~t1_pc~0); 14032#L208-14 is_transmit1_triggered_~__retres1~1 := 0; 14031#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 14030#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 14029#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 14028#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 14026#L227-12 assume !(1 == ~t2_pc~0); 13983#L227-14 is_transmit2_triggered_~__retres1~2 := 0; 13956#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 13953#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 12321#L518-12 assume !(0 != activate_threads_~tmp___1~0); 12267#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 12268#L246-12 assume !(1 == ~t3_pc~0); 12435#L246-14 is_transmit3_triggered_~__retres1~3 := 0; 12436#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 12483#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 12496#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 12386#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 12387#L453-3 assume !(1 == ~T1_E~0); 12317#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 12318#L463-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 12391#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 12379#L473-3 assume !(1 == ~E_2~0); 12380#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 12368#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 12369#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 12254#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 12377#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 12246#L663 assume !(0 == start_simulation_~tmp~3); 12248#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 12264#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 12265#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 12437#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 12438#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12479#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 13751#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 13113#L676 assume !(0 != start_simulation_~tmp___0~1); 12400#L644-1 [2021-10-13 00:17:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:01,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2104384495, now seen corresponding path program 1 times [2021-10-13 00:17:01,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:01,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247057941] [2021-10-13 00:17:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:01,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:01,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:01,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247057941] [2021-10-13 00:17:01,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247057941] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:01,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:01,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:17:01,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514739276] [2021-10-13 00:17:01,591 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:17:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1246796139, now seen corresponding path program 1 times [2021-10-13 00:17:01,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:01,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461001827] [2021-10-13 00:17:01,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:01,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:01,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:01,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461001827] [2021-10-13 00:17:01,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461001827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:01,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:01,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:17:01,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022526489] [2021-10-13 00:17:01,632 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:17:01,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:01,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:17:01,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:17:01,633 INFO L87 Difference]: Start difference. First operand 1936 states and 2706 transitions. cyclomatic complexity: 774 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 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) [2021-10-13 00:17:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:01,661 INFO L93 Difference]: Finished difference Result 1606 states and 2237 transitions. [2021-10-13 00:17:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:17:01,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1606 states and 2237 transitions. [2021-10-13 00:17:01,679 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1545 [2021-10-13 00:17:01,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1606 states to 1606 states and 2237 transitions. [2021-10-13 00:17:01,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1606 [2021-10-13 00:17:01,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1606 [2021-10-13 00:17:01,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1606 states and 2237 transitions. [2021-10-13 00:17:01,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:01,733 INFO L681 BuchiCegarLoop]: Abstraction has 1606 states and 2237 transitions. [2021-10-13 00:17:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states and 2237 transitions. [2021-10-13 00:17:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2021-10-13 00:17:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1606 states have (on average 1.3929016189290162) internal successors, (2237), 1605 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2237 transitions. [2021-10-13 00:17:01,776 INFO L704 BuchiCegarLoop]: Abstraction has 1606 states and 2237 transitions. [2021-10-13 00:17:01,776 INFO L587 BuchiCegarLoop]: Abstraction has 1606 states and 2237 transitions. [2021-10-13 00:17:01,776 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-13 00:17:01,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1606 states and 2237 transitions. [2021-10-13 00:17:01,788 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1545 [2021-10-13 00:17:01,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:01,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:01,789 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:01,790 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:01,790 INFO L791 eck$LassoCheckResult]: Stem: 16065#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 16013#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 15827#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 15792#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 15793#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 15935#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 15895#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 15896#L288-1 assume !(0 == ~M_E~0); 15962#L410-1 assume !(0 == ~T1_E~0); 15963#L415-1 assume !(0 == ~T2_E~0); 15863#L420-1 assume !(0 == ~T3_E~0); 15864#L425-1 assume !(0 == ~E_1~0); 15836#L430-1 assume !(0 == ~E_2~0); 15837#L435-1 assume !(0 == ~E_3~0); 15972#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 15922#L189 assume !(1 == ~m_pc~0); 15865#L189-2 is_master_triggered_~__retres1~0 := 0; 15866#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 15941#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 15845#L502 assume !(0 != activate_threads_~tmp~1); 15846#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 15958#L208 assume !(1 == ~t1_pc~0); 16054#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 16055#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 15885#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 15886#L510 assume !(0 != activate_threads_~tmp___0~0); 15776#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 15777#L227 assume !(1 == ~t2_pc~0); 15838#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 15839#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 16002#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 15778#L518 assume !(0 != activate_threads_~tmp___1~0); 15779#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 15887#L246 assume !(1 == ~t3_pc~0); 15888#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 15964#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 15965#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 16005#L526 assume !(0 != activate_threads_~tmp___2~0); 16040#L526-2 assume !(1 == ~M_E~0); 16011#L453-1 assume !(1 == ~T1_E~0); 15968#L458-1 assume !(1 == ~T2_E~0); 15969#L463-1 assume !(1 == ~T3_E~0); 16066#L468-1 assume !(1 == ~E_1~0); 15930#L473-1 assume !(1 == ~E_2~0); 15931#L478-1 assume !(1 == ~E_3~0); 15952#L644-1 [2021-10-13 00:17:01,790 INFO L793 eck$LassoCheckResult]: Loop: 15952#L644-1 assume !false; 16867#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 16620#L385 assume !false; 16866#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 16861#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 16857#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 16855#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 16853#L338 assume !(0 != eval_~tmp~0); 16854#L400 start_simulation_~kernel_st~0 := 2; 17126#L266-1 start_simulation_~kernel_st~0 := 3; 17124#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 17122#L410-4 assume !(0 == ~T1_E~0); 17120#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 17118#L420-3 assume !(0 == ~T3_E~0); 17117#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 17116#L430-3 assume !(0 == ~E_2~0); 17115#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 17114#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 17112#L189-12 assume !(1 == ~m_pc~0); 17110#L189-14 is_master_triggered_~__retres1~0 := 0; 17108#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 17107#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 17104#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 17102#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 17100#L208-12 assume !(1 == ~t1_pc~0); 17098#L208-14 is_transmit1_triggered_~__retres1~1 := 0; 17096#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 17094#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 17092#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 17090#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 17088#L227-12 assume !(1 == ~t2_pc~0); 17082#L227-14 is_transmit2_triggered_~__retres1~2 := 0; 17080#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 17078#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 17075#L518-12 assume !(0 != activate_threads_~tmp___1~0); 17073#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 17072#L246-12 assume !(1 == ~t3_pc~0); 17071#L246-14 is_transmit3_triggered_~__retres1~3 := 0; 17070#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 17065#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 17063#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 17061#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 17059#L453-3 assume !(1 == ~T1_E~0); 17058#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 17057#L463-3 assume !(1 == ~T3_E~0); 17055#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 17053#L473-3 assume !(1 == ~E_2~0); 17051#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 17049#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 16959#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 16954#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 16952#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 16949#L663 assume !(0 == start_simulation_~tmp~3); 16946#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 16904#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 16898#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 16895#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 16880#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 16874#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 16871#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 16868#L676 assume !(0 != start_simulation_~tmp___0~1); 15952#L644-1 [2021-10-13 00:17:01,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:01,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1346636881, now seen corresponding path program 2 times [2021-10-13 00:17:01,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:01,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306011258] [2021-10-13 00:17:01,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:01,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:01,802 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:01,824 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:01,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1597610283, now seen corresponding path program 1 times [2021-10-13 00:17:01,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:01,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468596733] [2021-10-13 00:17:01,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:01,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:01,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:01,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468596733] [2021-10-13 00:17:01,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468596733] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:01,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:01,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:17:01,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675679231] [2021-10-13 00:17:01,869 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:17:01,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:01,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:17:01,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:17:01,871 INFO L87 Difference]: Start difference. First operand 1606 states and 2237 transitions. cyclomatic complexity: 635 Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:01,995 INFO L93 Difference]: Finished difference Result 2760 states and 3790 transitions. [2021-10-13 00:17:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:17:01,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2760 states and 3790 transitions. [2021-10-13 00:17:02,022 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2684 [2021-10-13 00:17:02,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2760 states to 2760 states and 3790 transitions. [2021-10-13 00:17:02,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2760 [2021-10-13 00:17:02,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2760 [2021-10-13 00:17:02,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2760 states and 3790 transitions. [2021-10-13 00:17:02,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:02,060 INFO L681 BuchiCegarLoop]: Abstraction has 2760 states and 3790 transitions. [2021-10-13 00:17:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states and 3790 transitions. [2021-10-13 00:17:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 1633. [2021-10-13 00:17:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1633 states have (on average 1.3864053888548684) internal successors, (2264), 1632 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2264 transitions. [2021-10-13 00:17:02,118 INFO L704 BuchiCegarLoop]: Abstraction has 1633 states and 2264 transitions. [2021-10-13 00:17:02,118 INFO L587 BuchiCegarLoop]: Abstraction has 1633 states and 2264 transitions. [2021-10-13 00:17:02,118 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-13 00:17:02,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1633 states and 2264 transitions. [2021-10-13 00:17:02,127 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1572 [2021-10-13 00:17:02,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:02,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:02,136 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:02,136 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:02,136 INFO L791 eck$LassoCheckResult]: Stem: 20497#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 20421#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 20212#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 20174#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 20175#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 20324#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 20280#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 20281#L288-1 assume !(0 == ~M_E~0); 20353#L410-1 assume !(0 == ~T1_E~0); 20354#L415-1 assume !(0 == ~T2_E~0); 20248#L420-1 assume !(0 == ~T3_E~0); 20249#L425-1 assume !(0 == ~E_1~0); 20221#L430-1 assume !(0 == ~E_2~0); 20222#L435-1 assume !(0 == ~E_3~0); 20363#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 20308#L189 assume !(1 == ~m_pc~0); 20250#L189-2 is_master_triggered_~__retres1~0 := 0; 20251#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 20330#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 20229#L502 assume !(0 != activate_threads_~tmp~1); 20230#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 20349#L208 assume !(1 == ~t1_pc~0); 20486#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 20487#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 20270#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 20271#L510 assume !(0 != activate_threads_~tmp___0~0); 20158#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 20159#L227 assume !(1 == ~t2_pc~0); 20223#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 20224#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 20399#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 20160#L518 assume !(0 != activate_threads_~tmp___1~0); 20161#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 20272#L246 assume !(1 == ~t3_pc~0); 20273#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 20355#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 20356#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 20405#L526 assume !(0 != activate_threads_~tmp___2~0); 20472#L526-2 assume !(1 == ~M_E~0); 20415#L453-1 assume !(1 == ~T1_E~0); 20359#L458-1 assume !(1 == ~T2_E~0); 20360#L463-1 assume !(1 == ~T3_E~0); 20501#L468-1 assume !(1 == ~E_1~0); 20316#L473-1 assume !(1 == ~E_2~0); 20317#L478-1 assume !(1 == ~E_3~0); 20342#L644-1 [2021-10-13 00:17:02,137 INFO L793 eck$LassoCheckResult]: Loop: 20342#L644-1 assume !false; 21733#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 21393#L385 assume !false; 21654#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 21651#L301 assume !(0 == ~m_st~0); 21652#L305 assume !(0 == ~t1_st~0); 21650#L309 assume !(0 == ~t2_st~0); 20197#L313 assume !(0 == ~t3_st~0);exists_runnable_thread_~__retres1~4 := 0; 20199#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 21301#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 21302#L338 assume !(0 != eval_~tmp~0); 21643#L400 start_simulation_~kernel_st~0 := 2; 20401#L266-1 start_simulation_~kernel_st~0 := 3; 20402#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 20403#L410-4 assume !(0 == ~T1_E~0); 20404#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 20470#L420-3 assume !(0 == ~T3_E~0); 20471#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 20442#L430-3 assume !(0 == ~E_2~0); 20443#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 20395#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 20396#L189-12 assume !(1 == ~m_pc~0); 20392#L189-14 is_master_triggered_~__retres1~0 := 0; 20393#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 20334#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 20335#L502-12 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 20219#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 20220#L208-12 assume !(1 == ~t1_pc~0); 20347#L208-14 is_transmit1_triggered_~__retres1~1 := 0; 20348#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 20208#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 20209#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 20302#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 20303#L227-12 assume !(1 == ~t2_pc~0); 20345#L227-14 is_transmit2_triggered_~__retres1~2 := 0; 20346#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 20416#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 20417#L518-12 assume !(0 != activate_threads_~tmp___1~0); 20203#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 20204#L246-12 assume !(1 == ~t3_pc~0); 20377#L246-14 is_transmit3_triggered_~__retres1~3 := 0; 20378#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 20456#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 20457#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 20327#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 20328#L453-3 assume !(1 == ~T1_E~0); 20255#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 20256#L463-3 assume !(1 == ~T3_E~0); 20388#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 20389#L473-3 assume !(1 == ~E_2~0); 20437#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 20438#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 20323#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 20188#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 20318#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 20180#L663 assume !(0 == start_simulation_~tmp~3); 20182#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 20200#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 20201#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 21738#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 21737#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 21736#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 21735#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 21734#L676 assume !(0 != start_simulation_~tmp___0~1); 20342#L644-1 [2021-10-13 00:17:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1346636881, now seen corresponding path program 3 times [2021-10-13 00:17:02,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:02,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138064263] [2021-10-13 00:17:02,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:02,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:02,157 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:02,193 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 66836469, now seen corresponding path program 1 times [2021-10-13 00:17:02,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:02,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125310026] [2021-10-13 00:17:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:02,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:02,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:02,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125310026] [2021-10-13 00:17:02,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125310026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:02,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:02,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:17:02,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798051675] [2021-10-13 00:17:02,301 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:17:02,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:02,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:17:02,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:17:02,302 INFO L87 Difference]: Start difference. First operand 1633 states and 2264 transitions. cyclomatic complexity: 635 Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:02,514 INFO L93 Difference]: Finished difference Result 3089 states and 4255 transitions. [2021-10-13 00:17:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:17:02,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3089 states and 4255 transitions. [2021-10-13 00:17:02,537 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 3028 [2021-10-13 00:17:02,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3089 states to 3089 states and 4255 transitions. [2021-10-13 00:17:02,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3089 [2021-10-13 00:17:02,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3089 [2021-10-13 00:17:02,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3089 states and 4255 transitions. [2021-10-13 00:17:02,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:02,580 INFO L681 BuchiCegarLoop]: Abstraction has 3089 states and 4255 transitions. [2021-10-13 00:17:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states and 4255 transitions. [2021-10-13 00:17:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 1687. [2021-10-13 00:17:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1687 states have (on average 1.3639596917605217) internal successors, (2301), 1686 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2301 transitions. [2021-10-13 00:17:02,647 INFO L704 BuchiCegarLoop]: Abstraction has 1687 states and 2301 transitions. [2021-10-13 00:17:02,647 INFO L587 BuchiCegarLoop]: Abstraction has 1687 states and 2301 transitions. [2021-10-13 00:17:02,647 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-13 00:17:02,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1687 states and 2301 transitions. [2021-10-13 00:17:02,655 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1626 [2021-10-13 00:17:02,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:02,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:02,657 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:02,657 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:02,657 INFO L791 eck$LassoCheckResult]: Stem: 25203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 25142#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 24945#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 24909#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 24910#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 25054#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 25013#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 25014#L288-1 assume !(0 == ~M_E~0); 25083#L410-1 assume !(0 == ~T1_E~0); 25084#L415-1 assume !(0 == ~T2_E~0); 24981#L420-1 assume !(0 == ~T3_E~0); 24982#L425-1 assume !(0 == ~E_1~0); 24954#L430-1 assume !(0 == ~E_2~0); 24955#L435-1 assume !(0 == ~E_3~0); 25093#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 25041#L189 assume !(1 == ~m_pc~0); 24983#L189-2 is_master_triggered_~__retres1~0 := 0; 24984#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 25060#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 24963#L502 assume !(0 != activate_threads_~tmp~1); 24964#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 25078#L208 assume !(1 == ~t1_pc~0); 25191#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 25192#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 25002#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 25003#L510 assume !(0 != activate_threads_~tmp___0~0); 24893#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 24894#L227 assume !(1 == ~t2_pc~0); 24958#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 24959#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 25126#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 24895#L518 assume !(0 != activate_threads_~tmp___1~0); 24896#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 25004#L246 assume !(1 == ~t3_pc~0); 25005#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 25085#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 25086#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 25128#L526 assume !(0 != activate_threads_~tmp___2~0); 25179#L526-2 assume !(1 == ~M_E~0); 25137#L453-1 assume !(1 == ~T1_E~0); 25089#L458-1 assume !(1 == ~T2_E~0); 25090#L463-1 assume !(1 == ~T3_E~0); 25205#L468-1 assume !(1 == ~E_1~0); 25047#L473-1 assume !(1 == ~E_2~0); 25048#L478-1 assume !(1 == ~E_3~0); 25072#L644-1 [2021-10-13 00:17:02,657 INFO L793 eck$LassoCheckResult]: Loop: 25072#L644-1 assume !false; 25442#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 25430#L385 assume !false; 25431#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 25426#L301 assume !(0 == ~m_st~0); 25427#L305 assume !(0 == ~t1_st~0); 25423#L309 assume !(0 == ~t2_st~0); 25424#L313 assume !(0 == ~t3_st~0);exists_runnable_thread_~__retres1~4 := 0; 25425#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 25783#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 25654#L338 assume !(0 != eval_~tmp~0); 25655#L400 start_simulation_~kernel_st~0 := 2; 25650#L266-1 start_simulation_~kernel_st~0 := 3; 25651#L410-2 assume 0 == ~M_E~0;~M_E~0 := 1; 25646#L410-4 assume !(0 == ~T1_E~0); 25647#L415-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 25642#L420-3 assume !(0 == ~T3_E~0); 25643#L425-3 assume 0 == ~E_1~0;~E_1~0 := 1; 25638#L430-3 assume !(0 == ~E_2~0); 25639#L435-3 assume 0 == ~E_3~0;~E_3~0 := 1; 25634#L440-3 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 25635#L189-12 assume !(1 == ~m_pc~0); 25630#L189-14 is_master_triggered_~__retres1~0 := 0; 25631#L200-4 is_master_triggered_#res := is_master_triggered_~__retres1~0; 25626#L201-4 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 25627#L502-12 assume !(0 != activate_threads_~tmp~1); 25621#L502-14 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 25622#L208-12 assume !(1 == ~t1_pc~0); 25616#L208-14 is_transmit1_triggered_~__retres1~1 := 0; 25617#L219-4 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 25610#L220-4 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 25611#L510-12 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 25602#L510-14 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 25603#L227-12 assume !(1 == ~t2_pc~0); 25588#L227-14 is_transmit2_triggered_~__retres1~2 := 0; 25589#L238-4 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 25576#L239-4 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 25577#L518-12 assume !(0 != activate_threads_~tmp___1~0); 25563#L518-14 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 25564#L246-12 assume !(1 == ~t3_pc~0); 25553#L246-14 is_transmit3_triggered_~__retres1~3 := 0; 25554#L257-4 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 25545#L258-4 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 25546#L526-12 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 25537#L526-14 assume 1 == ~M_E~0;~M_E~0 := 2; 25538#L453-3 assume !(1 == ~T1_E~0); 25529#L458-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 25530#L463-3 assume !(1 == ~T3_E~0); 25522#L468-3 assume 1 == ~E_1~0;~E_1~0 := 2; 25523#L473-3 assume !(1 == ~E_2~0); 25514#L478-3 assume 1 == ~E_3~0;~E_3~0 := 2; 25515#L483-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 25502#L301-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 25500#L323-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 25487#L324-1 start_simulation_#t~ret17 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 25488#L663 assume !(0 == start_simulation_~tmp~3); 25475#L663-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret16, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 25476#L301-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 25464#L323-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 25465#L324-2 stop_simulation_#t~ret16 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret16;havoc stop_simulation_#t~ret16; 25457#L618 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 25458#L625 stop_simulation_#res := stop_simulation_~__retres2~0; 25450#L626 start_simulation_#t~ret18 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret18;havoc start_simulation_#t~ret18; 25451#L676 assume !(0 != start_simulation_~tmp___0~1); 25072#L644-1 [2021-10-13 00:17:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1346636881, now seen corresponding path program 4 times [2021-10-13 00:17:02,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:02,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738619521] [2021-10-13 00:17:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:02,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:02,670 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:02,695 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:02,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1778530697, now seen corresponding path program 1 times [2021-10-13 00:17:02,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:02,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051826605] [2021-10-13 00:17:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:02,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:02,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:02,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051826605] [2021-10-13 00:17:02,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051826605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:02,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:02,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:02,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356519791] [2021-10-13 00:17:02,734 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-13 00:17:02,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:02,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:17:02,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:17:02,736 INFO L87 Difference]: Start difference. First operand 1687 states and 2301 transitions. cyclomatic complexity: 618 Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:02,788 INFO L93 Difference]: Finished difference Result 2626 states and 3527 transitions. [2021-10-13 00:17:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:17:02,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 3527 transitions. [2021-10-13 00:17:02,817 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2563 [2021-10-13 00:17:02,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 3527 transitions. [2021-10-13 00:17:02,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2021-10-13 00:17:02,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2021-10-13 00:17:02,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 3527 transitions. [2021-10-13 00:17:02,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:02,848 INFO L681 BuchiCegarLoop]: Abstraction has 2626 states and 3527 transitions. [2021-10-13 00:17:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 3527 transitions. [2021-10-13 00:17:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2534. [2021-10-13 00:17:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 2534 states have (on average 1.3460931333859512) internal successors, (3411), 2533 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3411 transitions. [2021-10-13 00:17:02,964 INFO L704 BuchiCegarLoop]: Abstraction has 2534 states and 3411 transitions. [2021-10-13 00:17:02,964 INFO L587 BuchiCegarLoop]: Abstraction has 2534 states and 3411 transitions. [2021-10-13 00:17:02,964 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-10-13 00:17:02,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2534 states and 3411 transitions. [2021-10-13 00:17:02,978 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2471 [2021-10-13 00:17:02,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:02,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:02,979 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:02,979 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:02,980 INFO L791 eck$LassoCheckResult]: Stem: 29531#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 29465#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 29263#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 29228#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 29229#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 29376#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 29334#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 29335#L288-1 assume !(0 == ~M_E~0); 29403#L410-1 assume !(0 == ~T1_E~0); 29404#L415-1 assume !(0 == ~T2_E~0); 29298#L420-1 assume !(0 == ~T3_E~0); 29299#L425-1 assume !(0 == ~E_1~0); 29272#L430-1 assume !(0 == ~E_2~0); 29273#L435-1 assume !(0 == ~E_3~0); 29413#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 29360#L189 assume !(1 == ~m_pc~0); 29300#L189-2 is_master_triggered_~__retres1~0 := 0; 29301#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 29383#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 29280#L502 assume !(0 != activate_threads_~tmp~1); 29281#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 29399#L208 assume !(1 == ~t1_pc~0); 29517#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 29518#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 29322#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 29323#L510 assume !(0 != activate_threads_~tmp___0~0); 29212#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 29213#L227 assume !(1 == ~t2_pc~0); 29276#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 29277#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 29451#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 29216#L518 assume !(0 != activate_threads_~tmp___1~0); 29217#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 29324#L246 assume !(1 == ~t3_pc~0); 29325#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 29405#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 29406#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 29452#L526 assume !(0 != activate_threads_~tmp___2~0); 29499#L526-2 assume !(1 == ~M_E~0); 29463#L453-1 assume !(1 == ~T1_E~0); 29409#L458-1 assume !(1 == ~T2_E~0); 29410#L463-1 assume !(1 == ~T3_E~0); 29532#L468-1 assume !(1 == ~E_1~0); 29367#L473-1 assume !(1 == ~E_2~0); 29368#L478-1 assume !(1 == ~E_3~0); 29395#L644-1 assume !false; 30614#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 30608#L385 [2021-10-13 00:17:02,980 INFO L793 eck$LassoCheckResult]: Loop: 30608#L385 assume !false; 30607#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 30572#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 30569#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 30566#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 30564#L338 assume 0 != eval_~tmp~0; 30562#L338-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 30563#L346 assume !(0 != eval_~tmp_ndt_1~0); 30659#L343 assume !(0 == ~t1_st~0); 30651#L357 assume !(0 == ~t2_st~0); 30649#L371 assume !(0 == ~t3_st~0); 30608#L385 [2021-10-13 00:17:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1332893523, now seen corresponding path program 1 times [2021-10-13 00:17:02,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:02,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175455862] [2021-10-13 00:17:02,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:02,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:02,999 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:03,032 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1333816928, now seen corresponding path program 1 times [2021-10-13 00:17:03,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:03,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483357976] [2021-10-13 00:17:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:03,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:03,039 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:03,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash 451456974, now seen corresponding path program 1 times [2021-10-13 00:17:03,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:03,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815562618] [2021-10-13 00:17:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:03,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:03,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:03,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815562618] [2021-10-13 00:17:03,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815562618] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:03,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:03,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:03,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778286052] [2021-10-13 00:17:03,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:03,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:17:03,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:17:03,202 INFO L87 Difference]: Start difference. First operand 2534 states and 3411 transitions. cyclomatic complexity: 884 Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:03,302 INFO L93 Difference]: Finished difference Result 4612 states and 6120 transitions. [2021-10-13 00:17:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:17:03,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4612 states and 6120 transitions. [2021-10-13 00:17:03,347 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 4282 [2021-10-13 00:17:03,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4612 states to 4612 states and 6120 transitions. [2021-10-13 00:17:03,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4612 [2021-10-13 00:17:03,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4612 [2021-10-13 00:17:03,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4612 states and 6120 transitions. [2021-10-13 00:17:03,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:03,419 INFO L681 BuchiCegarLoop]: Abstraction has 4612 states and 6120 transitions. [2021-10-13 00:17:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4612 states and 6120 transitions. [2021-10-13 00:17:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4612 to 4514. [2021-10-13 00:17:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4514 states, 4514 states have (on average 1.3278688524590163) internal successors, (5994), 4513 states have internal predecessors, (5994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 5994 transitions. [2021-10-13 00:17:03,526 INFO L704 BuchiCegarLoop]: Abstraction has 4514 states and 5994 transitions. [2021-10-13 00:17:03,526 INFO L587 BuchiCegarLoop]: Abstraction has 4514 states and 5994 transitions. [2021-10-13 00:17:03,526 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-10-13 00:17:03,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4514 states and 5994 transitions. [2021-10-13 00:17:03,550 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 4184 [2021-10-13 00:17:03,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:03,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:03,551 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:03,552 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:03,552 INFO L791 eck$LassoCheckResult]: Stem: 36702#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 36627#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 36421#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 36383#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 36384#L273-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 36641#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 38727#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 38726#L288-1 assume !(0 == ~M_E~0); 38725#L410-1 assume !(0 == ~T1_E~0); 38724#L415-1 assume !(0 == ~T2_E~0); 38723#L420-1 assume !(0 == ~T3_E~0); 38722#L425-1 assume !(0 == ~E_1~0); 38721#L430-1 assume !(0 == ~E_2~0); 38720#L435-1 assume !(0 == ~E_3~0); 38719#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 38718#L189 assume !(1 == ~m_pc~0); 38717#L189-2 is_master_triggered_~__retres1~0 := 0; 38716#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 38715#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 38714#L502 assume !(0 != activate_threads_~tmp~1); 38713#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 38712#L208 assume !(1 == ~t1_pc~0); 38711#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 38710#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 38709#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 38708#L510 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 36366#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 36367#L227 assume !(1 == ~t2_pc~0); 36434#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 36435#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 36608#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 36370#L518 assume !(0 != activate_threads_~tmp___1~0); 36371#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 36481#L246 assume !(1 == ~t3_pc~0); 36482#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 36564#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 36565#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 36612#L526 assume !(0 != activate_threads_~tmp___2~0); 36669#L526-2 assume !(1 == ~M_E~0); 36684#L453-1 assume !(1 == ~T1_E~0); 36568#L458-1 assume !(1 == ~T2_E~0); 36569#L463-1 assume !(1 == ~T3_E~0); 36703#L468-1 assume !(1 == ~E_1~0); 36529#L473-1 assume !(1 == ~E_2~0); 36530#L478-1 assume !(1 == ~E_3~0); 36553#L644-1 assume !false; 38635#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 38630#L385 [2021-10-13 00:17:03,552 INFO L793 eck$LassoCheckResult]: Loop: 38630#L385 assume !false; 38628#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 38629#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 39213#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 39212#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 38607#L338 assume 0 != eval_~tmp~0; 38608#L338-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 38553#L346 assume !(0 != eval_~tmp_ndt_1~0); 37202#L343 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 37197#L360 assume !(0 != eval_~tmp_ndt_2~0); 37198#L357 assume !(0 == ~t2_st~0); 38634#L371 assume !(0 == ~t3_st~0); 38630#L385 [2021-10-13 00:17:03,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:03,553 INFO L82 PathProgramCache]: Analyzing trace with hash 216645527, now seen corresponding path program 1 times [2021-10-13 00:17:03,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:03,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430749810] [2021-10-13 00:17:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:03,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:03,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:03,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430749810] [2021-10-13 00:17:03,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430749810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:03,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:03,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:03,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533605463] [2021-10-13 00:17:03,606 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:17:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:03,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1605322485, now seen corresponding path program 1 times [2021-10-13 00:17:03,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:03,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831986729] [2021-10-13 00:17:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:03,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:03,613 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:03,622 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:03,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:03,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:17:03,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:17:03,785 INFO L87 Difference]: Start difference. First operand 4514 states and 5994 transitions. cyclomatic complexity: 1491 Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:03,812 INFO L93 Difference]: Finished difference Result 3690 states and 4920 transitions. [2021-10-13 00:17:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:17:03,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3690 states and 4920 transitions. [2021-10-13 00:17:03,836 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3617 [2021-10-13 00:17:03,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3690 states to 3690 states and 4920 transitions. [2021-10-13 00:17:03,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3690 [2021-10-13 00:17:03,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3690 [2021-10-13 00:17:03,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3690 states and 4920 transitions. [2021-10-13 00:17:03,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:03,883 INFO L681 BuchiCegarLoop]: Abstraction has 3690 states and 4920 transitions. [2021-10-13 00:17:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states and 4920 transitions. [2021-10-13 00:17:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3690. [2021-10-13 00:17:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3690 states have (on average 1.3333333333333333) internal successors, (4920), 3689 states have internal predecessors, (4920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4920 transitions. [2021-10-13 00:17:03,967 INFO L704 BuchiCegarLoop]: Abstraction has 3690 states and 4920 transitions. [2021-10-13 00:17:03,967 INFO L587 BuchiCegarLoop]: Abstraction has 3690 states and 4920 transitions. [2021-10-13 00:17:03,967 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-10-13 00:17:03,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3690 states and 4920 transitions. [2021-10-13 00:17:03,982 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3617 [2021-10-13 00:17:03,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:03,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:03,982 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:03,983 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:03,983 INFO L791 eck$LassoCheckResult]: Stem: 44898#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 44831#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 44633#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 44593#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 44594#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 44744#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 44702#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 44703#L288-1 assume !(0 == ~M_E~0); 44770#L410-1 assume !(0 == ~T1_E~0); 44771#L415-1 assume !(0 == ~T2_E~0); 44667#L420-1 assume !(0 == ~T3_E~0); 44668#L425-1 assume !(0 == ~E_1~0); 44640#L430-1 assume !(0 == ~E_2~0); 44641#L435-1 assume !(0 == ~E_3~0); 44782#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 44728#L189 assume !(1 == ~m_pc~0); 44669#L189-2 is_master_triggered_~__retres1~0 := 0; 44670#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 44751#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 44648#L502 assume !(0 != activate_threads_~tmp~1); 44649#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 44767#L208 assume !(1 == ~t1_pc~0); 44883#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 44884#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 44690#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 44691#L510 assume !(0 != activate_threads_~tmp___0~0); 44576#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 44577#L227 assume !(1 == ~t2_pc~0); 44646#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 44647#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 44815#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 44580#L518 assume !(0 != activate_threads_~tmp___1~0); 44581#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 44692#L246 assume !(1 == ~t3_pc~0); 44693#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 44772#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 44773#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 44820#L526 assume !(0 != activate_threads_~tmp___2~0); 44869#L526-2 assume !(1 == ~M_E~0); 44828#L453-1 assume !(1 == ~T1_E~0); 44776#L458-1 assume !(1 == ~T2_E~0); 44777#L463-1 assume !(1 == ~T3_E~0); 44901#L468-1 assume !(1 == ~E_1~0); 44736#L473-1 assume !(1 == ~E_2~0); 44737#L478-1 assume !(1 == ~E_3~0); 44762#L644-1 assume !false; 45502#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 45500#L385 [2021-10-13 00:17:03,983 INFO L793 eck$LassoCheckResult]: Loop: 45500#L385 assume !false; 45499#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 45498#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 45497#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 45496#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 45495#L338 assume 0 != eval_~tmp~0; 45494#L338-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 45493#L346 assume !(0 != eval_~tmp_ndt_1~0); 45491#L343 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 45488#L360 assume !(0 != eval_~tmp_ndt_2~0); 45460#L357 assume !(0 == ~t2_st~0); 45461#L371 assume !(0 == ~t3_st~0); 45500#L385 [2021-10-13 00:17:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1332893523, now seen corresponding path program 2 times [2021-10-13 00:17:03,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:03,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268918123] [2021-10-13 00:17:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:03,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:03,993 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:04,020 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1605322485, now seen corresponding path program 2 times [2021-10-13 00:17:04,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:04,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703601351] [2021-10-13 00:17:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:04,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:04,028 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:04,034 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:04,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:04,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1106290013, now seen corresponding path program 1 times [2021-10-13 00:17:04,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:04,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842748232] [2021-10-13 00:17:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:04,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:04,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:04,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842748232] [2021-10-13 00:17:04,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842748232] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:04,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:04,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:17:04,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787221234] [2021-10-13 00:17:04,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:04,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:17:04,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:17:04,220 INFO L87 Difference]: Start difference. First operand 3690 states and 4920 transitions. cyclomatic complexity: 1237 Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:04,293 INFO L93 Difference]: Finished difference Result 6249 states and 8277 transitions. [2021-10-13 00:17:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:17:04,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6249 states and 8277 transitions. [2021-10-13 00:17:04,332 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6151 [2021-10-13 00:17:04,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6249 states to 6249 states and 8277 transitions. [2021-10-13 00:17:04,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6249 [2021-10-13 00:17:04,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6249 [2021-10-13 00:17:04,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6249 states and 8277 transitions. [2021-10-13 00:17:04,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:04,447 INFO L681 BuchiCegarLoop]: Abstraction has 6249 states and 8277 transitions. [2021-10-13 00:17:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6249 states and 8277 transitions. [2021-10-13 00:17:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6249 to 5969. [2021-10-13 00:17:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5969 states, 5969 states have (on average 1.3313787904171552) internal successors, (7947), 5968 states have internal predecessors, (7947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5969 states to 5969 states and 7947 transitions. [2021-10-13 00:17:04,592 INFO L704 BuchiCegarLoop]: Abstraction has 5969 states and 7947 transitions. [2021-10-13 00:17:04,593 INFO L587 BuchiCegarLoop]: Abstraction has 5969 states and 7947 transitions. [2021-10-13 00:17:04,593 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-10-13 00:17:04,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5969 states and 7947 transitions. [2021-10-13 00:17:04,622 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 5871 [2021-10-13 00:17:04,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:04,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:04,623 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:04,624 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:04,624 INFO L791 eck$LassoCheckResult]: Stem: 54846#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 54780#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 54577#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 54539#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 54540#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 54685#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 54643#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 54644#L288-1 assume !(0 == ~M_E~0); 54716#L410-1 assume !(0 == ~T1_E~0); 54717#L415-1 assume !(0 == ~T2_E~0); 54610#L420-1 assume !(0 == ~T3_E~0); 54611#L425-1 assume !(0 == ~E_1~0); 54584#L430-1 assume !(0 == ~E_2~0); 54585#L435-1 assume !(0 == ~E_3~0); 54727#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 54669#L189 assume !(1 == ~m_pc~0); 54612#L189-2 is_master_triggered_~__retres1~0 := 0; 54613#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 54693#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 54592#L502 assume !(0 != activate_threads_~tmp~1); 54593#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 54713#L208 assume !(1 == ~t1_pc~0); 54832#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 54833#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 54631#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 54632#L510 assume !(0 != activate_threads_~tmp___0~0); 54524#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 54525#L227 assume !(1 == ~t2_pc~0); 54590#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 54591#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 54765#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 54528#L518 assume !(0 != activate_threads_~tmp___1~0); 54529#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 54633#L246 assume !(1 == ~t3_pc~0); 54634#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 54718#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 54719#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 54771#L526 assume !(0 != activate_threads_~tmp___2~0); 54815#L526-2 assume !(1 == ~M_E~0); 54778#L453-1 assume !(1 == ~T1_E~0); 54722#L458-1 assume !(1 == ~T2_E~0); 54723#L463-1 assume !(1 == ~T3_E~0); 54850#L468-1 assume !(1 == ~E_1~0); 54677#L473-1 assume !(1 == ~E_2~0); 54678#L478-1 assume !(1 == ~E_3~0); 54705#L644-1 assume !false; 56008#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 55999#L385 [2021-10-13 00:17:04,624 INFO L793 eck$LassoCheckResult]: Loop: 55999#L385 assume !false; 56000#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 55979#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 55980#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 55968#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 55969#L338 assume 0 != eval_~tmp~0; 55961#L338-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 55963#L346 assume !(0 != eval_~tmp_ndt_1~0); 55954#L343 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 55955#L360 assume !(0 != eval_~tmp_ndt_2~0); 56017#L357 assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0;eval_~tmp_ndt_3~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 55553#L374 assume !(0 != eval_~tmp_ndt_3~0); 56006#L371 assume !(0 == ~t3_st~0); 55999#L385 [2021-10-13 00:17:04,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:04,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1332893523, now seen corresponding path program 3 times [2021-10-13 00:17:04,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:04,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205662276] [2021-10-13 00:17:04,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:04,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:04,636 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:04,663 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1774485897, now seen corresponding path program 1 times [2021-10-13 00:17:04,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:04,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282987551] [2021-10-13 00:17:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:04,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:04,669 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:04,674 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash -64872585, now seen corresponding path program 1 times [2021-10-13 00:17:04,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:04,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590060762] [2021-10-13 00:17:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:04,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:17:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:17:04,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:17:04,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590060762] [2021-10-13 00:17:04,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590060762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:17:04,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:17:04,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:17:04,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634698394] [2021-10-13 00:17:04,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:17:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:17:04,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:17:04,840 INFO L87 Difference]: Start difference. First operand 5969 states and 7947 transitions. cyclomatic complexity: 1985 Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:17:04,978 INFO L93 Difference]: Finished difference Result 9386 states and 12488 transitions. [2021-10-13 00:17:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:17:04,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9386 states and 12488 transitions. [2021-10-13 00:17:05,027 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 9268 [2021-10-13 00:17:05,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9386 states to 9386 states and 12488 transitions. [2021-10-13 00:17:05,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9386 [2021-10-13 00:17:05,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9386 [2021-10-13 00:17:05,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9386 states and 12488 transitions. [2021-10-13 00:17:05,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:17:05,097 INFO L681 BuchiCegarLoop]: Abstraction has 9386 states and 12488 transitions. [2021-10-13 00:17:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9386 states and 12488 transitions. [2021-10-13 00:17:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9386 to 9386. [2021-10-13 00:17:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9386 states, 9386 states have (on average 1.3304922224589815) internal successors, (12488), 9385 states have internal predecessors, (12488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:17:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9386 states to 9386 states and 12488 transitions. [2021-10-13 00:17:05,358 INFO L704 BuchiCegarLoop]: Abstraction has 9386 states and 12488 transitions. [2021-10-13 00:17:05,358 INFO L587 BuchiCegarLoop]: Abstraction has 9386 states and 12488 transitions. [2021-10-13 00:17:05,358 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-10-13 00:17:05,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9386 states and 12488 transitions. [2021-10-13 00:17:05,400 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 9268 [2021-10-13 00:17:05,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:17:05,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:17:05,401 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:05,401 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:17:05,402 INFO L791 eck$LassoCheckResult]: Stem: 70218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(21);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2; 70150#L-1 havoc main_#res;havoc main_~__retres1~5;havoc main_~__retres1~5;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; 69942#L607 havoc start_simulation_#t~ret17, start_simulation_#t~ret18, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 69905#L266 assume 1 == ~m_i~0;~m_st~0 := 0; 69906#L273-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 70055#L278-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 70012#L283-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 70013#L288-1 assume !(0 == ~M_E~0); 70085#L410-1 assume !(0 == ~T1_E~0); 70086#L415-1 assume !(0 == ~T2_E~0); 69976#L420-1 assume !(0 == ~T3_E~0); 69977#L425-1 assume !(0 == ~E_1~0); 69949#L430-1 assume !(0 == ~E_2~0); 69950#L435-1 assume !(0 == ~E_3~0); 70096#L440-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_#t~ret15, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 70039#L189 assume !(1 == ~m_pc~0); 69978#L189-2 is_master_triggered_~__retres1~0 := 0; 69979#L200 is_master_triggered_#res := is_master_triggered_~__retres1~0; 70063#L201 activate_threads_#t~ret12 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 69958#L502 assume !(0 != activate_threads_~tmp~1); 69959#L502-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 70082#L208 assume !(1 == ~t1_pc~0); 70206#L208-2 is_transmit1_triggered_~__retres1~1 := 0; 70207#L219 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 70000#L220 activate_threads_#t~ret13 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 70001#L510 assume !(0 != activate_threads_~tmp___0~0); 69887#L510-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 69888#L227 assume !(1 == ~t2_pc~0); 69956#L227-2 is_transmit2_triggered_~__retres1~2 := 0; 69957#L238 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 70131#L239 activate_threads_#t~ret14 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 69891#L518 assume !(0 != activate_threads_~tmp___1~0); 69892#L518-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 70002#L246 assume !(1 == ~t3_pc~0); 70003#L246-2 is_transmit3_triggered_~__retres1~3 := 0; 70087#L257 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 70088#L258 activate_threads_#t~ret15 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret15;havoc activate_threads_#t~ret15; 70136#L526 assume !(0 != activate_threads_~tmp___2~0); 70190#L526-2 assume !(1 == ~M_E~0); 70147#L453-1 assume !(1 == ~T1_E~0); 70091#L458-1 assume !(1 == ~T2_E~0); 70092#L463-1 assume !(1 == ~T3_E~0); 70221#L468-1 assume !(1 == ~E_1~0); 70047#L473-1 assume !(1 == ~E_2~0); 70048#L478-1 assume !(1 == ~E_3~0); 70073#L644-1 assume !false; 78267#L645 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_#t~nondet10, eval_~tmp_ndt_3~0, eval_#t~nondet11, eval_~tmp_ndt_4~0, eval_~tmp~0;havoc eval_~tmp~0; 74241#L385 [2021-10-13 00:17:05,402 INFO L793 eck$LassoCheckResult]: Loop: 74241#L385 assume !false; 78263#L334 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~4;havoc exists_runnable_thread_~__retres1~4; 78261#L301 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~4 := 1; 78259#L323 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~4; 78256#L324 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 78254#L338 assume 0 != eval_~tmp~0; 78252#L338-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 78250#L346 assume !(0 != eval_~tmp_ndt_1~0); 78247#L343 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 78245#L360 assume !(0 != eval_~tmp_ndt_2~0); 78191#L357 assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0;eval_~tmp_ndt_3~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 78187#L374 assume !(0 != eval_~tmp_ndt_3~0); 77960#L371 assume 0 == ~t3_st~0;havoc eval_~tmp_ndt_4~0;eval_~tmp_ndt_4~0 := eval_#t~nondet11;havoc eval_#t~nondet11; 74240#L388 assume !(0 != eval_~tmp_ndt_4~0); 74241#L385 [2021-10-13 00:17:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1332893523, now seen corresponding path program 4 times [2021-10-13 00:17:05,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:05,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761677361] [2021-10-13 00:17:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:05,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:05,428 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:05,447 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash -825512478, now seen corresponding path program 1 times [2021-10-13 00:17:05,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:05,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541826236] [2021-10-13 00:17:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:05,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:05,453 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:05,459 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:17:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2011050572, now seen corresponding path program 1 times [2021-10-13 00:17:05,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:17:05,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691127347] [2021-10-13 00:17:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:17:05,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:17:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:05,472 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:17:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:17:05,497 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:17:07,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 12:17:07 BoogieIcfgContainer [2021-10-13 00:17:07,387 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-13 00:17:07,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:17:07,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:17:07,388 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:17:07,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:16:58" (3/4) ... [2021-10-13 00:17:07,392 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-13 00:17:07,450 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:17:07,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:17:07,452 INFO L168 Benchmark]: Toolchain (without parser) took 10760.14 ms. Allocated memory was 115.3 MB in the beginning and 272.6 MB in the end (delta: 157.3 MB). Free memory was 95.1 MB in the beginning and 133.5 MB in the end (delta: -38.4 MB). Peak memory consumption was 117.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:17:07,452 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 86.0 MB. Free memory was 59.6 MB in the beginning and 59.6 MB in the end (delta: 42.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:17:07,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.82 ms. Allocated memory is still 115.3 MB. Free memory was 94.9 MB in the beginning and 82.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 10.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:17:07,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.16 ms. Allocated memory is still 115.3 MB. Free memory was 82.7 MB in the beginning and 79.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:17:07,454 INFO L168 Benchmark]: Boogie Preprocessor took 123.05 ms. Allocated memory is still 115.3 MB. Free memory was 79.2 MB in the beginning and 76.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:17:07,455 INFO L168 Benchmark]: RCFGBuilder took 1094.76 ms. Allocated memory is still 115.3 MB. Free memory was 76.5 MB in the beginning and 66.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:17:07,455 INFO L168 Benchmark]: BuchiAutomizer took 8959.55 ms. Allocated memory was 115.3 MB in the beginning and 272.6 MB in the end (delta: 157.3 MB). Free memory was 65.8 MB in the beginning and 136.6 MB in the end (delta: -70.8 MB). Peak memory consumption was 131.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:17:07,456 INFO L168 Benchmark]: Witness Printer took 62.57 ms. Allocated memory is still 272.6 MB. Free memory was 136.6 MB in the beginning and 133.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:17:07,458 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.23 ms. Allocated memory is still 86.0 MB. Free memory was 59.6 MB in the beginning and 59.6 MB in the end (delta: 42.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 406.82 ms. Allocated memory is still 115.3 MB. Free memory was 94.9 MB in the beginning and 82.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 10.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 106.16 ms. Allocated memory is still 115.3 MB. Free memory was 82.7 MB in the beginning and 79.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 123.05 ms. Allocated memory is still 115.3 MB. Free memory was 79.2 MB in the beginning and 76.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1094.76 ms. Allocated memory is still 115.3 MB. Free memory was 76.5 MB in the beginning and 66.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 8959.55 ms. Allocated memory was 115.3 MB in the beginning and 272.6 MB in the end (delta: 157.3 MB). Free memory was 65.8 MB in the beginning and 136.6 MB in the end (delta: -70.8 MB). Peak memory consumption was 131.5 MB. Max. memory is 16.1 GB. * Witness Printer took 62.57 ms. Allocated memory is still 272.6 MB. Free memory was 136.6 MB in the beginning and 133.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (16 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.16 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 9386 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 17 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.5s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 16. Minimization of nondet autom 0. Automata minimization 1175.2ms AutomataMinimizationTime, 16 MinimizatonAttempts, 3132 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had 9386 states and ocurred in iteration 16. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 6363 SDtfs, 7434 SDslu, 5941 SDs, 0 SdLazy, 358 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 531.0ms Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN1 SILU0 SILI8 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 333]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=13780} State at position 1 is {__retres1=0, NULL=0, t3_st=0, NULL=13780, tmp=1, __retres1=0, kernel_st=1, t2_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7da05751=0, E_3=2, \result=0, E_1=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f60ebf2=0, NULL=0, NULL=0, tmp_ndt_2=0, \result=0, \result=0, tmp_ndt_4=0, m_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@616463c2=0, tmp___2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@543f1ef2=0, NULL=0, tmp___0=0, t3_pc=0, tmp=0, __retres1=0, m_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@feb2ef1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1424b5aa=0, NULL=13781, \result=0, __retres1=0, \result=0, T2_E=2, tmp___0=0, t1_pc=0, E_2=2, T1_E=2, __retres1=1, NULL=13782, tmp_ndt_1=0, NULL=0, M_E=2, tmp=0, tmp_ndt_3=0, __retres1=0, NULL=13783, t2_i=1, t3_i=1, m_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@594f6ab0=0, t1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d6b09c9=0, t2_pc=0, tmp___1=0, T3_E=2, t1_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28349e77=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18f4d3e6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30346e87=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 333]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int t3_pc = 0; [L21] int m_st ; [L22] int t1_st ; [L23] int t2_st ; [L24] int t3_st ; [L25] int m_i ; [L26] int t1_i ; [L27] int t2_i ; [L28] int t3_i ; [L29] int M_E = 2; [L30] int T1_E = 2; [L31] int T2_E = 2; [L32] int T3_E = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; [L689] int __retres1 ; [L602] m_i = 1 [L603] t1_i = 1 [L604] t2_i = 1 [L605] t3_i = 1 [L630] int kernel_st ; [L631] int tmp ; [L632] int tmp___0 ; [L636] kernel_st = 0 [L273] COND TRUE m_i == 1 [L274] m_st = 0 [L278] COND TRUE t1_i == 1 [L279] t1_st = 0 [L283] COND TRUE t2_i == 1 [L284] t2_st = 0 [L288] COND TRUE t3_i == 1 [L289] t3_st = 0 [L410] COND FALSE !(M_E == 0) [L415] COND FALSE !(T1_E == 0) [L420] COND FALSE !(T2_E == 0) [L425] COND FALSE !(T3_E == 0) [L430] COND FALSE !(E_1 == 0) [L435] COND FALSE !(E_2 == 0) [L440] COND FALSE !(E_3 == 0) [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; [L189] COND FALSE !(m_pc == 1) [L199] __retres1 = 0 [L201] return (__retres1); [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) [L205] int __retres1 ; [L208] COND FALSE !(t1_pc == 1) [L218] __retres1 = 0 [L220] return (__retres1); [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) [L224] int __retres1 ; [L227] COND FALSE !(t2_pc == 1) [L237] __retres1 = 0 [L239] return (__retres1); [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) [L243] int __retres1 ; [L246] COND FALSE !(t3_pc == 1) [L256] __retres1 = 0 [L258] return (__retres1); [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) [L453] COND FALSE !(M_E == 1) [L458] COND FALSE !(T1_E == 1) [L463] COND FALSE !(T2_E == 1) [L468] COND FALSE !(T3_E == 1) [L473] COND FALSE !(E_1 == 1) [L478] COND FALSE !(E_2 == 1) [L483] COND FALSE !(E_3 == 1) [L644] COND TRUE 1 [L647] kernel_st = 1 [L329] int tmp ; Loop: [L333] COND TRUE 1 [L298] int __retres1 ; [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 [L324] return (__retres1); [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND FALSE !(\read(tmp_ndt_1)) [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp_ndt_2)) [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND FALSE !(\read(tmp_ndt_3)) [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND FALSE !(\read(tmp_ndt_4)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-13 00:17:07,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62059ec3-0172-407b-8d64-0fe87deef323/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...