./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:38:12,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:38:12,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:38:12,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:38:12,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:38:12,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:38:12,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:38:12,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:38:12,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:38:12,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:38:12,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:38:12,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:38:12,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:38:12,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:38:12,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:38:12,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:38:12,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:38:12,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:38:12,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:38:12,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:38:12,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:38:12,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:38:12,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:38:12,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:38:12,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:38:12,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:38:12,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:38:12,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:38:12,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:38:12,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:38:12,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:38:12,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:38:12,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:38:12,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:38:12,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:38:12,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:38:12,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:38:12,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:38:12,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:38:12,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:38:12,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:38:12,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:38:12,888 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:38:12,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:38:12,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:38:12,889 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:38:12,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:38:12,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:38:12,890 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:38:12,890 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:38:12,890 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:38:12,891 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:38:12,891 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:38:12,891 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:38:12,891 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:38:12,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:38:12,893 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:38:12,893 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:38:12,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:38:12,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:38:12,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:38:12,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:38:12,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:38:12,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:38:12,897 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:38:12,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:38:12,900 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:38:12,900 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:38:12,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:38:12,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:38:12,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:38:12,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:38:12,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:38:12,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:38:12,903 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:38:12,903 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2021-12-21 22:38:13,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:38:13,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:38:13,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:38:13,151 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:38:13,155 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:38:13,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-12-21 22:38:13,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310a5f951/ca26e981b44e4065a8aa94234ecff59b/FLAG03c2af66c [2021-12-21 22:38:13,616 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:38:13,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-12-21 22:38:13,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310a5f951/ca26e981b44e4065a8aa94234ecff59b/FLAG03c2af66c [2021-12-21 22:38:13,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310a5f951/ca26e981b44e4065a8aa94234ecff59b [2021-12-21 22:38:13,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:38:13,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:38:13,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:38:13,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:38:13,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:38:13,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6874ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13, skipping insertion in model container [2021-12-21 22:38:13,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:38:13,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:38:13,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2021-12-21 22:38:13,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:38:13,854 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:38:13,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2021-12-21 22:38:13,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:38:13,910 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:38:13,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13 WrapperNode [2021-12-21 22:38:13,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:38:13,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:38:13,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:38:13,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:38:13,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,958 INFO L137 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 30, calls inlined = 39, statements flattened = 417 [2021-12-21 22:38:13,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:38:13,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:38:13,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:38:13,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:38:13,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:38:13,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:38:13,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:38:13,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:38:13,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (1/1) ... [2021-12-21 22:38:13,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:38:14,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:38:14,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:38:14,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 22:38:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 22:38:14,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 22:38:14,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:38:14,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:38:14,113 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:38:14,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:38:14,449 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:38:14,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:38:14,460 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-21 22:38:14,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:38:14 BoogieIcfgContainer [2021-12-21 22:38:14,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:38:14,463 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:38:14,465 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:38:14,468 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:38:14,468 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:38:14,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:38:13" (1/3) ... [2021-12-21 22:38:14,470 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f32952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:38:14, skipping insertion in model container [2021-12-21 22:38:14,470 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:38:14,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:38:13" (2/3) ... [2021-12-21 22:38:14,470 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f32952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:38:14, skipping insertion in model container [2021-12-21 22:38:14,471 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:38:14,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:38:14" (3/3) ... [2021-12-21 22:38:14,472 INFO L388 chiAutomizerObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-12-21 22:38:14,525 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:38:14,525 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:38:14,526 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:38:14,526 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:38:14,526 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:38:14,526 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:38:14,526 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:38:14,527 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:38:14,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 159 states, 158 states have (on average 1.5316455696202531) internal successors, (242), 158 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:14,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2021-12-21 22:38:14,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:14,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:14,595 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] [2021-12-21 22:38:14,595 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] [2021-12-21 22:38:14,595 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:38:14,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 159 states, 158 states have (on average 1.5316455696202531) internal successors, (242), 158 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:14,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2021-12-21 22:38:14,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:14,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:14,617 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] [2021-12-21 22:38:14,618 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] [2021-12-21 22:38:14,625 INFO L791 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 52#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 58#L403true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 4#L175true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 123#L182true assume !(1 == ~m_i~0);~m_st~0 := 2; 27#L182-2true assume 1 == ~t1_i~0;~t1_st~0 := 0; 120#L187-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 42#L271true assume !(0 == ~M_E~0); 93#L271-2true assume !(0 == ~T1_E~0); 51#L276-1true assume !(0 == ~E_M~0); 108#L281-1true assume !(0 == ~E_1~0); 33#L286-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 15#L136true assume 1 == ~m_pc~0; 72#L137true assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 137#L147true is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 39#L148true activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 10#L331true assume !(0 != activate_threads_~tmp~1#1); 142#L331-2true assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 55#L155true assume 1 == ~t1_pc~0; 153#L156true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 107#L166true is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 25#L167true activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 154#L339true assume !(0 != activate_threads_~tmp___0~0#1); 121#L339-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 48#L299true assume !(1 == ~M_E~0); 99#L299-2true assume !(1 == ~T1_E~0); 115#L304-1true assume !(1 == ~E_M~0); 19#L309-1true assume !(1 == ~E_1~0); 63#L314-1true assume { :end_inline_reset_delta_events } true; 116#L440-2true [2021-12-21 22:38:14,627 INFO L793 eck$LassoCheckResult]: Loop: 116#L440-2true assume !false; 28#L441true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret6#1, eval_#t~nondet7#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 74#L246true assume false; 161#L261true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 143#L175-1true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 86#L271-3true assume 0 == ~M_E~0;~M_E~0 := 1; 110#L271-5true assume 0 == ~T1_E~0;~T1_E~0 := 1; 23#L276-3true assume 0 == ~E_M~0;~E_M~0 := 1; 31#L281-3true assume 0 == ~E_1~0;~E_1~0 := 1; 133#L286-3true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 68#L136-9true assume 1 == ~m_pc~0; 69#L137-3true assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 96#L147-3true is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 127#L148-3true activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 67#L331-9true assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 124#L331-11true assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 53#L155-9true assume !(1 == ~t1_pc~0); 88#L155-11true is_transmit1_triggered_~__retres1~1#1 := 0; 30#L166-3true is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 66#L167-3true activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 75#L339-9true assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 80#L339-11true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 109#L299-3true assume 1 == ~M_E~0;~M_E~0 := 2; 36#L299-5true assume 1 == ~T1_E~0;~T1_E~0 := 2; 126#L304-3true assume 1 == ~E_M~0;~E_M~0 := 2; 91#L309-3true assume 1 == ~E_1~0;~E_1~0 := 2; 37#L314-3true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 24#L200-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 119#L212-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 140#L213-1true start_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 7#L459true assume !(0 == start_simulation_~tmp~3#1); 29#L459-2true assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret11#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 97#L200-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 156#L212-2true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 11#L213-2true stop_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret11#1;havoc stop_simulation_#t~ret11#1; 145#L414true assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 38#L421true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 17#L422true start_simulation_#t~ret13#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 44#L472true assume !(0 != start_simulation_~tmp___0~1#1); 116#L440-2true [2021-12-21 22:38:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -704910459, now seen corresponding path program 1 times [2021-12-21 22:38:14,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:14,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726484955] [2021-12-21 22:38:14,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:14,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:14,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:14,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726484955] [2021-12-21 22:38:14,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726484955] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:14,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:14,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:38:14,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051207900] [2021-12-21 22:38:14,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:14,796 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:38:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash -16336154, now seen corresponding path program 1 times [2021-12-21 22:38:14,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:14,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161177128] [2021-12-21 22:38:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:14,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:14,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161177128] [2021-12-21 22:38:14,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161177128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:14,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:14,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 22:38:14,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081215704] [2021-12-21 22:38:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:14,819 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:38:14,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:38:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:38:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:38:14,851 INFO L87 Difference]: Start difference. First operand has 159 states, 158 states have (on average 1.5316455696202531) internal successors, (242), 158 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:38:14,888 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions. [2021-12-21 22:38:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:38:14,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 229 transitions. [2021-12-21 22:38:14,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-21 22:38:14,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 151 states and 223 transitions. [2021-12-21 22:38:14,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2021-12-21 22:38:14,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2021-12-21 22:38:14,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 223 transitions. [2021-12-21 22:38:14,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:38:14,909 INFO L681 BuchiCegarLoop]: Abstraction has 151 states and 223 transitions. [2021-12-21 22:38:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 223 transitions. [2021-12-21 22:38:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-21 22:38:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 1.4768211920529801) internal successors, (223), 150 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 223 transitions. [2021-12-21 22:38:14,943 INFO L704 BuchiCegarLoop]: Abstraction has 151 states and 223 transitions. [2021-12-21 22:38:14,944 INFO L587 BuchiCegarLoop]: Abstraction has 151 states and 223 transitions. [2021-12-21 22:38:14,944 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:38:14,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 223 transitions. [2021-12-21 22:38:14,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-12-21 22:38:14,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:14,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:14,947 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] [2021-12-21 22:38:14,947 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] [2021-12-21 22:38:14,947 INFO L791 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 416#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 417#L403 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 325#L175 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 326#L182 assume 1 == ~m_i~0;~m_st~0 := 0; 377#L182-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 378#L187-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 397#L271 assume !(0 == ~M_E~0); 398#L271-2 assume !(0 == ~T1_E~0); 414#L276-1 assume !(0 == ~E_M~0); 415#L281-1 assume !(0 == ~E_1~0); 384#L286-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 349#L136 assume 1 == ~m_pc~0; 350#L137 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 396#L147 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 393#L148 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 340#L331 assume !(0 != activate_threads_~tmp~1#1); 341#L331-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 421#L155 assume 1 == ~t1_pc~0; 422#L156 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 465#L166 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 374#L167 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 375#L339 assume !(0 != activate_threads_~tmp___0~0#1); 470#L339-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 410#L299 assume !(1 == ~M_E~0); 411#L299-2 assume !(1 == ~T1_E~0); 462#L304-1 assume !(1 == ~E_M~0); 360#L309-1 assume !(1 == ~E_1~0); 361#L314-1 assume { :end_inline_reset_delta_events } true; 401#L440-2 [2021-12-21 22:38:14,948 INFO L793 eck$LassoCheckResult]: Loop: 401#L440-2 assume !false; 379#L441 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret6#1, eval_#t~nondet7#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 328#L246 assume !false; 445#L223 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 446#L200 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 454#L212 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 455#L213 eval_#t~ret6#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret6#1;havoc eval_#t~ret6#1; 466#L227 assume !(0 != eval_~tmp~0#1); 467#L261 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 474#L175-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 452#L271-3 assume 0 == ~M_E~0;~M_E~0 := 1; 453#L271-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 370#L276-3 assume 0 == ~E_M~0;~E_M~0 := 1; 371#L281-3 assume 0 == ~E_1~0;~E_1~0 := 1; 383#L286-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 438#L136-9 assume !(1 == ~m_pc~0); 336#L136-11 is_master_triggered_~__retres1~0#1 := 0; 337#L147-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 460#L148-3 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 434#L331-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 435#L331-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 418#L155-9 assume 1 == ~t1_pc~0; 419#L156-3 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 380#L166-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 381#L167-3 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 433#L339-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 444#L339-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 448#L299-3 assume 1 == ~M_E~0;~M_E~0 := 2; 389#L299-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 390#L304-3 assume 1 == ~E_M~0;~E_M~0 := 2; 456#L309-3 assume 1 == ~E_1~0;~E_1~0 := 2; 391#L314-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 367#L200-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 368#L212-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 468#L213-1 start_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 333#L459 assume !(0 == start_simulation_~tmp~3#1); 334#L459-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret11#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 376#L200-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 458#L212-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 342#L213-2 stop_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret11#1;havoc stop_simulation_#t~ret11#1; 343#L414 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 392#L421 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 352#L422 start_simulation_#t~ret13#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 353#L472 assume !(0 != start_simulation_~tmp___0~1#1); 401#L440-2 [2021-12-21 22:38:14,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash -845459069, now seen corresponding path program 1 times [2021-12-21 22:38:14,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:14,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456987349] [2021-12-21 22:38:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:14,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:14,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:14,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456987349] [2021-12-21 22:38:14,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456987349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:14,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:14,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 22:38:14,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186890718] [2021-12-21 22:38:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:14,996 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:38:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash 449891219, now seen corresponding path program 1 times [2021-12-21 22:38:14,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:14,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904510943] [2021-12-21 22:38:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:14,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:15,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:15,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904510943] [2021-12-21 22:38:15,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904510943] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:15,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:15,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:38:15,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165737403] [2021-12-21 22:38:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:15,074 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:38:15,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:38:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:38:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:38:15,075 INFO L87 Difference]: Start difference. First operand 151 states and 223 transitions. cyclomatic complexity: 73 Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:38:15,140 INFO L93 Difference]: Finished difference Result 258 states and 371 transitions. [2021-12-21 22:38:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:38:15,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 371 transitions. [2021-12-21 22:38:15,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 227 [2021-12-21 22:38:15,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 371 transitions. [2021-12-21 22:38:15,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2021-12-21 22:38:15,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2021-12-21 22:38:15,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 371 transitions. [2021-12-21 22:38:15,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:38:15,148 INFO L681 BuchiCegarLoop]: Abstraction has 258 states and 371 transitions. [2021-12-21 22:38:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 371 transitions. [2021-12-21 22:38:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 245. [2021-12-21 22:38:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 245 states have (on average 1.4448979591836735) internal successors, (354), 244 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 354 transitions. [2021-12-21 22:38:15,158 INFO L704 BuchiCegarLoop]: Abstraction has 245 states and 354 transitions. [2021-12-21 22:38:15,158 INFO L587 BuchiCegarLoop]: Abstraction has 245 states and 354 transitions. [2021-12-21 22:38:15,158 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:38:15,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 354 transitions. [2021-12-21 22:38:15,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 214 [2021-12-21 22:38:15,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:15,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:15,161 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] [2021-12-21 22:38:15,161 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] [2021-12-21 22:38:15,161 INFO L791 eck$LassoCheckResult]: Stem: 906#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 833#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 834#L403 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 743#L175 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 744#L182 assume 1 == ~m_i~0;~m_st~0 := 0; 795#L182-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 796#L187-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 814#L271 assume !(0 == ~M_E~0); 815#L271-2 assume !(0 == ~T1_E~0); 831#L276-1 assume !(0 == ~E_M~0); 832#L281-1 assume !(0 == ~E_1~0); 801#L286-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 767#L136 assume !(1 == ~m_pc~0); 768#L136-2 is_master_triggered_~__retres1~0#1 := 0; 813#L147 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 810#L148 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 758#L331 assume !(0 != activate_threads_~tmp~1#1); 759#L331-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 839#L155 assume 1 == ~t1_pc~0; 840#L156 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 893#L166 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 790#L167 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 791#L339 assume !(0 != activate_threads_~tmp___0~0#1); 900#L339-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 828#L299 assume !(1 == ~M_E~0); 829#L299-2 assume !(1 == ~T1_E~0); 886#L304-1 assume !(1 == ~E_M~0); 773#L309-1 assume !(1 == ~E_1~0); 774#L314-1 assume { :end_inline_reset_delta_events } true; 818#L440-2 [2021-12-21 22:38:15,161 INFO L793 eck$LassoCheckResult]: Loop: 818#L440-2 assume !false; 792#L441 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret6#1, eval_#t~nondet7#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 746#L246 assume !false; 864#L223 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 866#L200 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 875#L212 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 876#L213 eval_#t~ret6#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret6#1;havoc eval_#t~ret6#1; 908#L227 assume !(0 != eval_~tmp~0#1); 911#L261 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 907#L175-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 873#L271-3 assume 0 == ~M_E~0;~M_E~0 := 1; 874#L271-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 783#L276-3 assume 0 == ~E_M~0;~E_M~0 := 1; 784#L281-3 assume 0 == ~E_1~0;~E_1~0 := 1; 799#L286-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 854#L136-9 assume !(1 == ~m_pc~0); 754#L136-11 is_master_triggered_~__retres1~0#1 := 0; 755#L147-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 882#L148-3 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 852#L331-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 853#L331-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 835#L155-9 assume 1 == ~t1_pc~0; 836#L156-3 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 877#L166-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 946#L167-3 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 944#L339-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 941#L339-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 894#L299-3 assume 1 == ~M_E~0;~M_E~0 := 2; 806#L299-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 807#L304-3 assume 1 == ~E_M~0;~E_M~0 := 2; 879#L309-3 assume 1 == ~E_1~0;~E_1~0 := 2; 880#L314-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 934#L200-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 932#L212-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 931#L213-1 start_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 930#L459 assume !(0 == start_simulation_~tmp~3#1); 793#L459-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret11#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 794#L200-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 883#L212-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 760#L213-2 stop_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret11#1;havoc stop_simulation_#t~ret11#1; 761#L414 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 809#L421 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 769#L422 start_simulation_#t~ret13#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 770#L472 assume !(0 != start_simulation_~tmp___0~1#1); 818#L440-2 [2021-12-21 22:38:15,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1269536452, now seen corresponding path program 1 times [2021-12-21 22:38:15,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919538022] [2021-12-21 22:38:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:15,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:15,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919538022] [2021-12-21 22:38:15,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919538022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:15,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:15,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:38:15,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354332687] [2021-12-21 22:38:15,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:15,196 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:38:15,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash 449891219, now seen corresponding path program 2 times [2021-12-21 22:38:15,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169594666] [2021-12-21 22:38:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:15,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:15,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169594666] [2021-12-21 22:38:15,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169594666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:15,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:15,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:38:15,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692652872] [2021-12-21 22:38:15,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:15,233 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:38:15,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:38:15,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:38:15,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:38:15,234 INFO L87 Difference]: Start difference. First operand 245 states and 354 transitions. cyclomatic complexity: 111 Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:38:15,316 INFO L93 Difference]: Finished difference Result 522 states and 737 transitions. [2021-12-21 22:38:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:38:15,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 522 states and 737 transitions. [2021-12-21 22:38:15,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 471 [2021-12-21 22:38:15,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 522 states to 522 states and 737 transitions. [2021-12-21 22:38:15,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2021-12-21 22:38:15,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 522 [2021-12-21 22:38:15,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 737 transitions. [2021-12-21 22:38:15,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:38:15,327 INFO L681 BuchiCegarLoop]: Abstraction has 522 states and 737 transitions. [2021-12-21 22:38:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 737 transitions. [2021-12-21 22:38:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 417. [2021-12-21 22:38:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 417 states have (on average 1.434052757793765) internal successors, (598), 416 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 598 transitions. [2021-12-21 22:38:15,342 INFO L704 BuchiCegarLoop]: Abstraction has 417 states and 598 transitions. [2021-12-21 22:38:15,342 INFO L587 BuchiCegarLoop]: Abstraction has 417 states and 598 transitions. [2021-12-21 22:38:15,342 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:38:15,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 598 transitions. [2021-12-21 22:38:15,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 386 [2021-12-21 22:38:15,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:15,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:15,346 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] [2021-12-21 22:38:15,346 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] [2021-12-21 22:38:15,346 INFO L791 eck$LassoCheckResult]: Stem: 1682#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 1610#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 1611#L403 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 1522#L175 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1523#L182 assume 1 == ~m_i~0;~m_st~0 := 0; 1571#L182-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1572#L187-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1591#L271 assume !(0 == ~M_E~0); 1592#L271-2 assume !(0 == ~T1_E~0); 1608#L276-1 assume !(0 == ~E_M~0); 1609#L281-1 assume !(0 == ~E_1~0); 1578#L286-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 1545#L136 assume !(1 == ~m_pc~0); 1546#L136-2 is_master_triggered_~__retres1~0#1 := 0; 1590#L147 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 1587#L148 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 1537#L331 assume !(0 != activate_threads_~tmp~1#1); 1538#L331-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 1614#L155 assume !(1 == ~t1_pc~0); 1615#L155-2 is_transmit1_triggered_~__retres1~1#1 := 0; 1667#L166 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 1567#L167 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 1568#L339 assume !(0 != activate_threads_~tmp___0~0#1); 1675#L339-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1602#L299 assume !(1 == ~M_E~0); 1603#L299-2 assume !(1 == ~T1_E~0); 1660#L304-1 assume !(1 == ~E_M~0); 1551#L309-1 assume !(1 == ~E_1~0); 1552#L314-1 assume { :end_inline_reset_delta_events } true; 1595#L440-2 [2021-12-21 22:38:15,347 INFO L793 eck$LassoCheckResult]: Loop: 1595#L440-2 assume !false; 1569#L441 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret6#1, eval_#t~nondet7#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 1525#L246 assume !false; 1638#L223 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1640#L200 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1651#L212 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1652#L213 eval_#t~ret6#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret6#1;havoc eval_#t~ret6#1; 1668#L227 assume !(0 != eval_~tmp~0#1); 1669#L261 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 1683#L175-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 1649#L271-3 assume 0 == ~M_E~0;~M_E~0 := 1; 1650#L271-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1560#L276-3 assume 0 == ~E_M~0;~E_M~0 := 1; 1561#L281-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1929#L286-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 1628#L136-9 assume !(1 == ~m_pc~0); 1533#L136-11 is_master_triggered_~__retres1~0#1 := 0; 1534#L147-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 1656#L148-3 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 1626#L331-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 1627#L331-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 1612#L155-9 assume !(1 == ~t1_pc~0); 1613#L155-11 is_transmit1_triggered_~__retres1~1#1 := 0; 1573#L166-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 1574#L167-3 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 1625#L339-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 1639#L339-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1642#L299-3 assume 1 == ~M_E~0;~M_E~0 := 2; 1583#L299-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1584#L304-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1654#L309-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1585#L314-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1562#L200-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1563#L212-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1670#L213-1 start_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 1530#L459 assume !(0 == start_simulation_~tmp~3#1); 1531#L459-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret11#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1570#L200-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1657#L212-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1539#L213-2 stop_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret11#1;havoc stop_simulation_#t~ret11#1; 1540#L414 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 1586#L421 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 1547#L422 start_simulation_#t~ret13#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 1548#L472 assume !(0 != start_simulation_~tmp___0~1#1); 1595#L440-2 [2021-12-21 22:38:15,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,347 INFO L85 PathProgramCache]: Analyzing trace with hash 396697797, now seen corresponding path program 1 times [2021-12-21 22:38:15,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130307971] [2021-12-21 22:38:15,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,356 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:38:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,379 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:38:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1229872148, now seen corresponding path program 1 times [2021-12-21 22:38:15,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817097527] [2021-12-21 22:38:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:15,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:15,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817097527] [2021-12-21 22:38:15,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817097527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:15,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:15,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:38:15,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373772312] [2021-12-21 22:38:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:15,415 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:38:15,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:38:15,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:38:15,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:38:15,416 INFO L87 Difference]: Start difference. First operand 417 states and 598 transitions. cyclomatic complexity: 183 Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:38:15,476 INFO L93 Difference]: Finished difference Result 713 states and 996 transitions. [2021-12-21 22:38:15,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 22:38:15,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 713 states and 996 transitions. [2021-12-21 22:38:15,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 680 [2021-12-21 22:38:15,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 713 states to 713 states and 996 transitions. [2021-12-21 22:38:15,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 713 [2021-12-21 22:38:15,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 713 [2021-12-21 22:38:15,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 713 states and 996 transitions. [2021-12-21 22:38:15,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:38:15,488 INFO L681 BuchiCegarLoop]: Abstraction has 713 states and 996 transitions. [2021-12-21 22:38:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states and 996 transitions. [2021-12-21 22:38:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 429. [2021-12-21 22:38:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 429 states have (on average 1.421911421911422) internal successors, (610), 428 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 610 transitions. [2021-12-21 22:38:15,499 INFO L704 BuchiCegarLoop]: Abstraction has 429 states and 610 transitions. [2021-12-21 22:38:15,499 INFO L587 BuchiCegarLoop]: Abstraction has 429 states and 610 transitions. [2021-12-21 22:38:15,499 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:38:15,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 610 transitions. [2021-12-21 22:38:15,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 398 [2021-12-21 22:38:15,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:15,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:15,503 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] [2021-12-21 22:38:15,503 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] [2021-12-21 22:38:15,503 INFO L791 eck$LassoCheckResult]: Stem: 2847#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 2759#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 2760#L403 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 2668#L175 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2669#L182 assume 1 == ~m_i~0;~m_st~0 := 0; 2719#L182-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2720#L187-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2740#L271 assume !(0 == ~M_E~0); 2741#L271-2 assume !(0 == ~T1_E~0); 2757#L276-1 assume !(0 == ~E_M~0); 2758#L281-1 assume !(0 == ~E_1~0); 2726#L286-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 2691#L136 assume !(1 == ~m_pc~0); 2692#L136-2 is_master_triggered_~__retres1~0#1 := 0; 2739#L147 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 2736#L148 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 2683#L331 assume !(0 != activate_threads_~tmp~1#1); 2684#L331-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 2764#L155 assume !(1 == ~t1_pc~0); 2765#L155-2 is_transmit1_triggered_~__retres1~1#1 := 0; 2825#L166 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 2713#L167 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 2714#L339 assume !(0 != activate_threads_~tmp___0~0#1); 2833#L339-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2754#L299 assume !(1 == ~M_E~0); 2755#L299-2 assume !(1 == ~T1_E~0); 2821#L304-1 assume !(1 == ~E_M~0); 2699#L309-1 assume !(1 == ~E_1~0); 2700#L314-1 assume { :end_inline_reset_delta_events } true; 2775#L440-2 [2021-12-21 22:38:15,503 INFO L793 eck$LassoCheckResult]: Loop: 2775#L440-2 assume !false; 3082#L441 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret6#1, eval_#t~nondet7#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 2671#L246 assume !false; 2792#L223 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 2793#L200 assume !(0 == ~m_st~0); 2836#L204 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 2840#L212 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 3039#L213 eval_#t~ret6#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret6#1;havoc eval_#t~ret6#1; 3038#L227 assume !(0 != eval_~tmp~0#1); 2857#L261 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 2848#L175-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 2805#L271-3 assume 0 == ~M_E~0;~M_E~0 := 1; 2806#L271-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2923#L276-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2920#L281-3 assume 0 == ~E_1~0;~E_1~0 := 1; 2918#L286-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 2915#L136-9 assume !(1 == ~m_pc~0); 2901#L136-11 is_master_triggered_~__retres1~0#1 := 0; 2902#L147-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 2839#L148-3 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 2778#L331-9 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 2779#L331-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 2761#L155-9 assume !(1 == ~t1_pc~0); 2762#L155-11 is_transmit1_triggered_~__retres1~1#1 := 0; 2809#L166-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 2776#L167-3 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 2777#L339-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 2796#L339-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2797#L299-3 assume 1 == ~M_E~0;~M_E~0 := 2; 2731#L299-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2732#L304-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2813#L309-3 assume 1 == ~E_1~0;~E_1~0 := 2; 2814#L314-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 2708#L200-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 2709#L212-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 2831#L213-1 start_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 2676#L459 assume !(0 == start_simulation_~tmp~3#1); 2677#L459-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret11#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 3089#L200-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 2855#L212-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 2685#L213-2 stop_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret11#1;havoc stop_simulation_#t~ret11#1; 2686#L414 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 3086#L421 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 3085#L422 start_simulation_#t~ret13#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 3084#L472 assume !(0 != start_simulation_~tmp___0~1#1); 2775#L440-2 [2021-12-21 22:38:15,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,504 INFO L85 PathProgramCache]: Analyzing trace with hash 396697797, now seen corresponding path program 2 times [2021-12-21 22:38:15,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52974341] [2021-12-21 22:38:15,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:38:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,522 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:38:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2104030869, now seen corresponding path program 1 times [2021-12-21 22:38:15,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311301118] [2021-12-21 22:38:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:15,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:15,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311301118] [2021-12-21 22:38:15,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311301118] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:15,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:15,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:38:15,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395036412] [2021-12-21 22:38:15,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:15,600 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:38:15,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:38:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:38:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:38:15,601 INFO L87 Difference]: Start difference. First operand 429 states and 610 transitions. cyclomatic complexity: 183 Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:38:15,705 INFO L93 Difference]: Finished difference Result 822 states and 1157 transitions. [2021-12-21 22:38:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 22:38:15,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 822 states and 1157 transitions. [2021-12-21 22:38:15,714 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 791 [2021-12-21 22:38:15,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 822 states to 822 states and 1157 transitions. [2021-12-21 22:38:15,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 822 [2021-12-21 22:38:15,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 822 [2021-12-21 22:38:15,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 822 states and 1157 transitions. [2021-12-21 22:38:15,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:38:15,722 INFO L681 BuchiCegarLoop]: Abstraction has 822 states and 1157 transitions. [2021-12-21 22:38:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states and 1157 transitions. [2021-12-21 22:38:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 450. [2021-12-21 22:38:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 450 states have (on average 1.3888888888888888) internal successors, (625), 449 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 625 transitions. [2021-12-21 22:38:15,730 INFO L704 BuchiCegarLoop]: Abstraction has 450 states and 625 transitions. [2021-12-21 22:38:15,730 INFO L587 BuchiCegarLoop]: Abstraction has 450 states and 625 transitions. [2021-12-21 22:38:15,731 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 22:38:15,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 450 states and 625 transitions. [2021-12-21 22:38:15,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 419 [2021-12-21 22:38:15,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:15,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:15,734 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] [2021-12-21 22:38:15,734 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] [2021-12-21 22:38:15,735 INFO L791 eck$LassoCheckResult]: Stem: 4101#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 4019#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 4020#L403 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 3932#L175 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3933#L182 assume 1 == ~m_i~0;~m_st~0 := 0; 3979#L182-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3980#L187-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 4000#L271 assume !(0 == ~M_E~0); 4001#L271-2 assume !(0 == ~T1_E~0); 4017#L276-1 assume !(0 == ~E_M~0); 4018#L281-1 assume !(0 == ~E_1~0); 3987#L286-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 3955#L136 assume !(1 == ~m_pc~0); 3956#L136-2 is_master_triggered_~__retres1~0#1 := 0; 3999#L147 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 3996#L148 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 3947#L331 assume !(0 != activate_threads_~tmp~1#1); 3948#L331-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 4024#L155 assume !(1 == ~t1_pc~0); 4025#L155-2 is_transmit1_triggered_~__retres1~1#1 := 0; 4082#L166 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 3975#L167 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 3976#L339 assume !(0 != activate_threads_~tmp___0~0#1); 4088#L339-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4011#L299 assume !(1 == ~M_E~0); 4012#L299-2 assume !(1 == ~T1_E~0); 4075#L304-1 assume !(1 == ~E_M~0); 3961#L309-1 assume !(1 == ~E_1~0); 3962#L314-1 assume { :end_inline_reset_delta_events } true; 4035#L440-2 [2021-12-21 22:38:15,736 INFO L793 eck$LassoCheckResult]: Loop: 4035#L440-2 assume !false; 4194#L441 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret6#1, eval_#t~nondet7#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 4164#L246 assume !false; 4165#L223 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 4161#L200 assume !(0 == ~m_st~0); 4158#L204 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 4160#L212 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 4154#L213 eval_#t~ret6#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret6#1;havoc eval_#t~ret6#1; 4155#L227 assume !(0 != eval_~tmp~0#1); 4209#L261 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 4148#L175-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 4149#L271-3 assume 0 == ~M_E~0;~M_E~0 := 1; 4144#L271-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 4145#L276-3 assume 0 == ~E_M~0;~E_M~0 := 1; 4140#L281-3 assume 0 == ~E_1~0;~E_1~0 := 1; 4141#L286-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 4298#L136-9 assume !(1 == ~m_pc~0); 4297#L136-11 is_master_triggered_~__retres1~0#1 := 0; 4295#L147-3 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 4293#L148-3 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 4291#L331-9 assume !(0 != activate_threads_~tmp~1#1); 4288#L331-11 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 4283#L155-9 assume !(1 == ~t1_pc~0); 4278#L155-11 is_transmit1_triggered_~__retres1~1#1 := 0; 4274#L166-3 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 4270#L167-3 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 4267#L339-9 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 4262#L339-11 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4258#L299-3 assume 1 == ~M_E~0;~M_E~0 := 2; 4254#L299-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 4250#L304-3 assume 1 == ~E_M~0;~E_M~0 := 2; 4246#L309-3 assume 1 == ~E_1~0;~E_1~0 := 2; 4242#L314-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 4237#L200-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 4232#L212-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 4228#L213-1 start_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 4223#L459 assume !(0 == start_simulation_~tmp~3#1); 4220#L459-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret11#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 4217#L200-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 4214#L212-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 4212#L213-2 stop_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret11#1;havoc stop_simulation_#t~ret11#1; 4205#L414 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 4206#L421 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 4201#L422 start_simulation_#t~ret13#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 4202#L472 assume !(0 != start_simulation_~tmp___0~1#1); 4035#L440-2 [2021-12-21 22:38:15,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash 396697797, now seen corresponding path program 3 times [2021-12-21 22:38:15,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949176384] [2021-12-21 22:38:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:38:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,770 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:38:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2050387817, now seen corresponding path program 1 times [2021-12-21 22:38:15,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600239940] [2021-12-21 22:38:15,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:15,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600239940] [2021-12-21 22:38:15,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600239940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:15,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:15,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:38:15,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087637304] [2021-12-21 22:38:15,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:15,814 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:38:15,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:38:15,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:38:15,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:38:15,817 INFO L87 Difference]: Start difference. First operand 450 states and 625 transitions. cyclomatic complexity: 177 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-12-21 22:38:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:38:15,842 INFO L93 Difference]: Finished difference Result 651 states and 883 transitions. [2021-12-21 22:38:15,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:38:15,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 651 states and 883 transitions. [2021-12-21 22:38:15,848 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 616 [2021-12-21 22:38:15,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 651 states to 651 states and 883 transitions. [2021-12-21 22:38:15,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 651 [2021-12-21 22:38:15,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 651 [2021-12-21 22:38:15,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 651 states and 883 transitions. [2021-12-21 22:38:15,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:38:15,858 INFO L681 BuchiCegarLoop]: Abstraction has 651 states and 883 transitions. [2021-12-21 22:38:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states and 883 transitions. [2021-12-21 22:38:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 634. [2021-12-21 22:38:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 1.359621451104101) internal successors, (862), 633 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 862 transitions. [2021-12-21 22:38:15,868 INFO L704 BuchiCegarLoop]: Abstraction has 634 states and 862 transitions. [2021-12-21 22:38:15,868 INFO L587 BuchiCegarLoop]: Abstraction has 634 states and 862 transitions. [2021-12-21 22:38:15,868 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 22:38:15,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 862 transitions. [2021-12-21 22:38:15,871 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 599 [2021-12-21 22:38:15,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:15,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:15,871 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] [2021-12-21 22:38:15,871 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:38:15,873 INFO L791 eck$LassoCheckResult]: Stem: 5215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 5126#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 5127#L403 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 5039#L175 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 5040#L182 assume 1 == ~m_i~0;~m_st~0 := 0; 5084#L182-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5085#L187-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 5107#L271 assume !(0 == ~M_E~0); 5108#L271-2 assume !(0 == ~T1_E~0); 5124#L276-1 assume !(0 == ~E_M~0); 5125#L281-1 assume !(0 == ~E_1~0); 5093#L286-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 5062#L136 assume !(1 == ~m_pc~0); 5063#L136-2 is_master_triggered_~__retres1~0#1 := 0; 5106#L147 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 5103#L148 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 5054#L331 assume !(0 != activate_threads_~tmp~1#1); 5055#L331-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 5130#L155 assume !(1 == ~t1_pc~0); 5131#L155-2 is_transmit1_triggered_~__retres1~1#1 := 0; 5191#L166 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 5080#L167 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 5081#L339 assume !(0 != activate_threads_~tmp___0~0#1); 5203#L339-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 5118#L299 assume !(1 == ~M_E~0); 5119#L299-2 assume !(1 == ~T1_E~0); 5183#L304-1 assume !(1 == ~E_M~0); 5068#L309-1 assume !(1 == ~E_1~0); 5069#L314-1 assume { :end_inline_reset_delta_events } true; 5140#L440-2 assume !false; 5458#L441 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret6#1, eval_#t~nondet7#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 5355#L246 [2021-12-21 22:38:15,873 INFO L793 eck$LassoCheckResult]: Loop: 5355#L246 assume !false; 5450#L223 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 5445#L200 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 5440#L212 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 5435#L213 eval_#t~ret6#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret6#1;havoc eval_#t~ret6#1; 5432#L227 assume 0 != eval_~tmp~0#1; 5428#L227-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 5208#L235 assume !(0 != eval_~tmp_ndt_1~0#1); 5209#L232 assume !(0 == ~t1_st~0); 5355#L246 [2021-12-21 22:38:15,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1025502329, now seen corresponding path program 1 times [2021-12-21 22:38:15,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053177308] [2021-12-21 22:38:15,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:38:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,895 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:38:15,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2078331601, now seen corresponding path program 1 times [2021-12-21 22:38:15,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79933750] [2021-12-21 22:38:15,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,899 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:38:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:15,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:38:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1188517387, now seen corresponding path program 1 times [2021-12-21 22:38:15,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:15,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296699330] [2021-12-21 22:38:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:15,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:15,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:15,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296699330] [2021-12-21 22:38:15,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296699330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:15,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:15,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 22:38:15,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494066017] [2021-12-21 22:38:15,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:16,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:38:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:38:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:38:16,008 INFO L87 Difference]: Start difference. First operand 634 states and 862 transitions. cyclomatic complexity: 232 Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:38:16,044 INFO L93 Difference]: Finished difference Result 1055 states and 1414 transitions. [2021-12-21 22:38:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:38:16,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1055 states and 1414 transitions. [2021-12-21 22:38:16,051 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 993 [2021-12-21 22:38:16,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1055 states to 1055 states and 1414 transitions. [2021-12-21 22:38:16,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1055 [2021-12-21 22:38:16,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1055 [2021-12-21 22:38:16,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1055 states and 1414 transitions. [2021-12-21 22:38:16,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:38:16,058 INFO L681 BuchiCegarLoop]: Abstraction has 1055 states and 1414 transitions. [2021-12-21 22:38:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states and 1414 transitions. [2021-12-21 22:38:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1039. [2021-12-21 22:38:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1039 states have (on average 1.3455245428296438) internal successors, (1398), 1038 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1398 transitions. [2021-12-21 22:38:16,073 INFO L704 BuchiCegarLoop]: Abstraction has 1039 states and 1398 transitions. [2021-12-21 22:38:16,073 INFO L587 BuchiCegarLoop]: Abstraction has 1039 states and 1398 transitions. [2021-12-21 22:38:16,074 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-21 22:38:16,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1039 states and 1398 transitions. [2021-12-21 22:38:16,090 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 977 [2021-12-21 22:38:16,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:16,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:16,090 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] [2021-12-21 22:38:16,091 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:38:16,091 INFO L791 eck$LassoCheckResult]: Stem: 6914#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 6825#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 6826#L403 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 6736#L175 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 6737#L182 assume 1 == ~m_i~0;~m_st~0 := 0; 6784#L182-2 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 6785#L187-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 6805#L271 assume !(0 == ~M_E~0); 6806#L271-2 assume !(0 == ~T1_E~0); 6823#L276-1 assume !(0 == ~E_M~0); 6824#L281-1 assume !(0 == ~E_1~0); 6792#L286-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 6759#L136 assume !(1 == ~m_pc~0); 6760#L136-2 is_master_triggered_~__retres1~0#1 := 0; 6804#L147 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 6801#L148 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 6751#L331 assume !(0 != activate_threads_~tmp~1#1); 6752#L331-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 6830#L155 assume !(1 == ~t1_pc~0); 6831#L155-2 is_transmit1_triggered_~__retres1~1#1 := 0; 6892#L166 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 6779#L167 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 6780#L339 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 6920#L339-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7673#L299 assume !(1 == ~M_E~0); 7672#L299-2 assume !(1 == ~T1_E~0); 7671#L304-1 assume !(1 == ~E_M~0); 7670#L309-1 assume !(1 == ~E_1~0); 7669#L314-1 assume { :end_inline_reset_delta_events } true; 7668#L440-2 assume !false; 7667#L441 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret6#1, eval_#t~nondet7#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 7651#L246 [2021-12-21 22:38:16,091 INFO L793 eck$LassoCheckResult]: Loop: 7651#L246 assume !false; 7666#L223 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 7663#L200 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 7661#L212 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 7659#L213 eval_#t~ret6#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret6#1;havoc eval_#t~ret6#1; 7657#L227 assume 0 != eval_~tmp~0#1; 7654#L227-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 6905#L235 assume !(0 != eval_~tmp_ndt_1~0#1); 6906#L232 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;eval_~tmp_ndt_2~0#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 7650#L249 assume !(0 != eval_~tmp_ndt_2~0#1); 7651#L246 [2021-12-21 22:38:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1643521085, now seen corresponding path program 1 times [2021-12-21 22:38:16,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:16,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845389417] [2021-12-21 22:38:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:16,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:38:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:38:16,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:38:16,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845389417] [2021-12-21 22:38:16,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845389417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:38:16,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:38:16,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:38:16,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159273428] [2021-12-21 22:38:16,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:38:16,108 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:38:16,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash 3767933, now seen corresponding path program 1 times [2021-12-21 22:38:16,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:16,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163350349] [2021-12-21 22:38:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:16,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:16,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:38:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:16,115 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:38:16,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:38:16,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:38:16,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:38:16,174 INFO L87 Difference]: Start difference. First operand 1039 states and 1398 transitions. cyclomatic complexity: 364 Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:38:16,195 INFO L93 Difference]: Finished difference Result 1004 states and 1349 transitions. [2021-12-21 22:38:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:38:16,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1004 states and 1349 transitions. [2021-12-21 22:38:16,202 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 968 [2021-12-21 22:38:16,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1004 states to 1004 states and 1349 transitions. [2021-12-21 22:38:16,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1004 [2021-12-21 22:38:16,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1004 [2021-12-21 22:38:16,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1004 states and 1349 transitions. [2021-12-21 22:38:16,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:38:16,222 INFO L681 BuchiCegarLoop]: Abstraction has 1004 states and 1349 transitions. [2021-12-21 22:38:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states and 1349 transitions. [2021-12-21 22:38:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2021-12-21 22:38:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1004 states have (on average 1.343625498007968) internal successors, (1349), 1003 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:38:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1349 transitions. [2021-12-21 22:38:16,251 INFO L704 BuchiCegarLoop]: Abstraction has 1004 states and 1349 transitions. [2021-12-21 22:38:16,251 INFO L587 BuchiCegarLoop]: Abstraction has 1004 states and 1349 transitions. [2021-12-21 22:38:16,252 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-21 22:38:16,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1004 states and 1349 transitions. [2021-12-21 22:38:16,256 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 968 [2021-12-21 22:38:16,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:38:16,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:38:16,256 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] [2021-12-21 22:38:16,257 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:38:16,257 INFO L791 eck$LassoCheckResult]: Stem: 8976#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 8873#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; 8874#L403 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 8785#L175 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 8786#L182 assume 1 == ~m_i~0;~m_st~0 := 0; 8833#L182-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 8834#L187-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 8853#L271 assume !(0 == ~M_E~0); 8854#L271-2 assume !(0 == ~T1_E~0); 8871#L276-1 assume !(0 == ~E_M~0); 8872#L281-1 assume !(0 == ~E_1~0); 8839#L286-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 8808#L136 assume !(1 == ~m_pc~0); 8809#L136-2 is_master_triggered_~__retres1~0#1 := 0; 8852#L147 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 8849#L148 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 8800#L331 assume !(0 != activate_threads_~tmp~1#1); 8801#L331-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 8878#L155 assume !(1 == ~t1_pc~0); 8879#L155-2 is_transmit1_triggered_~__retres1~1#1 := 0; 8942#L166 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 8828#L167 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 8829#L339 assume !(0 != activate_threads_~tmp___0~0#1); 8955#L339-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 8864#L299 assume !(1 == ~M_E~0); 8865#L299-2 assume !(1 == ~T1_E~0); 8936#L304-1 assume !(1 == ~E_M~0); 8816#L309-1 assume !(1 == ~E_1~0); 8817#L314-1 assume { :end_inline_reset_delta_events } true; 8891#L440-2 assume !false; 9258#L441 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret6#1, eval_#t~nondet7#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 9257#L246 [2021-12-21 22:38:16,257 INFO L793 eck$LassoCheckResult]: Loop: 9257#L246 assume !false; 9256#L223 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 9255#L200 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 9254#L212 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 9253#L213 eval_#t~ret6#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret6#1;havoc eval_#t~ret6#1; 9252#L227 assume 0 != eval_~tmp~0#1; 9251#L227-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 9249#L235 assume !(0 != eval_~tmp_ndt_1~0#1); 9250#L232 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;eval_~tmp_ndt_2~0#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 9259#L249 assume !(0 != eval_~tmp_ndt_2~0#1); 9257#L246 [2021-12-21 22:38:16,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1025502329, now seen corresponding path program 2 times [2021-12-21 22:38:16,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:16,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852941415] [2021-12-21 22:38:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:16,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:16,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:38:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:16,269 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:38:16,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash 3767933, now seen corresponding path program 2 times [2021-12-21 22:38:16,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:16,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965231567] [2021-12-21 22:38:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:16,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:16,273 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:38:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:16,275 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:38:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:38:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1810668925, now seen corresponding path program 1 times [2021-12-21 22:38:16,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:38:16,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508940031] [2021-12-21 22:38:16,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:38:16,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:38:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:16,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:38:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:38:16,288 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:38:16,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.12 10:38:16 BoogieIcfgContainer [2021-12-21 22:38:16,804 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-21 22:38:16,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 22:38:16,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 22:38:16,805 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 22:38:16,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:38:14" (3/4) ... [2021-12-21 22:38:16,808 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-21 22:38:16,839 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 22:38:16,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 22:38:16,840 INFO L158 Benchmark]: Toolchain (without parser) took 3194.77ms. Allocated memory was 98.6MB in the beginning and 151.0MB in the end (delta: 52.4MB). Free memory was 69.0MB in the beginning and 110.7MB in the end (delta: -41.7MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2021-12-21 22:38:16,841 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 22:38:16,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.46ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 68.7MB in the beginning and 94.1MB in the end (delta: -25.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 22:38:16,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.67ms. Allocated memory is still 119.5MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:38:16,841 INFO L158 Benchmark]: Boogie Preprocessor took 24.42ms. Allocated memory is still 119.5MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:38:16,842 INFO L158 Benchmark]: RCFGBuilder took 477.77ms. Allocated memory is still 119.5MB. Free memory was 89.9MB in the beginning and 70.6MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-21 22:38:16,842 INFO L158 Benchmark]: BuchiAutomizer took 2341.69ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 70.6MB in the beginning and 112.8MB in the end (delta: -42.2MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2021-12-21 22:38:16,842 INFO L158 Benchmark]: Witness Printer took 35.00ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 110.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:38:16,844 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.18ms. Allocated memory is still 98.6MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.46ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 68.7MB in the beginning and 94.1MB in the end (delta: -25.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.67ms. Allocated memory is still 119.5MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.42ms. Allocated memory is still 119.5MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.77ms. Allocated memory is still 119.5MB. Free memory was 89.9MB in the beginning and 70.6MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 2341.69ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 70.6MB in the beginning and 112.8MB in the end (delta: -42.2MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Witness Printer took 35.00ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 110.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1004 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 807 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1039 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2268 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2268 mSDsluCounter, 3998 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2237 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 1761 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI3 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: 222]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f8152c3=0, token=0, NULL=1, \result=0, tmp=0, __retres1=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@317a9f1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a6e99cd=0, tmp=0, t1_pc=0, tmp_ndt_2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c330830=0, tmp___0=0, T1_E=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1982e0b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e6e09d5=0, E_1=2, __retres1=0, M_E=2, tmp_ndt_1=0, __retres1=1, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12b4c890=0, \result=0, m_i=1, t1_st=0, __retres1=0, local=0, m_st=0, E_M=2, NULL=0, kernel_st=1, tmp___0=0, t1_i=1, m_pc=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 222]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 [L433] FCALL update_channels() [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 [L434] RET init_threads() [L435] CALL fire_delta_events() [L271] COND FALSE !(M_E == 0) [L276] COND FALSE !(T1_E == 0) [L281] COND FALSE !(E_M == 0) [L286] COND FALSE !(E_1 == 0) [L435] RET fire_delta_events() [L436] CALL activate_threads() [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; [L136] COND FALSE !(m_pc == 1) [L146] __retres1 = 0 [L148] return (__retres1); [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; [L155] COND FALSE !(t1_pc == 1) [L165] __retres1 = 0 [L167] return (__retres1); [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) [L436] RET activate_threads() [L437] CALL reset_delta_events() [L299] COND FALSE !(M_E == 1) [L304] COND FALSE !(T1_E == 1) [L309] COND FALSE !(E_M == 1) [L314] COND FALSE !(E_1 == 1) [L437] RET reset_delta_events() [L440] COND TRUE 1 [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; Loop: [L222] COND TRUE 1 [L225] CALL, EXPR exists_runnable_thread() [L197] int __retres1 ; [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 [L213] return (__retres1); [L225] RET, EXPR exists_runnable_thread() [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-21 22:38:16,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)