./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e28c81ffc5a1b93c1edca1581014bee1ba1c062c6df3b7a8a783721ae21bc12 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:15:12,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:15:12,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:15:12,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:15:12,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:15:12,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:15:12,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:15:12,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:15:12,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:15:12,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:15:12,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:15:12,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:15:12,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:15:12,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:15:12,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:15:12,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:15:12,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:15:12,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:15:12,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:15:12,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:15:12,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:15:12,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:15:12,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:15:12,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:15:12,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:15:12,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:15:12,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:15:12,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:15:12,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:15:12,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:15:12,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:15:12,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:15:12,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:15:12,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:15:12,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:15:12,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:15:12,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:15:12,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:15:12,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:15:12,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:15:12,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:15:12,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:15:12,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:15:12,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:15:12,864 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:15:12,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:15:12,864 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:15:12,865 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:15:12,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:15:12,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:15:12,865 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:15:12,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:15:12,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:15:12,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:15:12,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:15:12,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:15:12,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:15:12,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:15:12,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:15:12,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:15:12,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:15:12,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:15:12,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:15:12,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:15:12,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:15:12,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:15:12,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:15:12,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:15:12,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:15:12,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:15:12,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:15:12,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:15:12,869 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:15:12,869 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:15:12,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:15:12,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> 6e28c81ffc5a1b93c1edca1581014bee1ba1c062c6df3b7a8a783721ae21bc12 [2022-02-20 19:15:13,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:15:13,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:15:13,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:15:13,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:15:13,096 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:15:13,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-1.c [2022-02-20 19:15:13,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c60ed7a9/e82a873ac9bc48bc9ea28021e168853c/FLAGad2319cc6 [2022-02-20 19:15:13,852 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:15:13,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-1.c [2022-02-20 19:15:13,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c60ed7a9/e82a873ac9bc48bc9ea28021e168853c/FLAGad2319cc6 [2022-02-20 19:15:14,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c60ed7a9/e82a873ac9bc48bc9ea28021e168853c [2022-02-20 19:15:14,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:15:14,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:15:14,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:15:14,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:15:14,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:15:14,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:15:14" (1/1) ... [2022-02-20 19:15:14,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d95c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:14, skipping insertion in model container [2022-02-20 19:15:14,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:15:14" (1/1) ... [2022-02-20 19:15:14,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:15:14,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:15:15,558 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/combinations/Problem05_label42+token_ring.02.cil-1.c[378560,378573] [2022-02-20 19:15:15,578 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/combinations/Problem05_label42+token_ring.02.cil-1.c[383339,383352] [2022-02-20 19:15:15,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:15:15,708 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:15:16,361 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/combinations/Problem05_label42+token_ring.02.cil-1.c[378560,378573] [2022-02-20 19:15:16,367 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/combinations/Problem05_label42+token_ring.02.cil-1.c[383339,383352] [2022-02-20 19:15:16,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:15:16,431 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:15:16,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16 WrapperNode [2022-02-20 19:15:16,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:15:16,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:15:16,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:15:16,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:15:16,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:16,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:16,942 INFO L137 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12619 [2022-02-20 19:15:16,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:15:16,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:15:16,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:15:16,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:15:16,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:16,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:16,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:16,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:17,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:17,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:17,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:17,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:15:17,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:15:17,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:15:17,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:15:17,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (1/1) ... [2022-02-20 19:15:17,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:15:17,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:15:17,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:15:17,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:15:17,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:15:17,620 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:15:17,620 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:15:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:15:17,621 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:15:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:15:17,621 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:15:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:15:17,621 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:15:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:15:17,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:15:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:15:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:15:17,622 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:15:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:15:17,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:15:17,754 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:15:17,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:15:22,863 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:15:22,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:15:22,879 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 19:15:22,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:15:22 BoogieIcfgContainer [2022-02-20 19:15:22,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:15:22,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:15:22,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:15:22,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:15:22,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:15:14" (1/3) ... [2022-02-20 19:15:22,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef17795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:15:22, skipping insertion in model container [2022-02-20 19:15:22,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:15:16" (2/3) ... [2022-02-20 19:15:22,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef17795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:15:22, skipping insertion in model container [2022-02-20 19:15:22,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:15:22" (3/3) ... [2022-02-20 19:15:22,887 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.02.cil-1.c [2022-02-20 19:15:22,891 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:15:22,891 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:15:22,924 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:15:22,928 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:15:22,929 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:15:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 2315 states, 2290 states have (on average 1.8572052401746726) internal successors, (4253), 2293 states have internal predecessors, (4253), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 19:15:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:15:22,973 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:15:22,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:15:22,974 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:15:22,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:15:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1170312139, now seen corresponding path program 1 times [2022-02-20 19:15:22,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:15:22,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885491171] [2022-02-20 19:15:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:15:22,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:15:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:23,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:15:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:23,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:15:23,141 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2318#true} {2320#(= ~M_E~0 2)} #10580#return; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:15:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:23,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {2364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume true; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,171 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2365#(= |old(~M_E~0)| 0)} {2320#(= ~M_E~0 2)} #10582#return; {2319#false} is VALID [2022-02-20 19:15:23,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:15:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:23,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {2366#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~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; {2318#true} is VALID [2022-02-20 19:15:23,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 1 == ~m_pc~0; {2318#true} is VALID [2022-02-20 19:15:23,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2318#true} is VALID [2022-02-20 19:15:23,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {2318#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2318#true} is VALID [2022-02-20 19:15:23,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {2318#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {2318#true} is VALID [2022-02-20 19:15:23,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {2318#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2318#true} is VALID [2022-02-20 19:15:23,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {2318#true} 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; {2318#true} is VALID [2022-02-20 19:15:23,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {2318#true} assume !(1 == ~t1_pc~0); {2318#true} is VALID [2022-02-20 19:15:23,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {2318#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2318#true} is VALID [2022-02-20 19:15:23,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {2318#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2318#true} is VALID [2022-02-20 19:15:23,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {2318#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {2318#true} is VALID [2022-02-20 19:15:23,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {2318#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2318#true} is VALID [2022-02-20 19:15:23,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {2318#true} is VALID [2022-02-20 19:15:23,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#true} assume 1 == ~t2_pc~0; {2318#true} is VALID [2022-02-20 19:15:23,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2318#true} is VALID [2022-02-20 19:15:23,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {2318#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2318#true} is VALID [2022-02-20 19:15:23,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {2318#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {2318#true} is VALID [2022-02-20 19:15:23,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2318#true} is VALID [2022-02-20 19:15:23,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:15:23,194 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2318#true} {2319#false} #10584#return; {2319#false} is VALID [2022-02-20 19:15:23,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:15:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:23,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {2364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} assume !(1 == ~T2_E~0); {2318#true} is VALID [2022-02-20 19:15:23,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {2318#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {2318#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {2318#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:15:23,220 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2318#true} {2319#false} #10586#return; {2319#false} is VALID [2022-02-20 19:15:23,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:15:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:23,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#true} havoc ~__retres1~3; {2318#true} is VALID [2022-02-20 19:15:23,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2318#true} is VALID [2022-02-20 19:15:23,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} #res := ~__retres1~3; {2318#true} is VALID [2022-02-20 19:15:23,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:15:23,225 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2318#true} {2319#false} #10588#return; {2319#false} is VALID [2022-02-20 19:15:23,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#true} 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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {2320#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {2320#(= ~M_E~0 2)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~4#1;havoc main2_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {2320#(= ~M_E~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#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; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {2320#(= ~M_E~0 2)} call update_channels(); {2318#true} is VALID [2022-02-20 19:15:23,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:15:23,229 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2318#true} {2320#(= ~M_E~0 2)} #10580#return; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {2320#(= ~M_E~0 2)} assume { :begin_inline_init_threads } true; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {2320#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {2320#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {2320#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {2320#(= ~M_E~0 2)} assume { :end_inline_init_threads } true; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:15:23,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {2320#(= ~M_E~0 2)} call fire_delta_events(); {2364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:15:23,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {2364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume true; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:15:23,235 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2365#(= |old(~M_E~0)| 0)} {2320#(= ~M_E~0 2)} #10582#return; {2319#false} is VALID [2022-02-20 19:15:23,235 INFO L272 TraceCheckUtils]: 21: Hoare triple {2319#false} call activate_threads(); {2366#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:15:23,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {2366#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~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; {2318#true} is VALID [2022-02-20 19:15:23,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#true} assume 1 == ~m_pc~0; {2318#true} is VALID [2022-02-20 19:15:23,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {2318#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2318#true} is VALID [2022-02-20 19:15:23,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {2318#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2318#true} is VALID [2022-02-20 19:15:23,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {2318#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {2318#true} is VALID [2022-02-20 19:15:23,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {2318#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2318#true} is VALID [2022-02-20 19:15:23,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {2318#true} 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; {2318#true} is VALID [2022-02-20 19:15:23,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {2318#true} assume !(1 == ~t1_pc~0); {2318#true} is VALID [2022-02-20 19:15:23,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {2318#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2318#true} is VALID [2022-02-20 19:15:23,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {2318#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2318#true} is VALID [2022-02-20 19:15:23,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {2318#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {2318#true} is VALID [2022-02-20 19:15:23,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {2318#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2318#true} is VALID [2022-02-20 19:15:23,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {2318#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {2318#true} is VALID [2022-02-20 19:15:23,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {2318#true} assume 1 == ~t2_pc~0; {2318#true} is VALID [2022-02-20 19:15:23,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {2318#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2318#true} is VALID [2022-02-20 19:15:23,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {2318#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2318#true} is VALID [2022-02-20 19:15:23,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {2318#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {2318#true} is VALID [2022-02-20 19:15:23,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {2318#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2318#true} is VALID [2022-02-20 19:15:23,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:15:23,251 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2318#true} {2319#false} #10584#return; {2319#false} is VALID [2022-02-20 19:15:23,251 INFO L272 TraceCheckUtils]: 42: Hoare triple {2319#false} call reset_delta_events(); {2364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:15:23,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {2364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {2318#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {2318#true} assume !(1 == ~T2_E~0); {2318#true} is VALID [2022-02-20 19:15:23,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {2318#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {2318#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {2318#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2318#true} is VALID [2022-02-20 19:15:23,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:15:23,252 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2318#true} {2319#false} #10586#return; {2319#false} is VALID [2022-02-20 19:15:23,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:15:23,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {2319#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {2319#false} is VALID [2022-02-20 19:15:23,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:15:23,253 INFO L272 TraceCheckUtils]: 54: Hoare triple {2319#false} call eval_#t~ret28#1 := exists_runnable_thread(); {2318#true} is VALID [2022-02-20 19:15:23,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {2318#true} havoc ~__retres1~3; {2318#true} is VALID [2022-02-20 19:15:23,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {2318#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2318#true} is VALID [2022-02-20 19:15:23,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {2318#true} #res := ~__retres1~3; {2318#true} is VALID [2022-02-20 19:15:23,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:15:23,254 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2318#true} {2319#false} #10588#return; {2319#false} is VALID [2022-02-20 19:15:23,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {2319#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {2319#false} is VALID [2022-02-20 19:15:23,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {2319#false} assume 0 != eval_~tmp~0#1; {2319#false} is VALID [2022-02-20 19:15:23,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {2319#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {2319#false} is VALID [2022-02-20 19:15:23,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {2319#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {2319#false} is VALID [2022-02-20 19:15:23,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {2319#false} assume !(0 == ~m_pc~0); {2319#false} is VALID [2022-02-20 19:15:23,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {2319#false} assume 1 == ~m_pc~0; {2319#false} is VALID [2022-02-20 19:15:23,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {2319#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error } true; {2319#false} is VALID [2022-02-20 19:15:23,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:15:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:15:23,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:15:23,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885491171] [2022-02-20 19:15:23,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885491171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:15:23,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:15:23,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:15:23,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109626713] [2022-02-20 19:15:23,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:15:23,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:15:23,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:15:23,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:23,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:15:23,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:15:23,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:15:23,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:15:23,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:15:23,358 INFO L87 Difference]: Start difference. First operand has 2315 states, 2290 states have (on average 1.8572052401746726) internal successors, (4253), 2293 states have internal predecessors, (4253), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:15:34,589 INFO L93 Difference]: Finished difference Result 4802 states and 8845 transitions. [2022-02-20 19:15:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:15:34,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:15:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:15:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8845 transitions. [2022-02-20 19:15:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8845 transitions. [2022-02-20 19:15:34,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 8845 transitions. [2022-02-20 19:15:39,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8845 edges. 8845 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:15:40,382 INFO L225 Difference]: With dead ends: 4802 [2022-02-20 19:15:40,383 INFO L226 Difference]: Without dead ends: 2427 [2022-02-20 19:15:40,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:15:40,396 INFO L933 BasicCegarLoop]: 4248 mSDtfsCounter, 4428 mSDsluCounter, 12428 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 16676 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:15:40,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4437 Valid, 16676 Invalid, 642 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:15:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2022-02-20 19:15:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2364. [2022-02-20 19:15:40,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:15:40,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2427 states. Second operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:15:40,535 INFO L74 IsIncluded]: Start isIncluded. First operand 2427 states. Second operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:15:40,542 INFO L87 Difference]: Start difference. First operand 2427 states. Second operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:15:40,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:15:40,748 INFO L93 Difference]: Finished difference Result 2427 states and 4414 transitions. [2022-02-20 19:15:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4414 transitions. [2022-02-20 19:15:40,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:15:40,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:15:40,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) Second operand 2427 states. [2022-02-20 19:15:40,774 INFO L87 Difference]: Start difference. First operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) Second operand 2427 states. [2022-02-20 19:15:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:15:40,972 INFO L93 Difference]: Finished difference Result 2427 states and 4414 transitions. [2022-02-20 19:15:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4414 transitions. [2022-02-20 19:15:40,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:15:40,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:15:40,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:15:40,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:15:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:15:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 4314 transitions. [2022-02-20 19:15:41,288 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 4314 transitions. Word has length 68 [2022-02-20 19:15:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:15:41,288 INFO L470 AbstractCegarLoop]: Abstraction has 2364 states and 4314 transitions. [2022-02-20 19:15:41,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 4314 transitions. [2022-02-20 19:15:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:15:41,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:15:41,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:15:41,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:15:41,292 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:15:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:15:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1597321137, now seen corresponding path program 1 times [2022-02-20 19:15:41,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:15:41,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096836482] [2022-02-20 19:15:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:15:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:15:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:15:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:41,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:15:41,372 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {14657#true} {14659#(= ~T1_E~0 ~M_E~0)} #10580#return; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:15:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:41,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {14703#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {14704#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:15:41,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {14704#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,422 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14659#(= ~T1_E~0 ~M_E~0)} #10582#return; {14658#false} is VALID [2022-02-20 19:15:41,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:15:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:41,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {14706#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~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; {14657#true} is VALID [2022-02-20 19:15:41,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 1 == ~m_pc~0; {14657#true} is VALID [2022-02-20 19:15:41,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14657#true} is VALID [2022-02-20 19:15:41,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {14657#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14657#true} is VALID [2022-02-20 19:15:41,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {14657#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {14657#true} is VALID [2022-02-20 19:15:41,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {14657#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14657#true} is VALID [2022-02-20 19:15:41,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {14657#true} 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; {14657#true} is VALID [2022-02-20 19:15:41,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {14657#true} assume !(1 == ~t1_pc~0); {14657#true} is VALID [2022-02-20 19:15:41,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {14657#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14657#true} is VALID [2022-02-20 19:15:41,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {14657#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14657#true} is VALID [2022-02-20 19:15:41,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {14657#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {14657#true} is VALID [2022-02-20 19:15:41,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {14657#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14657#true} is VALID [2022-02-20 19:15:41,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {14657#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {14657#true} is VALID [2022-02-20 19:15:41,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {14657#true} assume 1 == ~t2_pc~0; {14657#true} is VALID [2022-02-20 19:15:41,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {14657#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {14657#true} is VALID [2022-02-20 19:15:41,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {14657#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {14657#true} is VALID [2022-02-20 19:15:41,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {14657#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {14657#true} is VALID [2022-02-20 19:15:41,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {14657#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {14657#true} is VALID [2022-02-20 19:15:41,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:15:41,450 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14657#true} {14658#false} #10584#return; {14658#false} is VALID [2022-02-20 19:15:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:15:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:41,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {14703#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {14657#true} is VALID [2022-02-20 19:15:41,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14657#true} is VALID [2022-02-20 19:15:41,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} assume !(1 == ~T2_E~0); {14657#true} is VALID [2022-02-20 19:15:41,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {14657#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14657#true} is VALID [2022-02-20 19:15:41,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {14657#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14657#true} is VALID [2022-02-20 19:15:41,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {14657#true} assume 1 == ~E_2~0;~E_2~0 := 2; {14657#true} is VALID [2022-02-20 19:15:41,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:15:41,460 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14657#true} {14658#false} #10586#return; {14658#false} is VALID [2022-02-20 19:15:41,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:15:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:41,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#true} havoc ~__retres1~3; {14657#true} is VALID [2022-02-20 19:15:41,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14657#true} is VALID [2022-02-20 19:15:41,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} #res := ~__retres1~3; {14657#true} is VALID [2022-02-20 19:15:41,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:15:41,465 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14657#true} {14658#false} #10588#return; {14658#false} is VALID [2022-02-20 19:15:41,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#true} 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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~4#1;havoc main2_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#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; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} call update_channels(); {14657#true} is VALID [2022-02-20 19:15:41,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:15:41,468 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14657#true} {14659#(= ~T1_E~0 ~M_E~0)} #10580#return; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:41,470 INFO L272 TraceCheckUtils]: 12: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} call fire_delta_events(); {14703#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:15:41,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {14703#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {14704#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:15:41,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {14704#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:41,473 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14659#(= ~T1_E~0 ~M_E~0)} #10582#return; {14658#false} is VALID [2022-02-20 19:15:41,474 INFO L272 TraceCheckUtils]: 21: Hoare triple {14658#false} call activate_threads(); {14706#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:15:41,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {14706#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~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; {14657#true} is VALID [2022-02-20 19:15:41,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {14657#true} assume 1 == ~m_pc~0; {14657#true} is VALID [2022-02-20 19:15:41,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {14657#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14657#true} is VALID [2022-02-20 19:15:41,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {14657#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14657#true} is VALID [2022-02-20 19:15:41,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {14657#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {14657#true} is VALID [2022-02-20 19:15:41,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {14657#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14657#true} is VALID [2022-02-20 19:15:41,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {14657#true} 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; {14657#true} is VALID [2022-02-20 19:15:41,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {14657#true} assume !(1 == ~t1_pc~0); {14657#true} is VALID [2022-02-20 19:15:41,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {14657#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14657#true} is VALID [2022-02-20 19:15:41,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {14657#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14657#true} is VALID [2022-02-20 19:15:41,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {14657#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {14657#true} is VALID [2022-02-20 19:15:41,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {14657#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14657#true} is VALID [2022-02-20 19:15:41,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {14657#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {14657#true} is VALID [2022-02-20 19:15:41,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {14657#true} assume 1 == ~t2_pc~0; {14657#true} is VALID [2022-02-20 19:15:41,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {14657#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {14657#true} is VALID [2022-02-20 19:15:41,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {14657#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {14657#true} is VALID [2022-02-20 19:15:41,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {14657#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {14657#true} is VALID [2022-02-20 19:15:41,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {14657#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {14657#true} is VALID [2022-02-20 19:15:41,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:15:41,478 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14657#true} {14658#false} #10584#return; {14658#false} is VALID [2022-02-20 19:15:41,478 INFO L272 TraceCheckUtils]: 42: Hoare triple {14658#false} call reset_delta_events(); {14703#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:15:41,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {14703#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {14657#true} is VALID [2022-02-20 19:15:41,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {14657#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14657#true} is VALID [2022-02-20 19:15:41,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {14657#true} assume !(1 == ~T2_E~0); {14657#true} is VALID [2022-02-20 19:15:41,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {14657#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14657#true} is VALID [2022-02-20 19:15:41,481 INFO L290 TraceCheckUtils]: 47: Hoare triple {14657#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14657#true} is VALID [2022-02-20 19:15:41,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {14657#true} assume 1 == ~E_2~0;~E_2~0 := 2; {14657#true} is VALID [2022-02-20 19:15:41,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:15:41,482 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14657#true} {14658#false} #10586#return; {14658#false} is VALID [2022-02-20 19:15:41,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:15:41,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {14658#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {14658#false} is VALID [2022-02-20 19:15:41,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:15:41,482 INFO L272 TraceCheckUtils]: 54: Hoare triple {14658#false} call eval_#t~ret28#1 := exists_runnable_thread(); {14657#true} is VALID [2022-02-20 19:15:41,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {14657#true} havoc ~__retres1~3; {14657#true} is VALID [2022-02-20 19:15:41,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {14657#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14657#true} is VALID [2022-02-20 19:15:41,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {14657#true} #res := ~__retres1~3; {14657#true} is VALID [2022-02-20 19:15:41,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:15:41,483 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14657#true} {14658#false} #10588#return; {14658#false} is VALID [2022-02-20 19:15:41,483 INFO L290 TraceCheckUtils]: 60: Hoare triple {14658#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {14658#false} is VALID [2022-02-20 19:15:41,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {14658#false} assume 0 != eval_~tmp~0#1; {14658#false} is VALID [2022-02-20 19:15:41,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {14658#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {14658#false} is VALID [2022-02-20 19:15:41,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {14658#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {14658#false} is VALID [2022-02-20 19:15:41,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {14658#false} assume !(0 == ~m_pc~0); {14658#false} is VALID [2022-02-20 19:15:41,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {14658#false} assume 1 == ~m_pc~0; {14658#false} is VALID [2022-02-20 19:15:41,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {14658#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error } true; {14658#false} is VALID [2022-02-20 19:15:41,484 INFO L290 TraceCheckUtils]: 67: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:15:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:15:41,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:15:41,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096836482] [2022-02-20 19:15:41,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096836482] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:15:41,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:15:41,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:15:41,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325372842] [2022-02-20 19:15:41,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:15:41,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:15:41,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:15:41,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:41,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:15:41,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:15:41,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:15:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:15:41,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:15:41,546 INFO L87 Difference]: Start difference. First operand 2364 states and 4314 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:15:52,742 INFO L93 Difference]: Finished difference Result 2807 states and 4974 transitions. [2022-02-20 19:15:52,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:15:52,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:15:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:15:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4590 transitions. [2022-02-20 19:15:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4590 transitions. [2022-02-20 19:15:52,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4590 transitions. [2022-02-20 19:15:55,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4590 edges. 4590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:15:55,816 INFO L225 Difference]: With dead ends: 2807 [2022-02-20 19:15:55,816 INFO L226 Difference]: Without dead ends: 2574 [2022-02-20 19:15:55,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:15:55,824 INFO L933 BasicCegarLoop]: 4246 mSDtfsCounter, 4351 mSDsluCounter, 16427 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4360 SdHoareTripleChecker+Valid, 20673 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:15:55,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4360 Valid, 20673 Invalid, 914 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:15:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-02-20 19:15:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2473. [2022-02-20 19:15:55,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:15:55,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2574 states. Second operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:15:55,905 INFO L74 IsIncluded]: Start isIncluded. First operand 2574 states. Second operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:15:55,910 INFO L87 Difference]: Start difference. First operand 2574 states. Second operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:15:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:15:56,119 INFO L93 Difference]: Finished difference Result 2574 states and 4630 transitions. [2022-02-20 19:15:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4630 transitions. [2022-02-20 19:15:56,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:15:56,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:15:56,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 2574 states. [2022-02-20 19:15:56,133 INFO L87 Difference]: Start difference. First operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 2574 states. [2022-02-20 19:15:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:15:56,336 INFO L93 Difference]: Finished difference Result 2574 states and 4630 transitions. [2022-02-20 19:15:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4630 transitions. [2022-02-20 19:15:56,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:15:56,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:15:56,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:15:56,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:15:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:15:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 4470 transitions. [2022-02-20 19:15:56,537 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 4470 transitions. Word has length 68 [2022-02-20 19:15:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:15:56,538 INFO L470 AbstractCegarLoop]: Abstraction has 2473 states and 4470 transitions. [2022-02-20 19:15:56,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 4470 transitions. [2022-02-20 19:15:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:15:56,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:15:56,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:15:56,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:15:56,541 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:15:56,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:15:56,541 INFO L85 PathProgramCache]: Analyzing trace with hash -721302131, now seen corresponding path program 1 times [2022-02-20 19:15:56,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:15:56,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648073540] [2022-02-20 19:15:56,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:15:56,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:15:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:15:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:56,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:15:56,603 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {25512#true} {25514#(= ~T2_E~0 ~M_E~0)} #10580#return; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:15:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:56,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {25558#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:15:56,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:15:56,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,642 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {25514#(= ~T2_E~0 ~M_E~0)} #10582#return; {25513#false} is VALID [2022-02-20 19:15:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:15:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:56,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {25561#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~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; {25512#true} is VALID [2022-02-20 19:15:56,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 1 == ~m_pc~0; {25512#true} is VALID [2022-02-20 19:15:56,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {25512#true} is VALID [2022-02-20 19:15:56,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {25512#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {25512#true} is VALID [2022-02-20 19:15:56,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {25512#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {25512#true} is VALID [2022-02-20 19:15:56,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {25512#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {25512#true} is VALID [2022-02-20 19:15:56,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {25512#true} 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; {25512#true} is VALID [2022-02-20 19:15:56,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {25512#true} assume !(1 == ~t1_pc~0); {25512#true} is VALID [2022-02-20 19:15:56,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {25512#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25512#true} is VALID [2022-02-20 19:15:56,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {25512#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {25512#true} is VALID [2022-02-20 19:15:56,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {25512#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {25512#true} is VALID [2022-02-20 19:15:56,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {25512#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {25512#true} is VALID [2022-02-20 19:15:56,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {25512#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {25512#true} is VALID [2022-02-20 19:15:56,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {25512#true} assume 1 == ~t2_pc~0; {25512#true} is VALID [2022-02-20 19:15:56,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {25512#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {25512#true} is VALID [2022-02-20 19:15:56,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {25512#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {25512#true} is VALID [2022-02-20 19:15:56,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {25512#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {25512#true} is VALID [2022-02-20 19:15:56,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {25512#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {25512#true} is VALID [2022-02-20 19:15:56,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:15:56,676 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {25512#true} {25513#false} #10584#return; {25513#false} is VALID [2022-02-20 19:15:56,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:15:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:56,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {25558#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {25512#true} is VALID [2022-02-20 19:15:56,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {25512#true} is VALID [2022-02-20 19:15:56,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} assume !(1 == ~T2_E~0); {25512#true} is VALID [2022-02-20 19:15:56,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {25512#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25512#true} is VALID [2022-02-20 19:15:56,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {25512#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25512#true} is VALID [2022-02-20 19:15:56,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {25512#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25512#true} is VALID [2022-02-20 19:15:56,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:15:56,689 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25512#true} {25513#false} #10586#return; {25513#false} is VALID [2022-02-20 19:15:56,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:15:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:15:56,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#true} havoc ~__retres1~3; {25512#true} is VALID [2022-02-20 19:15:56,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25512#true} is VALID [2022-02-20 19:15:56,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} #res := ~__retres1~3; {25512#true} is VALID [2022-02-20 19:15:56,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:15:56,695 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25512#true} {25513#false} #10588#return; {25513#false} is VALID [2022-02-20 19:15:56,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#true} 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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~4#1;havoc main2_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#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; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} call update_channels(); {25512#true} is VALID [2022-02-20 19:15:56,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:15:56,698 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {25512#true} {25514#(= ~T2_E~0 ~M_E~0)} #10580#return; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:15:56,701 INFO L272 TraceCheckUtils]: 12: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} call fire_delta_events(); {25558#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:15:56,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {25558#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:15:56,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:15:56,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:15:56,707 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {25514#(= ~T2_E~0 ~M_E~0)} #10582#return; {25513#false} is VALID [2022-02-20 19:15:56,707 INFO L272 TraceCheckUtils]: 21: Hoare triple {25513#false} call activate_threads(); {25561#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:15:56,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {25561#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~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; {25512#true} is VALID [2022-02-20 19:15:56,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {25512#true} assume 1 == ~m_pc~0; {25512#true} is VALID [2022-02-20 19:15:56,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {25512#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {25512#true} is VALID [2022-02-20 19:15:56,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {25512#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {25512#true} is VALID [2022-02-20 19:15:56,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {25512#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {25512#true} is VALID [2022-02-20 19:15:56,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {25512#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {25512#true} is VALID [2022-02-20 19:15:56,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {25512#true} 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; {25512#true} is VALID [2022-02-20 19:15:56,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {25512#true} assume !(1 == ~t1_pc~0); {25512#true} is VALID [2022-02-20 19:15:56,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {25512#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25512#true} is VALID [2022-02-20 19:15:56,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {25512#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {25512#true} is VALID [2022-02-20 19:15:56,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {25512#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {25512#true} is VALID [2022-02-20 19:15:56,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {25512#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {25512#true} is VALID [2022-02-20 19:15:56,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {25512#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {25512#true} is VALID [2022-02-20 19:15:56,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {25512#true} assume 1 == ~t2_pc~0; {25512#true} is VALID [2022-02-20 19:15:56,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {25512#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {25512#true} is VALID [2022-02-20 19:15:56,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {25512#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {25512#true} is VALID [2022-02-20 19:15:56,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {25512#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {25512#true} is VALID [2022-02-20 19:15:56,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {25512#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {25512#true} is VALID [2022-02-20 19:15:56,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:15:56,712 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25512#true} {25513#false} #10584#return; {25513#false} is VALID [2022-02-20 19:15:56,713 INFO L272 TraceCheckUtils]: 42: Hoare triple {25513#false} call reset_delta_events(); {25558#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:15:56,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {25558#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {25512#true} is VALID [2022-02-20 19:15:56,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {25512#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {25512#true} is VALID [2022-02-20 19:15:56,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {25512#true} assume !(1 == ~T2_E~0); {25512#true} is VALID [2022-02-20 19:15:56,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {25512#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25512#true} is VALID [2022-02-20 19:15:56,713 INFO L290 TraceCheckUtils]: 47: Hoare triple {25512#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25512#true} is VALID [2022-02-20 19:15:56,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {25512#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25512#true} is VALID [2022-02-20 19:15:56,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:15:56,714 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25512#true} {25513#false} #10586#return; {25513#false} is VALID [2022-02-20 19:15:56,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:15:56,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {25513#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {25513#false} is VALID [2022-02-20 19:15:56,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:15:56,714 INFO L272 TraceCheckUtils]: 54: Hoare triple {25513#false} call eval_#t~ret28#1 := exists_runnable_thread(); {25512#true} is VALID [2022-02-20 19:15:56,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {25512#true} havoc ~__retres1~3; {25512#true} is VALID [2022-02-20 19:15:56,715 INFO L290 TraceCheckUtils]: 56: Hoare triple {25512#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25512#true} is VALID [2022-02-20 19:15:56,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {25512#true} #res := ~__retres1~3; {25512#true} is VALID [2022-02-20 19:15:56,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:15:56,715 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25512#true} {25513#false} #10588#return; {25513#false} is VALID [2022-02-20 19:15:56,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {25513#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {25513#false} is VALID [2022-02-20 19:15:56,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {25513#false} assume 0 != eval_~tmp~0#1; {25513#false} is VALID [2022-02-20 19:15:56,716 INFO L290 TraceCheckUtils]: 62: Hoare triple {25513#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {25513#false} is VALID [2022-02-20 19:15:56,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {25513#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {25513#false} is VALID [2022-02-20 19:15:56,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {25513#false} assume !(0 == ~m_pc~0); {25513#false} is VALID [2022-02-20 19:15:56,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {25513#false} assume 1 == ~m_pc~0; {25513#false} is VALID [2022-02-20 19:15:56,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {25513#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error } true; {25513#false} is VALID [2022-02-20 19:15:56,716 INFO L290 TraceCheckUtils]: 67: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:15:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:15:56,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:15:56,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648073540] [2022-02-20 19:15:56,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648073540] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:15:56,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:15:56,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:15:56,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235673948] [2022-02-20 19:15:56,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:15:56,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:15:56,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:15:56,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:15:56,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:15:56,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:15:56,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:15:56,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:15:56,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:15:56,756 INFO L87 Difference]: Start difference. First operand 2473 states and 4470 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:16:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:16:06,627 INFO L93 Difference]: Finished difference Result 3193 states and 5538 transitions. [2022-02-20 19:16:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:16:06,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:16:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:16:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:16:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4595 transitions. [2022-02-20 19:16:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:16:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4595 transitions. [2022-02-20 19:16:06,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4595 transitions. [2022-02-20 19:16:09,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4595 edges. 4595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:16:10,290 INFO L225 Difference]: With dead ends: 3193 [2022-02-20 19:16:10,290 INFO L226 Difference]: Without dead ends: 2851 [2022-02-20 19:16:10,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:16:10,297 INFO L933 BasicCegarLoop]: 4169 mSDtfsCounter, 4383 mSDsluCounter, 16249 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4392 SdHoareTripleChecker+Valid, 20418 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:16:10,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4392 Valid, 20418 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:16:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2022-02-20 19:16:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2692. [2022-02-20 19:16:10,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:16:10,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2851 states. Second operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:16:10,408 INFO L74 IsIncluded]: Start isIncluded. First operand 2851 states. Second operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:16:10,410 INFO L87 Difference]: Start difference. First operand 2851 states. Second operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:16:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:16:10,627 INFO L93 Difference]: Finished difference Result 2851 states and 5035 transitions. [2022-02-20 19:16:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5035 transitions. [2022-02-20 19:16:10,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:16:10,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:16:10,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) Second operand 2851 states. [2022-02-20 19:16:10,639 INFO L87 Difference]: Start difference. First operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) Second operand 2851 states. [2022-02-20 19:16:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:16:10,852 INFO L93 Difference]: Finished difference Result 2851 states and 5035 transitions. [2022-02-20 19:16:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5035 transitions. [2022-02-20 19:16:10,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:16:10,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:16:10,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:16:10,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:16:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:16:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4787 transitions. [2022-02-20 19:16:11,076 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4787 transitions. Word has length 68 [2022-02-20 19:16:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:16:11,076 INFO L470 AbstractCegarLoop]: Abstraction has 2692 states and 4787 transitions. [2022-02-20 19:16:11,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:16:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4787 transitions. [2022-02-20 19:16:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:16:11,079 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:16:11,079 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:16:11,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:16:11,079 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:16:11,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:16:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash -277401457, now seen corresponding path program 1 times [2022-02-20 19:16:11,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:16:11,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187472861] [2022-02-20 19:16:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:16:11,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:16:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:16:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:16:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:16:11,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:16:11,126 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {37719#true} {37721#(= ~E_1~0 ~M_E~0)} #10580#return; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:16:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:16:11,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {37765#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:16:11,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:16:11,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:16:11,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:16:11,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:16:11,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:16:11,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:16:11,163 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {37721#(= ~E_1~0 ~M_E~0)} #10582#return; {37720#false} is VALID [2022-02-20 19:16:11,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:16:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:16:11,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {37768#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~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; {37719#true} is VALID [2022-02-20 19:16:11,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {37719#true} assume 1 == ~m_pc~0; {37719#true} is VALID [2022-02-20 19:16:11,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {37719#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {37719#true} is VALID [2022-02-20 19:16:11,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {37719#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {37719#true} is VALID [2022-02-20 19:16:11,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {37719#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {37719#true} is VALID [2022-02-20 19:16:11,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {37719#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {37719#true} is VALID [2022-02-20 19:16:11,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {37719#true} 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; {37719#true} is VALID [2022-02-20 19:16:11,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {37719#true} assume !(1 == ~t1_pc~0); {37719#true} is VALID [2022-02-20 19:16:11,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {37719#true} is_transmit1_triggered_~__retres1~1#1 := 0; {37719#true} is VALID [2022-02-20 19:16:11,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {37719#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {37719#true} is VALID [2022-02-20 19:16:11,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {37719#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {37719#true} is VALID [2022-02-20 19:16:11,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {37719#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {37719#true} is VALID [2022-02-20 19:16:11,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {37719#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {37719#true} is VALID [2022-02-20 19:16:11,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {37719#true} assume 1 == ~t2_pc~0; {37719#true} is VALID [2022-02-20 19:16:11,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {37719#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {37719#true} is VALID [2022-02-20 19:16:11,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {37719#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {37719#true} is VALID [2022-02-20 19:16:11,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {37719#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {37719#true} is VALID [2022-02-20 19:16:11,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {37719#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {37719#true} is VALID [2022-02-20 19:16:11,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:16:11,180 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {37719#true} {37720#false} #10584#return; {37720#false} is VALID [2022-02-20 19:16:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:16:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:16:11,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {37765#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {37719#true} is VALID [2022-02-20 19:16:11,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {37719#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37719#true} is VALID [2022-02-20 19:16:11,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {37719#true} assume !(1 == ~T2_E~0); {37719#true} is VALID [2022-02-20 19:16:11,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {37719#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37719#true} is VALID [2022-02-20 19:16:11,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {37719#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37719#true} is VALID [2022-02-20 19:16:11,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {37719#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37719#true} is VALID [2022-02-20 19:16:11,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:16:11,187 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37719#true} {37720#false} #10586#return; {37720#false} is VALID [2022-02-20 19:16:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:16:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:16:11,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {37719#true} havoc ~__retres1~3; {37719#true} is VALID [2022-02-20 19:16:11,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {37719#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {37719#true} is VALID [2022-02-20 19:16:11,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {37719#true} #res := ~__retres1~3; {37719#true} is VALID [2022-02-20 19:16:11,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:16:11,193 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37719#true} {37720#false} #10588#return; {37720#false} is VALID [2022-02-20 19:16:11,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {37719#true} 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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~4#1;havoc main2_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#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; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} call update_channels(); {37719#true} is VALID [2022-02-20 19:16:11,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:16:11,196 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37719#true} {37721#(= ~E_1~0 ~M_E~0)} #10580#return; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads } true; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:16:11,199 INFO L272 TraceCheckUtils]: 12: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} call fire_delta_events(); {37765#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:16:11,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {37765#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:16:11,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:16:11,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:16:11,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:16:11,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:16:11,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:16:11,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:16:11,202 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {37721#(= ~E_1~0 ~M_E~0)} #10582#return; {37720#false} is VALID [2022-02-20 19:16:11,202 INFO L272 TraceCheckUtils]: 21: Hoare triple {37720#false} call activate_threads(); {37768#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:16:11,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {37768#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~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; {37719#true} is VALID [2022-02-20 19:16:11,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {37719#true} assume 1 == ~m_pc~0; {37719#true} is VALID [2022-02-20 19:16:11,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {37719#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {37719#true} is VALID [2022-02-20 19:16:11,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {37719#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {37719#true} is VALID [2022-02-20 19:16:11,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {37719#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {37719#true} is VALID [2022-02-20 19:16:11,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {37719#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {37719#true} is VALID [2022-02-20 19:16:11,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {37719#true} 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; {37719#true} is VALID [2022-02-20 19:16:11,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {37719#true} assume !(1 == ~t1_pc~0); {37719#true} is VALID [2022-02-20 19:16:11,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {37719#true} is_transmit1_triggered_~__retres1~1#1 := 0; {37719#true} is VALID [2022-02-20 19:16:11,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {37719#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {37719#true} is VALID [2022-02-20 19:16:11,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {37719#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {37719#true} is VALID [2022-02-20 19:16:11,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {37719#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {37719#true} is VALID [2022-02-20 19:16:11,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {37719#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {37719#true} is VALID [2022-02-20 19:16:11,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {37719#true} assume 1 == ~t2_pc~0; {37719#true} is VALID [2022-02-20 19:16:11,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {37719#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {37719#true} is VALID [2022-02-20 19:16:11,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {37719#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {37719#true} is VALID [2022-02-20 19:16:11,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {37719#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {37719#true} is VALID [2022-02-20 19:16:11,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {37719#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {37719#true} is VALID [2022-02-20 19:16:11,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:16:11,205 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37719#true} {37720#false} #10584#return; {37720#false} is VALID [2022-02-20 19:16:11,205 INFO L272 TraceCheckUtils]: 42: Hoare triple {37720#false} call reset_delta_events(); {37765#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:16:11,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {37765#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {37719#true} is VALID [2022-02-20 19:16:11,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {37719#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37719#true} is VALID [2022-02-20 19:16:11,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {37719#true} assume !(1 == ~T2_E~0); {37719#true} is VALID [2022-02-20 19:16:11,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {37719#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37719#true} is VALID [2022-02-20 19:16:11,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {37719#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37719#true} is VALID [2022-02-20 19:16:11,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {37719#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37719#true} is VALID [2022-02-20 19:16:11,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:16:11,206 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37719#true} {37720#false} #10586#return; {37720#false} is VALID [2022-02-20 19:16:11,206 INFO L290 TraceCheckUtils]: 51: Hoare triple {37720#false} assume !false; {37720#false} is VALID [2022-02-20 19:16:11,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {37720#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {37720#false} is VALID [2022-02-20 19:16:11,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {37720#false} assume !false; {37720#false} is VALID [2022-02-20 19:16:11,206 INFO L272 TraceCheckUtils]: 54: Hoare triple {37720#false} call eval_#t~ret28#1 := exists_runnable_thread(); {37719#true} is VALID [2022-02-20 19:16:11,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {37719#true} havoc ~__retres1~3; {37719#true} is VALID [2022-02-20 19:16:11,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {37719#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {37719#true} is VALID [2022-02-20 19:16:11,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {37719#true} #res := ~__retres1~3; {37719#true} is VALID [2022-02-20 19:16:11,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:16:11,207 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {37719#true} {37720#false} #10588#return; {37720#false} is VALID [2022-02-20 19:16:11,207 INFO L290 TraceCheckUtils]: 60: Hoare triple {37720#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {37720#false} is VALID [2022-02-20 19:16:11,207 INFO L290 TraceCheckUtils]: 61: Hoare triple {37720#false} assume 0 != eval_~tmp~0#1; {37720#false} is VALID [2022-02-20 19:16:11,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {37720#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {37720#false} is VALID [2022-02-20 19:16:11,208 INFO L290 TraceCheckUtils]: 63: Hoare triple {37720#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {37720#false} is VALID [2022-02-20 19:16:11,208 INFO L290 TraceCheckUtils]: 64: Hoare triple {37720#false} assume !(0 == ~m_pc~0); {37720#false} is VALID [2022-02-20 19:16:11,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {37720#false} assume 1 == ~m_pc~0; {37720#false} is VALID [2022-02-20 19:16:11,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {37720#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error } true; {37720#false} is VALID [2022-02-20 19:16:11,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {37720#false} assume !false; {37720#false} is VALID [2022-02-20 19:16:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:16:11,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:16:11,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187472861] [2022-02-20 19:16:11,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187472861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:16:11,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:16:11,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:16:11,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326607156] [2022-02-20 19:16:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:16:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:16:11,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:16:11,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:16:11,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:16:11,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:16:11,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:16:11,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:16:11,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:16:11,244 INFO L87 Difference]: Start difference. First operand 2692 states and 4787 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)