./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.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/pc_sfifo_3.cil+token_ring.03.cil-2.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 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:29,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:29,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:29,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:29,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:29,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:29,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:29,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:29,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:29,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:29,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:29,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:29,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:29,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:29,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:29,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:29,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:29,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:29,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:29,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:29,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:29,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:29,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:29,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:29,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:29,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:29,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:29,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:29,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:29,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:29,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:29,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:29,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:29,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:29,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:29,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:29,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:29,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:29,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:29,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:29,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:29,858 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:59:29,882 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:29,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:29,883 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:29,883 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:29,884 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:29,884 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:29,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:29,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:29,885 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:29,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:29,885 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:29,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:29,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:29,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:29,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:29,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:29,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:29,886 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:29,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:29,887 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:29,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:29,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:29,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:29,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:29,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:29,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:29,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:29,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:29,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:29,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:29,888 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:29,889 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:29,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:29,889 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 -> 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 [2022-02-20 19:59:30,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:30,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:30,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:30,067 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:30,068 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:30,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2022-02-20 19:59:30,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10ce807b/f8631f28d4db455a95bde2908efd02d9/FLAG45f0128f0 [2022-02-20 19:59:30,492 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:30,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2022-02-20 19:59:30,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10ce807b/f8631f28d4db455a95bde2908efd02d9/FLAG45f0128f0 [2022-02-20 19:59:30,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10ce807b/f8631f28d4db455a95bde2908efd02d9 [2022-02-20 19:59:30,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:30,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:30,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:30,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:30,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:30,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:30" (1/1) ... [2022-02-20 19:59:30,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2104ae9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:30, skipping insertion in model container [2022-02-20 19:59:30,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:30" (1/1) ... [2022-02-20 19:59:30,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:30,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:31,051 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/pc_sfifo_3.cil+token_ring.03.cil-2.c[911,924] [2022-02-20 19:59:31,097 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/pc_sfifo_3.cil+token_ring.03.cil-2.c[8416,8429] [2022-02-20 19:59:31,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:31,162 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:31,169 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/pc_sfifo_3.cil+token_ring.03.cil-2.c[911,924] [2022-02-20 19:59:31,188 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/pc_sfifo_3.cil+token_ring.03.cil-2.c[8416,8429] [2022-02-20 19:59:31,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:31,226 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:31,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31 WrapperNode [2022-02-20 19:59:31,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:31,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:31,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:31,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:31,233 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:59:31" (1/1) ... [2022-02-20 19:59:31,241 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:59:31" (1/1) ... [2022-02-20 19:59:31,290 INFO L137 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 556 [2022-02-20 19:59:31,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:31,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:31,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:31,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:31,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31" (1/1) ... [2022-02-20 19:59:31,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31" (1/1) ... [2022-02-20 19:59:31,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31" (1/1) ... [2022-02-20 19:59:31,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31" (1/1) ... [2022-02-20 19:59:31,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31" (1/1) ... [2022-02-20 19:59:31,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31" (1/1) ... [2022-02-20 19:59:31,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31" (1/1) ... [2022-02-20 19:59:31,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:31,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:31,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:31,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:31,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31" (1/1) ... [2022-02-20 19:59:31,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:31,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:31,376 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:59:31,384 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:59:31,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:31,411 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:31,411 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:31,412 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:31,412 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:31,412 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:31,414 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:31,414 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:31,414 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:31,414 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:31,414 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:31,414 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:31,414 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:31,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:31,414 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:31,415 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:31,415 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:31,415 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:31,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:31,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:31,415 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:31,415 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:31,527 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:31,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:32,010 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:32,011 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 19:59:32,044 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:32,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:32,054 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 19:59:32,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:32 BoogieIcfgContainer [2022-02-20 19:59:32,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:32,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:32,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:32,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:32,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:30" (1/3) ... [2022-02-20 19:59:32,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b99654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:32, skipping insertion in model container [2022-02-20 19:59:32,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:31" (2/3) ... [2022-02-20 19:59:32,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b99654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:32, skipping insertion in model container [2022-02-20 19:59:32,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:32" (3/3) ... [2022-02-20 19:59:32,062 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-2.c [2022-02-20 19:59:32,065 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:32,065 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:32,106 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:32,112 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:59:32,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 224 states have (on average 1.5714285714285714) internal successors, (352), 230 states have internal predecessors, (352), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:32,148 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:32,148 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] [2022-02-20 19:59:32,149 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:32,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:32,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1569523181, now seen corresponding path program 1 times [2022-02-20 19:59:32,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:32,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610931791] [2022-02-20 19:59:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:32,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {317#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {318#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {318#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {318#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {279#(= ~q_read_ev~0 2)} #937#return; {279#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {320#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:32,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {320#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:32,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#(= |old(~q_read_ev~0)| 0)} assume true; {320#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:32,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {320#(= |old(~q_read_ev~0)| 0)} {279#(= ~q_read_ev~0 2)} #939#return; {278#false} is VALID [2022-02-20 19:59:32,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#true} havoc ~__retres1~0; {277#true} is VALID [2022-02-20 19:59:32,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume 1 == ~p_dw_pc~0; {277#true} is VALID [2022-02-20 19:59:32,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {277#true} is VALID [2022-02-20 19:59:32,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#true} #res := ~__retres1~0; {277#true} is VALID [2022-02-20 19:59:32,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,415 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {277#true} {277#true} #933#return; {277#true} is VALID [2022-02-20 19:59:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#true} havoc ~__retres1~1; {277#true} is VALID [2022-02-20 19:59:32,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume 1 == ~c_dr_pc~0; {277#true} is VALID [2022-02-20 19:59:32,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {277#true} is VALID [2022-02-20 19:59:32,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#true} #res := ~__retres1~1; {277#true} is VALID [2022-02-20 19:59:32,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,422 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {277#true} {277#true} #935#return; {277#true} is VALID [2022-02-20 19:59:32,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {321#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {277#true} is VALID [2022-02-20 19:59:32,422 INFO L272 TraceCheckUtils]: 1: Hoare triple {277#true} call #t~ret8 := is_do_write_p_triggered(); {277#true} is VALID [2022-02-20 19:59:32,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} havoc ~__retres1~0; {277#true} is VALID [2022-02-20 19:59:32,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#true} assume 1 == ~p_dw_pc~0; {277#true} is VALID [2022-02-20 19:59:32,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {277#true} is VALID [2022-02-20 19:59:32,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#true} #res := ~__retres1~0; {277#true} is VALID [2022-02-20 19:59:32,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,424 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {277#true} {277#true} #933#return; {277#true} is VALID [2022-02-20 19:59:32,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {277#true} is VALID [2022-02-20 19:59:32,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {277#true} is VALID [2022-02-20 19:59:32,425 INFO L272 TraceCheckUtils]: 10: Hoare triple {277#true} call #t~ret9 := is_do_read_c_triggered(); {277#true} is VALID [2022-02-20 19:59:32,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#true} havoc ~__retres1~1; {277#true} is VALID [2022-02-20 19:59:32,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#true} assume 1 == ~c_dr_pc~0; {277#true} is VALID [2022-02-20 19:59:32,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {277#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {277#true} is VALID [2022-02-20 19:59:32,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {277#true} #res := ~__retres1~1; {277#true} is VALID [2022-02-20 19:59:32,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,426 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {277#true} {277#true} #935#return; {277#true} is VALID [2022-02-20 19:59:32,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {277#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {277#true} is VALID [2022-02-20 19:59:32,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {277#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {277#true} is VALID [2022-02-20 19:59:32,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,428 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {277#true} {278#false} #941#return; {278#false} is VALID [2022-02-20 19:59:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {277#true} is VALID [2022-02-20 19:59:32,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {277#true} is VALID [2022-02-20 19:59:32,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277#true} {278#false} #943#return; {278#false} is VALID [2022-02-20 19:59:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:32,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#true} havoc ~__retres1~2; {277#true} is VALID [2022-02-20 19:59:32,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {277#true} is VALID [2022-02-20 19:59:32,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} #res := ~__retres1~2; {277#true} is VALID [2022-02-20 19:59:32,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,450 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {277#true} {278#false} #945#return; {278#false} is VALID [2022-02-20 19:59:32,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {277#true} is VALID [2022-02-20 19:59:32,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {277#true} is VALID [2022-02-20 19:59:32,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {279#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:32,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {279#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {279#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:32,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {279#(= ~q_read_ev~0 2)} call update_channels1(); {317#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:32,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {317#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {318#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {318#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {318#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:32,457 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {318#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {279#(= ~q_read_ev~0 2)} #937#return; {279#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:32,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {279#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:32,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {279#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {279#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:32,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {279#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {279#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:32,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {279#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {279#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:32,461 INFO L272 TraceCheckUtils]: 12: Hoare triple {279#(= ~q_read_ev~0 2)} call fire_delta_events1(); {319#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {320#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:32,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {320#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {320#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:32,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {320#(= |old(~q_read_ev~0)| 0)} assume true; {320#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:32,463 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {320#(= |old(~q_read_ev~0)| 0)} {279#(= ~q_read_ev~0 2)} #939#return; {278#false} is VALID [2022-02-20 19:59:32,463 INFO L272 TraceCheckUtils]: 17: Hoare triple {278#false} call activate_threads1(); {321#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:32,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {321#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {277#true} is VALID [2022-02-20 19:59:32,464 INFO L272 TraceCheckUtils]: 19: Hoare triple {277#true} call #t~ret8 := is_do_write_p_triggered(); {277#true} is VALID [2022-02-20 19:59:32,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {277#true} havoc ~__retres1~0; {277#true} is VALID [2022-02-20 19:59:32,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {277#true} assume 1 == ~p_dw_pc~0; {277#true} is VALID [2022-02-20 19:59:32,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {277#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {277#true} is VALID [2022-02-20 19:59:32,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {277#true} #res := ~__retres1~0; {277#true} is VALID [2022-02-20 19:59:32,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,465 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {277#true} {277#true} #933#return; {277#true} is VALID [2022-02-20 19:59:32,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {277#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {277#true} is VALID [2022-02-20 19:59:32,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {277#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {277#true} is VALID [2022-02-20 19:59:32,465 INFO L272 TraceCheckUtils]: 28: Hoare triple {277#true} call #t~ret9 := is_do_read_c_triggered(); {277#true} is VALID [2022-02-20 19:59:32,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {277#true} havoc ~__retres1~1; {277#true} is VALID [2022-02-20 19:59:32,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {277#true} assume 1 == ~c_dr_pc~0; {277#true} is VALID [2022-02-20 19:59:32,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {277#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {277#true} is VALID [2022-02-20 19:59:32,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {277#true} #res := ~__retres1~1; {277#true} is VALID [2022-02-20 19:59:32,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,466 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {277#true} {277#true} #935#return; {277#true} is VALID [2022-02-20 19:59:32,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {277#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {277#true} is VALID [2022-02-20 19:59:32,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {277#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {277#true} is VALID [2022-02-20 19:59:32,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,467 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {277#true} {278#false} #941#return; {278#false} is VALID [2022-02-20 19:59:32,467 INFO L272 TraceCheckUtils]: 39: Hoare triple {278#false} call reset_delta_events1(); {319#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:32,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {319#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {277#true} is VALID [2022-02-20 19:59:32,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {277#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {277#true} is VALID [2022-02-20 19:59:32,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,468 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {277#true} {278#false} #943#return; {278#false} is VALID [2022-02-20 19:59:32,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {278#false} assume !false; {278#false} is VALID [2022-02-20 19:59:32,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {278#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {278#false} is VALID [2022-02-20 19:59:32,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {278#false} assume !false; {278#false} is VALID [2022-02-20 19:59:32,469 INFO L272 TraceCheckUtils]: 47: Hoare triple {278#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {277#true} is VALID [2022-02-20 19:59:32,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {277#true} havoc ~__retres1~2; {277#true} is VALID [2022-02-20 19:59:32,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {277#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {277#true} is VALID [2022-02-20 19:59:32,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {277#true} #res := ~__retres1~2; {277#true} is VALID [2022-02-20 19:59:32,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {277#true} assume true; {277#true} is VALID [2022-02-20 19:59:32,472 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {277#true} {278#false} #945#return; {278#false} is VALID [2022-02-20 19:59:32,472 INFO L290 TraceCheckUtils]: 53: Hoare triple {278#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {278#false} is VALID [2022-02-20 19:59:32,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {278#false} assume 0 != eval1_~tmp___1~0#1; {278#false} is VALID [2022-02-20 19:59:32,472 INFO L290 TraceCheckUtils]: 55: Hoare triple {278#false} assume !(0 == ~p_dw_st~0); {278#false} is VALID [2022-02-20 19:59:32,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {278#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {278#false} is VALID [2022-02-20 19:59:32,473 INFO L290 TraceCheckUtils]: 57: Hoare triple {278#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {278#false} is VALID [2022-02-20 19:59:32,473 INFO L290 TraceCheckUtils]: 58: Hoare triple {278#false} assume !(0 == ~c_dr_pc~0); {278#false} is VALID [2022-02-20 19:59:32,473 INFO L290 TraceCheckUtils]: 59: Hoare triple {278#false} assume 2 == ~c_dr_pc~0; {278#false} is VALID [2022-02-20 19:59:32,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {278#false} do_read_c_~a~0#1 := ~a_t~0; {278#false} is VALID [2022-02-20 19:59:32,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {278#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {278#false} is VALID [2022-02-20 19:59:32,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {278#false} assume !(~p_last_write~0 == ~c_last_read~0); {278#false} is VALID [2022-02-20 19:59:32,474 INFO L272 TraceCheckUtils]: 63: Hoare triple {278#false} call error1(); {278#false} is VALID [2022-02-20 19:59:32,474 INFO L290 TraceCheckUtils]: 64: Hoare triple {278#false} assume !false; {278#false} is VALID [2022-02-20 19:59:32,474 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:59:32,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:32,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610931791] [2022-02-20 19:59:32,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610931791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:32,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:32,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:32,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212297483] [2022-02-20 19:59:32,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:32,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:32,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:32,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:32,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:32,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:32,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:32,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:32,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:32,579 INFO L87 Difference]: Start difference. First operand has 274 states, 224 states have (on average 1.5714285714285714) internal successors, (352), 230 states have internal predecessors, (352), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:35,073 INFO L93 Difference]: Finished difference Result 680 states and 1041 transitions. [2022-02-20 19:59:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:35,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1041 transitions. [2022-02-20 19:59:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1041 transitions. [2022-02-20 19:59:35,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1041 transitions. [2022-02-20 19:59:35,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1041 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:35,812 INFO L225 Difference]: With dead ends: 680 [2022-02-20 19:59:35,812 INFO L226 Difference]: Without dead ends: 415 [2022-02-20 19:59:35,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:35,817 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 549 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:35,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 1493 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-02-20 19:59:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 376. [2022-02-20 19:59:35,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:35,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 376 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 312 states have internal predecessors, (447), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:35,885 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 376 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 312 states have internal predecessors, (447), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:35,886 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 376 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 312 states have internal predecessors, (447), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:35,913 INFO L93 Difference]: Finished difference Result 415 states and 598 transitions. [2022-02-20 19:59:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 598 transitions. [2022-02-20 19:59:35,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:35,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:35,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 312 states have internal predecessors, (447), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 415 states. [2022-02-20 19:59:35,924 INFO L87 Difference]: Start difference. First operand has 376 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 312 states have internal predecessors, (447), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 415 states. [2022-02-20 19:59:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:35,940 INFO L93 Difference]: Finished difference Result 415 states and 598 transitions. [2022-02-20 19:59:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 598 transitions. [2022-02-20 19:59:35,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:35,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:35,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:35,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 312 states have internal predecessors, (447), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 542 transitions. [2022-02-20 19:59:35,968 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 542 transitions. Word has length 65 [2022-02-20 19:59:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:35,969 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 542 transitions. [2022-02-20 19:59:35,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 542 transitions. [2022-02-20 19:59:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:35,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:35,972 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] [2022-02-20 19:59:35,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:35,972 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1046555475, now seen corresponding path program 1 times [2022-02-20 19:59:35,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:35,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431488463] [2022-02-20 19:59:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {2662#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:36,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:36,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2624#(= ~q_write_ev~0 ~q_read_ev~0)} #937#return; {2624#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {2664#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:36,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {2664#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2665#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:36,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {2665#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2665#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:36,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2665#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2624#(= ~q_write_ev~0 ~q_read_ev~0)} #939#return; {2623#false} is VALID [2022-02-20 19:59:36,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {2622#true} havoc ~__retres1~0; {2622#true} is VALID [2022-02-20 19:59:36,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {2622#true} assume 1 == ~p_dw_pc~0; {2622#true} is VALID [2022-02-20 19:59:36,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {2622#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2622#true} is VALID [2022-02-20 19:59:36,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {2622#true} #res := ~__retres1~0; {2622#true} is VALID [2022-02-20 19:59:36,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,126 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2622#true} {2622#true} #933#return; {2622#true} is VALID [2022-02-20 19:59:36,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {2622#true} havoc ~__retres1~1; {2622#true} is VALID [2022-02-20 19:59:36,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {2622#true} assume 1 == ~c_dr_pc~0; {2622#true} is VALID [2022-02-20 19:59:36,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {2622#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2622#true} is VALID [2022-02-20 19:59:36,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {2622#true} #res := ~__retres1~1; {2622#true} is VALID [2022-02-20 19:59:36,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,130 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2622#true} {2622#true} #935#return; {2622#true} is VALID [2022-02-20 19:59:36,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {2666#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {2622#true} is VALID [2022-02-20 19:59:36,131 INFO L272 TraceCheckUtils]: 1: Hoare triple {2622#true} call #t~ret8 := is_do_write_p_triggered(); {2622#true} is VALID [2022-02-20 19:59:36,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {2622#true} havoc ~__retres1~0; {2622#true} is VALID [2022-02-20 19:59:36,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {2622#true} assume 1 == ~p_dw_pc~0; {2622#true} is VALID [2022-02-20 19:59:36,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {2622#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2622#true} is VALID [2022-02-20 19:59:36,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {2622#true} #res := ~__retres1~0; {2622#true} is VALID [2022-02-20 19:59:36,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,131 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2622#true} {2622#true} #933#return; {2622#true} is VALID [2022-02-20 19:59:36,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {2622#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2622#true} is VALID [2022-02-20 19:59:36,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {2622#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2622#true} is VALID [2022-02-20 19:59:36,132 INFO L272 TraceCheckUtils]: 10: Hoare triple {2622#true} call #t~ret9 := is_do_read_c_triggered(); {2622#true} is VALID [2022-02-20 19:59:36,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {2622#true} havoc ~__retres1~1; {2622#true} is VALID [2022-02-20 19:59:36,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {2622#true} assume 1 == ~c_dr_pc~0; {2622#true} is VALID [2022-02-20 19:59:36,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {2622#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2622#true} is VALID [2022-02-20 19:59:36,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {2622#true} #res := ~__retres1~1; {2622#true} is VALID [2022-02-20 19:59:36,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,133 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2622#true} {2622#true} #935#return; {2622#true} is VALID [2022-02-20 19:59:36,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {2622#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2622#true} is VALID [2022-02-20 19:59:36,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {2622#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2622#true} is VALID [2022-02-20 19:59:36,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,133 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2622#true} {2623#false} #941#return; {2623#false} is VALID [2022-02-20 19:59:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {2622#true} is VALID [2022-02-20 19:59:36,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {2622#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2622#true} is VALID [2022-02-20 19:59:36,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2622#true} {2623#false} #943#return; {2623#false} is VALID [2022-02-20 19:59:36,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {2622#true} havoc ~__retres1~2; {2622#true} is VALID [2022-02-20 19:59:36,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {2622#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2622#true} is VALID [2022-02-20 19:59:36,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {2622#true} #res := ~__retres1~2; {2622#true} is VALID [2022-02-20 19:59:36,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,143 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2622#true} {2623#false} #945#return; {2623#false} is VALID [2022-02-20 19:59:36,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {2622#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {2622#true} is VALID [2022-02-20 19:59:36,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {2622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {2622#true} is VALID [2022-02-20 19:59:36,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {2622#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {2624#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {2624#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {2624#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {2624#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {2662#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:36,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {2662#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:36,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:36,146 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2624#(= ~q_write_ev~0 ~q_read_ev~0)} #937#return; {2624#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {2624#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2624#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {2624#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2624#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {2624#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2624#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {2624#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2624#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,147 INFO L272 TraceCheckUtils]: 12: Hoare triple {2624#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:36,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {2664#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:36,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {2664#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2665#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:36,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {2665#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2665#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:36,149 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2665#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2624#(= ~q_write_ev~0 ~q_read_ev~0)} #939#return; {2623#false} is VALID [2022-02-20 19:59:36,149 INFO L272 TraceCheckUtils]: 17: Hoare triple {2623#false} call activate_threads1(); {2666#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:36,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {2666#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {2622#true} is VALID [2022-02-20 19:59:36,149 INFO L272 TraceCheckUtils]: 19: Hoare triple {2622#true} call #t~ret8 := is_do_write_p_triggered(); {2622#true} is VALID [2022-02-20 19:59:36,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {2622#true} havoc ~__retres1~0; {2622#true} is VALID [2022-02-20 19:59:36,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {2622#true} assume 1 == ~p_dw_pc~0; {2622#true} is VALID [2022-02-20 19:59:36,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {2622#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2622#true} is VALID [2022-02-20 19:59:36,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {2622#true} #res := ~__retres1~0; {2622#true} is VALID [2022-02-20 19:59:36,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,150 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2622#true} {2622#true} #933#return; {2622#true} is VALID [2022-02-20 19:59:36,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {2622#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2622#true} is VALID [2022-02-20 19:59:36,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {2622#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2622#true} is VALID [2022-02-20 19:59:36,150 INFO L272 TraceCheckUtils]: 28: Hoare triple {2622#true} call #t~ret9 := is_do_read_c_triggered(); {2622#true} is VALID [2022-02-20 19:59:36,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {2622#true} havoc ~__retres1~1; {2622#true} is VALID [2022-02-20 19:59:36,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {2622#true} assume 1 == ~c_dr_pc~0; {2622#true} is VALID [2022-02-20 19:59:36,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {2622#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2622#true} is VALID [2022-02-20 19:59:36,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {2622#true} #res := ~__retres1~1; {2622#true} is VALID [2022-02-20 19:59:36,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,151 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2622#true} {2622#true} #935#return; {2622#true} is VALID [2022-02-20 19:59:36,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {2622#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2622#true} is VALID [2022-02-20 19:59:36,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {2622#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2622#true} is VALID [2022-02-20 19:59:36,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,152 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2622#true} {2623#false} #941#return; {2623#false} is VALID [2022-02-20 19:59:36,152 INFO L272 TraceCheckUtils]: 39: Hoare triple {2623#false} call reset_delta_events1(); {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:36,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {2663#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {2622#true} is VALID [2022-02-20 19:59:36,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {2622#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2622#true} is VALID [2022-02-20 19:59:36,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,153 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2622#true} {2623#false} #943#return; {2623#false} is VALID [2022-02-20 19:59:36,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {2623#false} assume !false; {2623#false} is VALID [2022-02-20 19:59:36,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {2623#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {2623#false} is VALID [2022-02-20 19:59:36,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {2623#false} assume !false; {2623#false} is VALID [2022-02-20 19:59:36,153 INFO L272 TraceCheckUtils]: 47: Hoare triple {2623#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2622#true} is VALID [2022-02-20 19:59:36,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {2622#true} havoc ~__retres1~2; {2622#true} is VALID [2022-02-20 19:59:36,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {2622#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2622#true} is VALID [2022-02-20 19:59:36,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {2622#true} #res := ~__retres1~2; {2622#true} is VALID [2022-02-20 19:59:36,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {2622#true} assume true; {2622#true} is VALID [2022-02-20 19:59:36,154 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2622#true} {2623#false} #945#return; {2623#false} is VALID [2022-02-20 19:59:36,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {2623#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {2623#false} is VALID [2022-02-20 19:59:36,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {2623#false} assume 0 != eval1_~tmp___1~0#1; {2623#false} is VALID [2022-02-20 19:59:36,154 INFO L290 TraceCheckUtils]: 55: Hoare triple {2623#false} assume !(0 == ~p_dw_st~0); {2623#false} is VALID [2022-02-20 19:59:36,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {2623#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {2623#false} is VALID [2022-02-20 19:59:36,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {2623#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {2623#false} is VALID [2022-02-20 19:59:36,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {2623#false} assume !(0 == ~c_dr_pc~0); {2623#false} is VALID [2022-02-20 19:59:36,155 INFO L290 TraceCheckUtils]: 59: Hoare triple {2623#false} assume 2 == ~c_dr_pc~0; {2623#false} is VALID [2022-02-20 19:59:36,155 INFO L290 TraceCheckUtils]: 60: Hoare triple {2623#false} do_read_c_~a~0#1 := ~a_t~0; {2623#false} is VALID [2022-02-20 19:59:36,155 INFO L290 TraceCheckUtils]: 61: Hoare triple {2623#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {2623#false} is VALID [2022-02-20 19:59:36,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {2623#false} assume !(~p_last_write~0 == ~c_last_read~0); {2623#false} is VALID [2022-02-20 19:59:36,156 INFO L272 TraceCheckUtils]: 63: Hoare triple {2623#false} call error1(); {2623#false} is VALID [2022-02-20 19:59:36,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {2623#false} assume !false; {2623#false} is VALID [2022-02-20 19:59:36,156 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:59:36,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:36,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431488463] [2022-02-20 19:59:36,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431488463] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:36,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:36,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:36,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270507419] [2022-02-20 19:59:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:36,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:36,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:36,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:36,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:36,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:36,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:36,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:36,195 INFO L87 Difference]: Start difference. First operand 376 states and 542 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:38,973 INFO L93 Difference]: Finished difference Result 773 states and 1108 transitions. [2022-02-20 19:59:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:38,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 784 transitions. [2022-02-20 19:59:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 784 transitions. [2022-02-20 19:59:38,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 784 transitions. [2022-02-20 19:59:39,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 784 edges. 784 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:39,524 INFO L225 Difference]: With dead ends: 773 [2022-02-20 19:59:39,524 INFO L226 Difference]: Without dead ends: 564 [2022-02-20 19:59:39,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:39,526 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 749 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:39,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 1681 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-02-20 19:59:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 488. [2022-02-20 19:59:39,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:39,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 564 states. Second operand has 488 states, 396 states have (on average 1.446969696969697) internal successors, (573), 404 states have internal predecessors, (573), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:39,547 INFO L74 IsIncluded]: Start isIncluded. First operand 564 states. Second operand has 488 states, 396 states have (on average 1.446969696969697) internal successors, (573), 404 states have internal predecessors, (573), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:39,548 INFO L87 Difference]: Start difference. First operand 564 states. Second operand has 488 states, 396 states have (on average 1.446969696969697) internal successors, (573), 404 states have internal predecessors, (573), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:39,575 INFO L93 Difference]: Finished difference Result 564 states and 816 transitions. [2022-02-20 19:59:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 816 transitions. [2022-02-20 19:59:39,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:39,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:39,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 488 states, 396 states have (on average 1.446969696969697) internal successors, (573), 404 states have internal predecessors, (573), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 564 states. [2022-02-20 19:59:39,581 INFO L87 Difference]: Start difference. First operand has 488 states, 396 states have (on average 1.446969696969697) internal successors, (573), 404 states have internal predecessors, (573), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 564 states. [2022-02-20 19:59:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:39,605 INFO L93 Difference]: Finished difference Result 564 states and 816 transitions. [2022-02-20 19:59:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 816 transitions. [2022-02-20 19:59:39,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:39,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:39,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:39,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 396 states have (on average 1.446969696969697) internal successors, (573), 404 states have internal predecessors, (573), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 702 transitions. [2022-02-20 19:59:39,623 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 702 transitions. Word has length 65 [2022-02-20 19:59:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:39,625 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 702 transitions. [2022-02-20 19:59:39,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 702 transitions. [2022-02-20 19:59:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:39,628 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:39,628 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] [2022-02-20 19:59:39,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:39,628 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1219825711, now seen corresponding path program 1 times [2022-02-20 19:59:39,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:39,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901711499] [2022-02-20 19:59:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {5583#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {5584#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:39,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {5584#(not (= |old(~q_req_up~0)| 1))} assume true; {5584#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:39,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5584#(not (= |old(~q_req_up~0)| 1))} {5544#(= ~q_req_up~0 ~p_dw_pc~0)} #937#return; {5548#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:39,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {5585#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {5541#true} is VALID [2022-02-20 19:59:39,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {5541#true} assume !(0 == ~q_write_ev~0); {5541#true} is VALID [2022-02-20 19:59:39,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {5541#true} assume true; {5541#true} is VALID [2022-02-20 19:59:39,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5541#true} {5548#(not (= ~p_dw_pc~0 1))} #939#return; {5548#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:39,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {5541#true} havoc ~__retres1~0; {5541#true} is VALID [2022-02-20 19:59:39,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {5541#true} assume 1 == ~p_dw_pc~0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,781 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} {5541#true} #933#return; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {5541#true} havoc ~__retres1~1; {5541#true} is VALID [2022-02-20 19:59:39,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {5541#true} assume 1 == ~c_dr_pc~0; {5541#true} is VALID [2022-02-20 19:59:39,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {5541#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5541#true} is VALID [2022-02-20 19:59:39,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {5541#true} #res := ~__retres1~1; {5541#true} is VALID [2022-02-20 19:59:39,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {5541#true} assume true; {5541#true} is VALID [2022-02-20 19:59:39,789 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5541#true} {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} #935#return; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {5586#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {5541#true} is VALID [2022-02-20 19:59:39,792 INFO L272 TraceCheckUtils]: 1: Hoare triple {5541#true} call #t~ret8 := is_do_write_p_triggered(); {5541#true} is VALID [2022-02-20 19:59:39,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {5541#true} havoc ~__retres1~0; {5541#true} is VALID [2022-02-20 19:59:39,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {5541#true} assume 1 == ~p_dw_pc~0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,801 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} {5541#true} #933#return; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,806 INFO L272 TraceCheckUtils]: 10: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {5541#true} is VALID [2022-02-20 19:59:39,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {5541#true} havoc ~__retres1~1; {5541#true} is VALID [2022-02-20 19:59:39,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {5541#true} assume 1 == ~c_dr_pc~0; {5541#true} is VALID [2022-02-20 19:59:39,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {5541#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5541#true} is VALID [2022-02-20 19:59:39,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {5541#true} #res := ~__retres1~1; {5541#true} is VALID [2022-02-20 19:59:39,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {5541#true} assume true; {5541#true} is VALID [2022-02-20 19:59:39,818 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5541#true} {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} #935#return; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,820 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} {5548#(not (= ~p_dw_pc~0 1))} #941#return; {5542#false} is VALID [2022-02-20 19:59:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {5585#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {5541#true} is VALID [2022-02-20 19:59:39,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {5541#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5541#true} is VALID [2022-02-20 19:59:39,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {5541#true} assume true; {5541#true} is VALID [2022-02-20 19:59:39,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5541#true} {5542#false} #943#return; {5542#false} is VALID [2022-02-20 19:59:39,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:39,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {5541#true} havoc ~__retres1~2; {5541#true} is VALID [2022-02-20 19:59:39,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {5541#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5541#true} is VALID [2022-02-20 19:59:39,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {5541#true} #res := ~__retres1~2; {5541#true} is VALID [2022-02-20 19:59:39,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {5541#true} assume true; {5541#true} is VALID [2022-02-20 19:59:39,828 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5541#true} {5542#false} #945#return; {5542#false} is VALID [2022-02-20 19:59:39,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {5541#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {5543#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:39,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {5543#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {5543#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:39,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {5543#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {5544#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:39,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {5544#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {5544#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:39,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {5544#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {5583#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:39,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {5583#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {5584#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:39,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {5584#(not (= |old(~q_req_up~0)| 1))} assume true; {5584#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:39,836 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5584#(not (= |old(~q_req_up~0)| 1))} {5544#(= ~q_req_up~0 ~p_dw_pc~0)} #937#return; {5548#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:39,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {5548#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {5548#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:39,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {5548#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5548#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:39,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {5548#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5548#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:39,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {5548#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {5548#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:39,838 INFO L272 TraceCheckUtils]: 12: Hoare triple {5548#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {5585#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:39,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {5585#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {5541#true} is VALID [2022-02-20 19:59:39,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {5541#true} assume !(0 == ~q_write_ev~0); {5541#true} is VALID [2022-02-20 19:59:39,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {5541#true} assume true; {5541#true} is VALID [2022-02-20 19:59:39,839 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5541#true} {5548#(not (= ~p_dw_pc~0 1))} #939#return; {5548#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:39,839 INFO L272 TraceCheckUtils]: 17: Hoare triple {5548#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {5586#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:39,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {5586#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {5541#true} is VALID [2022-02-20 19:59:39,840 INFO L272 TraceCheckUtils]: 19: Hoare triple {5541#true} call #t~ret8 := is_do_write_p_triggered(); {5541#true} is VALID [2022-02-20 19:59:39,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {5541#true} havoc ~__retres1~0; {5541#true} is VALID [2022-02-20 19:59:39,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {5541#true} assume 1 == ~p_dw_pc~0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,841 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} {5541#true} #933#return; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,842 INFO L272 TraceCheckUtils]: 28: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {5541#true} is VALID [2022-02-20 19:59:39,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {5541#true} havoc ~__retres1~1; {5541#true} is VALID [2022-02-20 19:59:39,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {5541#true} assume 1 == ~c_dr_pc~0; {5541#true} is VALID [2022-02-20 19:59:39,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {5541#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5541#true} is VALID [2022-02-20 19:59:39,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {5541#true} #res := ~__retres1~1; {5541#true} is VALID [2022-02-20 19:59:39,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {5541#true} assume true; {5541#true} is VALID [2022-02-20 19:59:39,852 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5541#true} {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} #935#return; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:39,854 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5593#(= (+ (- 1) ~p_dw_pc~0) 0)} {5548#(not (= ~p_dw_pc~0 1))} #941#return; {5542#false} is VALID [2022-02-20 19:59:39,854 INFO L272 TraceCheckUtils]: 39: Hoare triple {5542#false} call reset_delta_events1(); {5585#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:39,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {5585#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {5541#true} is VALID [2022-02-20 19:59:39,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {5541#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5541#true} is VALID [2022-02-20 19:59:39,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {5541#true} assume true; {5541#true} is VALID [2022-02-20 19:59:39,854 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5541#true} {5542#false} #943#return; {5542#false} is VALID [2022-02-20 19:59:39,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {5542#false} assume !false; {5542#false} is VALID [2022-02-20 19:59:39,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {5542#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {5542#false} is VALID [2022-02-20 19:59:39,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {5542#false} assume !false; {5542#false} is VALID [2022-02-20 19:59:39,855 INFO L272 TraceCheckUtils]: 47: Hoare triple {5542#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5541#true} is VALID [2022-02-20 19:59:39,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {5541#true} havoc ~__retres1~2; {5541#true} is VALID [2022-02-20 19:59:39,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {5541#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5541#true} is VALID [2022-02-20 19:59:39,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {5541#true} #res := ~__retres1~2; {5541#true} is VALID [2022-02-20 19:59:39,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {5541#true} assume true; {5541#true} is VALID [2022-02-20 19:59:39,855 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5541#true} {5542#false} #945#return; {5542#false} is VALID [2022-02-20 19:59:39,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {5542#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {5542#false} is VALID [2022-02-20 19:59:39,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {5542#false} assume 0 != eval1_~tmp___1~0#1; {5542#false} is VALID [2022-02-20 19:59:39,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {5542#false} assume !(0 == ~p_dw_st~0); {5542#false} is VALID [2022-02-20 19:59:39,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {5542#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {5542#false} is VALID [2022-02-20 19:59:39,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {5542#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {5542#false} is VALID [2022-02-20 19:59:39,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {5542#false} assume !(0 == ~c_dr_pc~0); {5542#false} is VALID [2022-02-20 19:59:39,856 INFO L290 TraceCheckUtils]: 59: Hoare triple {5542#false} assume 2 == ~c_dr_pc~0; {5542#false} is VALID [2022-02-20 19:59:39,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {5542#false} do_read_c_~a~0#1 := ~a_t~0; {5542#false} is VALID [2022-02-20 19:59:39,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {5542#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {5542#false} is VALID [2022-02-20 19:59:39,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {5542#false} assume !(~p_last_write~0 == ~c_last_read~0); {5542#false} is VALID [2022-02-20 19:59:39,857 INFO L272 TraceCheckUtils]: 63: Hoare triple {5542#false} call error1(); {5542#false} is VALID [2022-02-20 19:59:39,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {5542#false} assume !false; {5542#false} is VALID [2022-02-20 19:59:39,857 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:59:39,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:39,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901711499] [2022-02-20 19:59:39,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901711499] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:39,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:39,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:39,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433838006] [2022-02-20 19:59:39,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:39,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:59:39,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:39,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:39,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:39,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:39,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:39,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:39,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:39,898 INFO L87 Difference]: Start difference. First operand 488 states and 702 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,142 INFO L93 Difference]: Finished difference Result 2034 states and 2900 transitions. [2022-02-20 19:59:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:59:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1189 transitions. [2022-02-20 19:59:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1189 transitions. [2022-02-20 19:59:45,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1189 transitions. [2022-02-20 19:59:46,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1189 edges. 1189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:46,139 INFO L225 Difference]: With dead ends: 2034 [2022-02-20 19:59:46,140 INFO L226 Difference]: Without dead ends: 1701 [2022-02-20 19:59:46,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:46,148 INFO L933 BasicCegarLoop]: 526 mSDtfsCounter, 2246 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:46,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2264 Valid, 2030 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 19:59:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2022-02-20 19:59:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1541. [2022-02-20 19:59:46,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:46,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1701 states. Second operand has 1541 states, 1244 states have (on average 1.380225080385852) internal successors, (1717), 1267 states have internal predecessors, (1717), 169 states have call successors, (169), 111 states have call predecessors, (169), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2022-02-20 19:59:46,226 INFO L74 IsIncluded]: Start isIncluded. First operand 1701 states. Second operand has 1541 states, 1244 states have (on average 1.380225080385852) internal successors, (1717), 1267 states have internal predecessors, (1717), 169 states have call successors, (169), 111 states have call predecessors, (169), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2022-02-20 19:59:46,229 INFO L87 Difference]: Start difference. First operand 1701 states. Second operand has 1541 states, 1244 states have (on average 1.380225080385852) internal successors, (1717), 1267 states have internal predecessors, (1717), 169 states have call successors, (169), 111 states have call predecessors, (169), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2022-02-20 19:59:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,328 INFO L93 Difference]: Finished difference Result 1701 states and 2301 transitions. [2022-02-20 19:59:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2301 transitions. [2022-02-20 19:59:46,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:46,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:46,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 1541 states, 1244 states have (on average 1.380225080385852) internal successors, (1717), 1267 states have internal predecessors, (1717), 169 states have call successors, (169), 111 states have call predecessors, (169), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) Second operand 1701 states. [2022-02-20 19:59:46,337 INFO L87 Difference]: Start difference. First operand has 1541 states, 1244 states have (on average 1.380225080385852) internal successors, (1717), 1267 states have internal predecessors, (1717), 169 states have call successors, (169), 111 states have call predecessors, (169), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) Second operand 1701 states. [2022-02-20 19:59:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,456 INFO L93 Difference]: Finished difference Result 1701 states and 2301 transitions. [2022-02-20 19:59:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2301 transitions. [2022-02-20 19:59:46,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:46,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:46,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:46,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1244 states have (on average 1.380225080385852) internal successors, (1717), 1267 states have internal predecessors, (1717), 169 states have call successors, (169), 111 states have call predecessors, (169), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2022-02-20 19:59:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2089 transitions. [2022-02-20 19:59:46,562 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2089 transitions. Word has length 65 [2022-02-20 19:59:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:46,562 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2089 transitions. [2022-02-20 19:59:46,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2089 transitions. [2022-02-20 19:59:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:46,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:46,563 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] [2022-02-20 19:59:46,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:46,563 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 44002010, now seen corresponding path program 1 times [2022-02-20 19:59:46,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:46,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724653514] [2022-02-20 19:59:46,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {13943#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {13903#true} is VALID [2022-02-20 19:59:46,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13903#true} {13903#true} #937#return; {13903#true} is VALID [2022-02-20 19:59:46,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {13944#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {13903#true} is VALID [2022-02-20 19:59:46,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {13903#true} assume !(0 == ~q_write_ev~0); {13903#true} is VALID [2022-02-20 19:59:46,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13903#true} {13903#true} #939#return; {13903#true} is VALID [2022-02-20 19:59:46,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {13903#true} havoc ~__retres1~0; {13903#true} is VALID [2022-02-20 19:59:46,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {13903#true} assume !(1 == ~p_dw_pc~0); {13903#true} is VALID [2022-02-20 19:59:46,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {13903#true} assume !(2 == ~p_dw_pc~0); {13903#true} is VALID [2022-02-20 19:59:46,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {13903#true} ~__retres1~0 := 0; {13961#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:46,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {13961#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:46,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:46,669 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {13903#true} #933#return; {13953#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:46,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {13903#true} havoc ~__retres1~1; {13903#true} is VALID [2022-02-20 19:59:46,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {13903#true} assume 1 == ~c_dr_pc~0; {13903#true} is VALID [2022-02-20 19:59:46,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {13903#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {13903#true} is VALID [2022-02-20 19:59:46,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {13903#true} #res := ~__retres1~1; {13903#true} is VALID [2022-02-20 19:59:46,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,676 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13903#true} {13904#false} #935#return; {13904#false} is VALID [2022-02-20 19:59:46,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {13945#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {13903#true} is VALID [2022-02-20 19:59:46,676 INFO L272 TraceCheckUtils]: 1: Hoare triple {13903#true} call #t~ret8 := is_do_write_p_triggered(); {13903#true} is VALID [2022-02-20 19:59:46,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {13903#true} havoc ~__retres1~0; {13903#true} is VALID [2022-02-20 19:59:46,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {13903#true} assume !(1 == ~p_dw_pc~0); {13903#true} is VALID [2022-02-20 19:59:46,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {13903#true} assume !(2 == ~p_dw_pc~0); {13903#true} is VALID [2022-02-20 19:59:46,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {13903#true} ~__retres1~0 := 0; {13961#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:46,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {13961#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:46,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:46,680 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {13903#true} #933#return; {13953#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:46,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {13953#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13954#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:46,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {13954#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {13904#false} is VALID [2022-02-20 19:59:46,681 INFO L272 TraceCheckUtils]: 11: Hoare triple {13904#false} call #t~ret9 := is_do_read_c_triggered(); {13903#true} is VALID [2022-02-20 19:59:46,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {13903#true} havoc ~__retres1~1; {13903#true} is VALID [2022-02-20 19:59:46,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {13903#true} assume 1 == ~c_dr_pc~0; {13903#true} is VALID [2022-02-20 19:59:46,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {13903#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {13903#true} is VALID [2022-02-20 19:59:46,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {13903#true} #res := ~__retres1~1; {13903#true} is VALID [2022-02-20 19:59:46,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,692 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13903#true} {13904#false} #935#return; {13904#false} is VALID [2022-02-20 19:59:46,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {13904#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13904#false} is VALID [2022-02-20 19:59:46,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {13904#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13904#false} is VALID [2022-02-20 19:59:46,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {13904#false} assume true; {13904#false} is VALID [2022-02-20 19:59:46,693 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13904#false} {13903#true} #941#return; {13904#false} is VALID [2022-02-20 19:59:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {13944#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {13903#true} is VALID [2022-02-20 19:59:46,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {13903#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13903#true} is VALID [2022-02-20 19:59:46,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13903#true} {13904#false} #943#return; {13904#false} is VALID [2022-02-20 19:59:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {13903#true} havoc ~__retres1~2; {13903#true} is VALID [2022-02-20 19:59:46,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {13903#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13903#true} is VALID [2022-02-20 19:59:46,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {13903#true} #res := ~__retres1~2; {13903#true} is VALID [2022-02-20 19:59:46,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,714 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13903#true} {13904#false} #945#return; {13904#false} is VALID [2022-02-20 19:59:46,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {13903#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {13903#true} is VALID [2022-02-20 19:59:46,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {13903#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {13903#true} is VALID [2022-02-20 19:59:46,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {13903#true} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {13903#true} is VALID [2022-02-20 19:59:46,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {13903#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {13903#true} is VALID [2022-02-20 19:59:46,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {13903#true} call update_channels1(); {13943#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:46,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {13943#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {13903#true} is VALID [2022-02-20 19:59:46,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,716 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13903#true} {13903#true} #937#return; {13903#true} is VALID [2022-02-20 19:59:46,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {13903#true} assume { :begin_inline_init_threads1 } true; {13903#true} is VALID [2022-02-20 19:59:46,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {13903#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13903#true} is VALID [2022-02-20 19:59:46,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {13903#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13903#true} is VALID [2022-02-20 19:59:46,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {13903#true} assume { :end_inline_init_threads1 } true; {13903#true} is VALID [2022-02-20 19:59:46,717 INFO L272 TraceCheckUtils]: 12: Hoare triple {13903#true} call fire_delta_events1(); {13944#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {13944#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {13903#true} is VALID [2022-02-20 19:59:46,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {13903#true} assume !(0 == ~q_write_ev~0); {13903#true} is VALID [2022-02-20 19:59:46,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,717 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13903#true} {13903#true} #939#return; {13903#true} is VALID [2022-02-20 19:59:46,717 INFO L272 TraceCheckUtils]: 17: Hoare triple {13903#true} call activate_threads1(); {13945#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:46,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {13945#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {13903#true} is VALID [2022-02-20 19:59:46,718 INFO L272 TraceCheckUtils]: 19: Hoare triple {13903#true} call #t~ret8 := is_do_write_p_triggered(); {13903#true} is VALID [2022-02-20 19:59:46,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {13903#true} havoc ~__retres1~0; {13903#true} is VALID [2022-02-20 19:59:46,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {13903#true} assume !(1 == ~p_dw_pc~0); {13903#true} is VALID [2022-02-20 19:59:46,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {13903#true} assume !(2 == ~p_dw_pc~0); {13903#true} is VALID [2022-02-20 19:59:46,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {13903#true} ~__retres1~0 := 0; {13961#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:46,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {13961#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:46,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:46,719 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13962#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {13903#true} #933#return; {13953#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:46,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {13953#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13954#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:46,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {13954#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {13904#false} is VALID [2022-02-20 19:59:46,720 INFO L272 TraceCheckUtils]: 29: Hoare triple {13904#false} call #t~ret9 := is_do_read_c_triggered(); {13903#true} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {13903#true} havoc ~__retres1~1; {13903#true} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {13903#true} assume 1 == ~c_dr_pc~0; {13903#true} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {13903#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {13903#true} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {13903#true} #res := ~__retres1~1; {13903#true} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,721 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13903#true} {13904#false} #935#return; {13904#false} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {13904#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13904#false} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {13904#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {13904#false} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {13904#false} assume true; {13904#false} is VALID [2022-02-20 19:59:46,721 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13904#false} {13903#true} #941#return; {13904#false} is VALID [2022-02-20 19:59:46,721 INFO L272 TraceCheckUtils]: 40: Hoare triple {13904#false} call reset_delta_events1(); {13944#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {13944#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {13903#true} is VALID [2022-02-20 19:59:46,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {13903#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {13903#true} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,722 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13903#true} {13904#false} #943#return; {13904#false} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {13904#false} assume !false; {13904#false} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {13904#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {13904#false} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {13904#false} assume !false; {13904#false} is VALID [2022-02-20 19:59:46,722 INFO L272 TraceCheckUtils]: 48: Hoare triple {13904#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13903#true} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {13903#true} havoc ~__retres1~2; {13903#true} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {13903#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13903#true} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {13903#true} #res := ~__retres1~2; {13903#true} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {13903#true} assume true; {13903#true} is VALID [2022-02-20 19:59:46,722 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13903#true} {13904#false} #945#return; {13904#false} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 54: Hoare triple {13904#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {13904#false} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 55: Hoare triple {13904#false} assume 0 != eval1_~tmp___1~0#1; {13904#false} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {13904#false} assume !(0 == ~p_dw_st~0); {13904#false} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {13904#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {13904#false} is VALID [2022-02-20 19:59:46,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {13904#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {13904#false} is VALID [2022-02-20 19:59:46,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {13904#false} assume !(0 == ~c_dr_pc~0); {13904#false} is VALID [2022-02-20 19:59:46,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {13904#false} assume 2 == ~c_dr_pc~0; {13904#false} is VALID [2022-02-20 19:59:46,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {13904#false} do_read_c_~a~0#1 := ~a_t~0; {13904#false} is VALID [2022-02-20 19:59:46,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {13904#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {13904#false} is VALID [2022-02-20 19:59:46,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {13904#false} assume !(~p_last_write~0 == ~c_last_read~0); {13904#false} is VALID [2022-02-20 19:59:46,723 INFO L272 TraceCheckUtils]: 64: Hoare triple {13904#false} call error1(); {13904#false} is VALID [2022-02-20 19:59:46,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {13904#false} assume !false; {13904#false} is VALID [2022-02-20 19:59:46,723 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:59:46,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:46,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724653514] [2022-02-20 19:59:46,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724653514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:46,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:46,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:46,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564058399] [2022-02-20 19:59:46,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:46,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:59:46,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:46,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:46,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:46,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:46,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:46,768 INFO L87 Difference]: Start difference. First operand 1541 states and 2089 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:49,343 INFO L93 Difference]: Finished difference Result 3069 states and 4168 transitions. [2022-02-20 19:59:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:49,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:59:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 565 transitions. [2022-02-20 19:59:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 565 transitions. [2022-02-20 19:59:49,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 565 transitions. [2022-02-20 19:59:49,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:49,825 INFO L225 Difference]: With dead ends: 3069 [2022-02-20 19:59:49,825 INFO L226 Difference]: Without dead ends: 1689 [2022-02-20 19:59:49,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:49,828 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 306 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:49,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 1682 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2022-02-20 19:59:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1581. [2022-02-20 19:59:49,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:49,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1689 states. Second operand has 1581 states, 1276 states have (on average 1.365987460815047) internal successors, (1743), 1299 states have internal predecessors, (1743), 169 states have call successors, (169), 111 states have call predecessors, (169), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2022-02-20 19:59:49,897 INFO L74 IsIncluded]: Start isIncluded. First operand 1689 states. Second operand has 1581 states, 1276 states have (on average 1.365987460815047) internal successors, (1743), 1299 states have internal predecessors, (1743), 169 states have call successors, (169), 111 states have call predecessors, (169), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2022-02-20 19:59:49,900 INFO L87 Difference]: Start difference. First operand 1689 states. Second operand has 1581 states, 1276 states have (on average 1.365987460815047) internal successors, (1743), 1299 states have internal predecessors, (1743), 169 states have call successors, (169), 111 states have call predecessors, (169), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2022-02-20 19:59:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:49,989 INFO L93 Difference]: Finished difference Result 1689 states and 2277 transitions. [2022-02-20 19:59:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2277 transitions. [2022-02-20 19:59:49,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:49,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:50,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 1581 states, 1276 states have (on average 1.365987460815047) internal successors, (1743), 1299 states have internal predecessors, (1743), 169 states have call successors, (169), 111 states have call predecessors, (169), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) Second operand 1689 states. [2022-02-20 19:59:50,010 INFO L87 Difference]: Start difference. First operand has 1581 states, 1276 states have (on average 1.365987460815047) internal successors, (1743), 1299 states have internal predecessors, (1743), 169 states have call successors, (169), 111 states have call predecessors, (169), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) Second operand 1689 states. [2022-02-20 19:59:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,100 INFO L93 Difference]: Finished difference Result 1689 states and 2277 transitions. [2022-02-20 19:59:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2277 transitions. [2022-02-20 19:59:50,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:50,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:50,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:50,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1276 states have (on average 1.365987460815047) internal successors, (1743), 1299 states have internal predecessors, (1743), 169 states have call successors, (169), 111 states have call predecessors, (169), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2022-02-20 19:59:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2123 transitions. [2022-02-20 19:59:50,226 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2123 transitions. Word has length 66 [2022-02-20 19:59:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:50,226 INFO L470 AbstractCegarLoop]: Abstraction has 1581 states and 2123 transitions. [2022-02-20 19:59:50,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2123 transitions. [2022-02-20 19:59:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:50,227 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:50,227 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] [2022-02-20 19:59:50,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:50,227 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:50,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash -985357288, now seen corresponding path program 1 times [2022-02-20 19:59:50,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:50,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393642172] [2022-02-20 19:59:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:50,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {23659#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {23660#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:50,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {23660#(not (= |old(~q_req_up~0)| 1))} assume true; {23660#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:50,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23660#(not (= |old(~q_req_up~0)| 1))} {23619#(= ~c_dr_pc~0 ~q_req_up~0)} #937#return; {23623#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:50,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {23661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {23616#true} is VALID [2022-02-20 19:59:50,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {23616#true} assume !(0 == ~q_write_ev~0); {23616#true} is VALID [2022-02-20 19:59:50,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {23616#true} assume true; {23616#true} is VALID [2022-02-20 19:59:50,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23616#true} {23623#(not (= ~c_dr_pc~0 1))} #939#return; {23623#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:50,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {23616#true} havoc ~__retres1~0; {23616#true} is VALID [2022-02-20 19:59:50,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {23616#true} assume !(1 == ~p_dw_pc~0); {23616#true} is VALID [2022-02-20 19:59:50,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {23616#true} assume !(2 == ~p_dw_pc~0); {23616#true} is VALID [2022-02-20 19:59:50,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {23616#true} ~__retres1~0 := 0; {23616#true} is VALID [2022-02-20 19:59:50,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {23616#true} #res := ~__retres1~0; {23616#true} is VALID [2022-02-20 19:59:50,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {23616#true} assume true; {23616#true} is VALID [2022-02-20 19:59:50,349 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23616#true} {23616#true} #933#return; {23616#true} is VALID [2022-02-20 19:59:50,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {23616#true} havoc ~__retres1~1; {23616#true} is VALID [2022-02-20 19:59:50,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {23616#true} assume 1 == ~c_dr_pc~0; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,355 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} {23616#true} #935#return; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {23662#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {23616#true} is VALID [2022-02-20 19:59:50,355 INFO L272 TraceCheckUtils]: 1: Hoare triple {23616#true} call #t~ret8 := is_do_write_p_triggered(); {23616#true} is VALID [2022-02-20 19:59:50,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {23616#true} havoc ~__retres1~0; {23616#true} is VALID [2022-02-20 19:59:50,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {23616#true} assume !(1 == ~p_dw_pc~0); {23616#true} is VALID [2022-02-20 19:59:50,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {23616#true} assume !(2 == ~p_dw_pc~0); {23616#true} is VALID [2022-02-20 19:59:50,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {23616#true} ~__retres1~0 := 0; {23616#true} is VALID [2022-02-20 19:59:50,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {23616#true} #res := ~__retres1~0; {23616#true} is VALID [2022-02-20 19:59:50,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {23616#true} assume true; {23616#true} is VALID [2022-02-20 19:59:50,356 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {23616#true} {23616#true} #933#return; {23616#true} is VALID [2022-02-20 19:59:50,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {23616#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {23616#true} is VALID [2022-02-20 19:59:50,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {23616#true} assume !(0 != ~tmp~1); {23616#true} is VALID [2022-02-20 19:59:50,357 INFO L272 TraceCheckUtils]: 11: Hoare triple {23616#true} call #t~ret9 := is_do_read_c_triggered(); {23616#true} is VALID [2022-02-20 19:59:50,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {23616#true} havoc ~__retres1~1; {23616#true} is VALID [2022-02-20 19:59:50,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {23616#true} assume 1 == ~c_dr_pc~0; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,358 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} {23616#true} #935#return; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,359 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} {23623#(not (= ~c_dr_pc~0 1))} #941#return; {23617#false} is VALID [2022-02-20 19:59:50,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {23661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {23616#true} is VALID [2022-02-20 19:59:50,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {23616#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {23616#true} is VALID [2022-02-20 19:59:50,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {23616#true} assume true; {23616#true} is VALID [2022-02-20 19:59:50,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23616#true} {23617#false} #943#return; {23617#false} is VALID [2022-02-20 19:59:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {23616#true} havoc ~__retres1~2; {23616#true} is VALID [2022-02-20 19:59:50,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {23616#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {23616#true} is VALID [2022-02-20 19:59:50,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {23616#true} #res := ~__retres1~2; {23616#true} is VALID [2022-02-20 19:59:50,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {23616#true} assume true; {23616#true} is VALID [2022-02-20 19:59:50,368 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23616#true} {23617#false} #945#return; {23617#false} is VALID [2022-02-20 19:59:50,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {23616#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {23618#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:50,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {23618#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {23618#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:50,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {23618#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet33#1;havoc main_#t~nondet33#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {23619#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:50,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {23619#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {23619#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:50,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {23619#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {23659#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:50,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {23659#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {23660#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:50,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {23660#(not (= |old(~q_req_up~0)| 1))} assume true; {23660#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:50,371 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23660#(not (= |old(~q_req_up~0)| 1))} {23619#(= ~c_dr_pc~0 ~q_req_up~0)} #937#return; {23623#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:50,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {23623#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {23623#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:50,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {23623#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {23623#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:50,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {23623#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {23623#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:50,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {23623#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {23623#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:50,373 INFO L272 TraceCheckUtils]: 12: Hoare triple {23623#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {23661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:50,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {23661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {23616#true} is VALID [2022-02-20 19:59:50,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {23616#true} assume !(0 == ~q_write_ev~0); {23616#true} is VALID [2022-02-20 19:59:50,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {23616#true} assume true; {23616#true} is VALID [2022-02-20 19:59:50,373 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23616#true} {23623#(not (= ~c_dr_pc~0 1))} #939#return; {23623#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:50,374 INFO L272 TraceCheckUtils]: 17: Hoare triple {23623#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {23662#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:50,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {23662#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {23616#true} is VALID [2022-02-20 19:59:50,374 INFO L272 TraceCheckUtils]: 19: Hoare triple {23616#true} call #t~ret8 := is_do_write_p_triggered(); {23616#true} is VALID [2022-02-20 19:59:50,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {23616#true} havoc ~__retres1~0; {23616#true} is VALID [2022-02-20 19:59:50,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {23616#true} assume !(1 == ~p_dw_pc~0); {23616#true} is VALID [2022-02-20 19:59:50,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {23616#true} assume !(2 == ~p_dw_pc~0); {23616#true} is VALID [2022-02-20 19:59:50,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {23616#true} ~__retres1~0 := 0; {23616#true} is VALID [2022-02-20 19:59:50,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {23616#true} #res := ~__retres1~0; {23616#true} is VALID [2022-02-20 19:59:50,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {23616#true} assume true; {23616#true} is VALID [2022-02-20 19:59:50,375 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23616#true} {23616#true} #933#return; {23616#true} is VALID [2022-02-20 19:59:50,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {23616#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {23616#true} is VALID [2022-02-20 19:59:50,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {23616#true} assume !(0 != ~tmp~1); {23616#true} is VALID [2022-02-20 19:59:50,375 INFO L272 TraceCheckUtils]: 29: Hoare triple {23616#true} call #t~ret9 := is_do_read_c_triggered(); {23616#true} is VALID [2022-02-20 19:59:50,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {23616#true} havoc ~__retres1~1; {23616#true} is VALID [2022-02-20 19:59:50,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {23616#true} assume 1 == ~c_dr_pc~0; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,377 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} {23616#true} #935#return; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:50,378 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23676#(= (+ (- 1) ~c_dr_pc~0) 0)} {23623#(not (= ~c_dr_pc~0 1))} #941#return; {23617#false} is VALID [2022-02-20 19:59:50,378 INFO L272 TraceCheckUtils]: 40: Hoare triple {23617#false} call reset_delta_events1(); {23661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:50,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {23661#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {23616#true} is VALID [2022-02-20 19:59:50,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {23616#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {23616#true} is VALID [2022-02-20 19:59:50,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {23616#true} assume true; {23616#true} is VALID [2022-02-20 19:59:50,378 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23616#true} {23617#false} #943#return; {23617#false} is VALID [2022-02-20 19:59:50,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {23617#false} assume !false; {23617#false} is VALID [2022-02-20 19:59:50,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {23617#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {23617#false} is VALID [2022-02-20 19:59:50,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {23617#false} assume !false; {23617#false} is VALID [2022-02-20 19:59:50,379 INFO L272 TraceCheckUtils]: 48: Hoare triple {23617#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {23616#true} is VALID [2022-02-20 19:59:50,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {23616#true} havoc ~__retres1~2; {23616#true} is VALID [2022-02-20 19:59:50,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {23616#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {23616#true} is VALID [2022-02-20 19:59:50,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {23616#true} #res := ~__retres1~2; {23616#true} is VALID [2022-02-20 19:59:50,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {23616#true} assume true; {23616#true} is VALID [2022-02-20 19:59:50,379 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {23616#true} {23617#false} #945#return; {23617#false} is VALID [2022-02-20 19:59:50,379 INFO L290 TraceCheckUtils]: 54: Hoare triple {23617#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {23617#false} is VALID [2022-02-20 19:59:50,379 INFO L290 TraceCheckUtils]: 55: Hoare triple {23617#false} assume 0 != eval1_~tmp___1~0#1; {23617#false} is VALID [2022-02-20 19:59:50,380 INFO L290 TraceCheckUtils]: 56: Hoare triple {23617#false} assume !(0 == ~p_dw_st~0); {23617#false} is VALID [2022-02-20 19:59:50,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {23617#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {23617#false} is VALID [2022-02-20 19:59:50,380 INFO L290 TraceCheckUtils]: 58: Hoare triple {23617#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {23617#false} is VALID [2022-02-20 19:59:50,380 INFO L290 TraceCheckUtils]: 59: Hoare triple {23617#false} assume !(0 == ~c_dr_pc~0); {23617#false} is VALID [2022-02-20 19:59:50,380 INFO L290 TraceCheckUtils]: 60: Hoare triple {23617#false} assume 2 == ~c_dr_pc~0; {23617#false} is VALID [2022-02-20 19:59:50,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {23617#false} do_read_c_~a~0#1 := ~a_t~0; {23617#false} is VALID [2022-02-20 19:59:50,380 INFO L290 TraceCheckUtils]: 62: Hoare triple {23617#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {23617#false} is VALID [2022-02-20 19:59:50,380 INFO L290 TraceCheckUtils]: 63: Hoare triple {23617#false} assume !(~p_last_write~0 == ~c_last_read~0); {23617#false} is VALID [2022-02-20 19:59:50,380 INFO L272 TraceCheckUtils]: 64: Hoare triple {23617#false} call error1(); {23617#false} is VALID [2022-02-20 19:59:50,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {23617#false} assume !false; {23617#false} is VALID [2022-02-20 19:59:50,381 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:59:50,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:50,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393642172] [2022-02-20 19:59:50,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393642172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:50,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:50,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:50,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448904995] [2022-02-20 19:59:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 19:59:50,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:50,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:50,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:50,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:50,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:50,415 INFO L87 Difference]: Start difference. First operand 1581 states and 2123 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:56,209 INFO L93 Difference]: Finished difference Result 5153 states and 6997 transitions. [2022-02-20 19:59:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:56,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 19:59:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1178 transitions. [2022-02-20 19:59:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1178 transitions. [2022-02-20 19:59:56,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1178 transitions. [2022-02-20 19:59:57,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1178 edges. 1178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:57,206 INFO L225 Difference]: With dead ends: 5153 [2022-02-20 19:59:57,206 INFO L226 Difference]: Without dead ends: 1972 [2022-02-20 19:59:57,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:57,211 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 2317 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2335 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:57,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2335 Valid, 2070 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 19:59:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2022-02-20 19:59:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1792. [2022-02-20 19:59:57,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:57,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1972 states. Second operand has 1792 states, 1415 states have (on average 1.3208480565371026) internal successors, (1869), 1440 states have internal predecessors, (1869), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:57,304 INFO L74 IsIncluded]: Start isIncluded. First operand 1972 states. Second operand has 1792 states, 1415 states have (on average 1.3208480565371026) internal successors, (1869), 1440 states have internal predecessors, (1869), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:57,306 INFO L87 Difference]: Start difference. First operand 1972 states. Second operand has 1792 states, 1415 states have (on average 1.3208480565371026) internal successors, (1869), 1440 states have internal predecessors, (1869), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:57,417 INFO L93 Difference]: Finished difference Result 1972 states and 2566 transitions. [2022-02-20 19:59:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2566 transitions. [2022-02-20 19:59:57,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:57,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:57,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 1792 states, 1415 states have (on average 1.3208480565371026) internal successors, (1869), 1440 states have internal predecessors, (1869), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) Second operand 1972 states. [2022-02-20 19:59:57,425 INFO L87 Difference]: Start difference. First operand has 1792 states, 1415 states have (on average 1.3208480565371026) internal successors, (1869), 1440 states have internal predecessors, (1869), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) Second operand 1972 states. [2022-02-20 19:59:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:57,537 INFO L93 Difference]: Finished difference Result 1972 states and 2566 transitions. [2022-02-20 19:59:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2566 transitions. [2022-02-20 19:59:57,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:57,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:57,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:57,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1415 states have (on average 1.3208480565371026) internal successors, (1869), 1440 states have internal predecessors, (1869), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2335 transitions. [2022-02-20 19:59:57,670 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2335 transitions. Word has length 66 [2022-02-20 19:59:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:57,670 INFO L470 AbstractCegarLoop]: Abstraction has 1792 states and 2335 transitions. [2022-02-20 19:59:57,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2335 transitions. [2022-02-20 19:59:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:59:57,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:57,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:57,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:57,672 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1962986806, now seen corresponding path program 1 times [2022-02-20 19:59:57,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:57,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890004003] [2022-02-20 19:59:57,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:57,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,696 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {37054#true} {37056#(= ~t2_i~0 1)} #965#return; {37056#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:57,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:59:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {37110#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {37054#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {37054#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {37054#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {37054#true} assume 0 == ~E_M~0;~E_M~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {37054#true} assume 0 == ~E_1~0;~E_1~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {37054#true} assume !(0 == ~E_2~0); {37054#true} is VALID [2022-02-20 19:59:57,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {37054#true} assume 0 == ~E_3~0;~E_3~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,714 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {37054#true} {37055#false} #967#return; {37055#false} is VALID [2022-02-20 19:59:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:59:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {37111#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {37054#true} is VALID [2022-02-20 19:59:57,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {37054#true} assume !(1 == ~m_pc~0); {37054#true} is VALID [2022-02-20 19:59:57,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {37054#true} is_master_triggered_~__retres1~4#1 := 0; {37054#true} is VALID [2022-02-20 19:59:57,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {37054#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37054#true} is VALID [2022-02-20 19:59:57,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {37054#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {37054#true} is VALID [2022-02-20 19:59:57,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {37054#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {37054#true} is VALID [2022-02-20 19:59:57,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {37054#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {37054#true} is VALID [2022-02-20 19:59:57,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {37054#true} assume 1 == ~t1_pc~0; {37054#true} is VALID [2022-02-20 19:59:57,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {37054#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {37054#true} is VALID [2022-02-20 19:59:57,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {37054#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37054#true} is VALID [2022-02-20 19:59:57,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {37054#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {37054#true} is VALID [2022-02-20 19:59:57,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {37054#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {37054#true} is VALID [2022-02-20 19:59:57,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {37054#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {37054#true} is VALID [2022-02-20 19:59:57,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {37054#true} assume !(1 == ~t2_pc~0); {37054#true} is VALID [2022-02-20 19:59:57,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {37054#true} is_transmit2_triggered_~__retres1~6#1 := 0; {37054#true} is VALID [2022-02-20 19:59:57,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {37054#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37054#true} is VALID [2022-02-20 19:59:57,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {37054#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {37054#true} is VALID [2022-02-20 19:59:57,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {37054#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37054#true} is VALID [2022-02-20 19:59:57,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {37054#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {37054#true} is VALID [2022-02-20 19:59:57,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {37054#true} assume 1 == ~t3_pc~0; {37054#true} is VALID [2022-02-20 19:59:57,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {37054#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {37054#true} is VALID [2022-02-20 19:59:57,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {37054#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {37054#true} is VALID [2022-02-20 19:59:57,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {37054#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {37054#true} is VALID [2022-02-20 19:59:57,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {37054#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {37054#true} is VALID [2022-02-20 19:59:57,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,739 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {37054#true} {37055#false} #969#return; {37055#false} is VALID [2022-02-20 19:59:57,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:59:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {37110#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {37054#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {37054#true} assume !(1 == ~T2_E~0); {37054#true} is VALID [2022-02-20 19:59:57,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {37054#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {37054#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {37054#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {37054#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {37054#true} assume 1 == ~E_3~0;~E_3~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,748 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {37054#true} {37055#false} #971#return; {37055#false} is VALID [2022-02-20 19:59:57,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:59:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {37054#true} havoc ~__retres1~8; {37054#true} is VALID [2022-02-20 19:59:57,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {37054#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {37054#true} is VALID [2022-02-20 19:59:57,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {37054#true} #res := ~__retres1~8; {37054#true} is VALID [2022-02-20 19:59:57,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,753 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37054#true} {37055#false} #973#return; {37055#false} is VALID [2022-02-20 19:59:57,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {37054#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {37054#true} is VALID [2022-02-20 19:59:57,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {37054#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {37054#true} is VALID [2022-02-20 19:59:57,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {37054#true} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {37056#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:57,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {37056#(= ~t2_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret31#1, start_simulation2_#t~ret32#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {37056#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:57,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {37056#(= ~t2_i~0 1)} call update_channels2(); {37054#true} is VALID [2022-02-20 19:59:57,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,754 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37054#true} {37056#(= ~t2_i~0 1)} #965#return; {37056#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:57,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {37056#(= ~t2_i~0 1)} assume { :begin_inline_init_threads2 } true; {37056#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:57,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {37056#(= ~t2_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {37056#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:57,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {37056#(= ~t2_i~0 1)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {37056#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:57,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {37056#(= ~t2_i~0 1)} assume !(1 == ~t2_i~0);~t2_st~0 := 2; {37055#false} is VALID [2022-02-20 19:59:57,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {37055#false} assume 1 == ~t3_i~0;~t3_st~0 := 0; {37055#false} is VALID [2022-02-20 19:59:57,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {37055#false} assume { :end_inline_init_threads2 } true; {37055#false} is VALID [2022-02-20 19:59:57,762 INFO L272 TraceCheckUtils]: 13: Hoare triple {37055#false} call fire_delta_events2(); {37110#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:59:57,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {37110#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {37054#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {37054#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {37054#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {37054#true} assume 0 == ~E_M~0;~E_M~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {37054#true} assume 0 == ~E_1~0;~E_1~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {37054#true} assume !(0 == ~E_2~0); {37054#true} is VALID [2022-02-20 19:59:57,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {37054#true} assume 0 == ~E_3~0;~E_3~0 := 1; {37054#true} is VALID [2022-02-20 19:59:57,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,763 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37054#true} {37055#false} #967#return; {37055#false} is VALID [2022-02-20 19:59:57,763 INFO L272 TraceCheckUtils]: 24: Hoare triple {37055#false} call activate_threads2(); {37111#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:59:57,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {37111#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {37054#true} is VALID [2022-02-20 19:59:57,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {37054#true} assume !(1 == ~m_pc~0); {37054#true} is VALID [2022-02-20 19:59:57,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {37054#true} is_master_triggered_~__retres1~4#1 := 0; {37054#true} is VALID [2022-02-20 19:59:57,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {37054#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37054#true} is VALID [2022-02-20 19:59:57,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {37054#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {37054#true} is VALID [2022-02-20 19:59:57,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {37054#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {37054#true} is VALID [2022-02-20 19:59:57,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {37054#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {37054#true} is VALID [2022-02-20 19:59:57,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {37054#true} assume 1 == ~t1_pc~0; {37054#true} is VALID [2022-02-20 19:59:57,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {37054#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {37054#true} is VALID [2022-02-20 19:59:57,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {37054#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37054#true} is VALID [2022-02-20 19:59:57,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {37054#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {37054#true} is VALID [2022-02-20 19:59:57,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {37054#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {37054#true} is VALID [2022-02-20 19:59:57,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {37054#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {37054#true} is VALID [2022-02-20 19:59:57,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {37054#true} assume !(1 == ~t2_pc~0); {37054#true} is VALID [2022-02-20 19:59:57,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {37054#true} is_transmit2_triggered_~__retres1~6#1 := 0; {37054#true} is VALID [2022-02-20 19:59:57,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {37054#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37054#true} is VALID [2022-02-20 19:59:57,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {37054#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {37054#true} is VALID [2022-02-20 19:59:57,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {37054#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37054#true} is VALID [2022-02-20 19:59:57,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {37054#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {37054#true} is VALID [2022-02-20 19:59:57,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {37054#true} assume 1 == ~t3_pc~0; {37054#true} is VALID [2022-02-20 19:59:57,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {37054#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {37054#true} is VALID [2022-02-20 19:59:57,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {37054#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {37054#true} is VALID [2022-02-20 19:59:57,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {37054#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {37054#true} is VALID [2022-02-20 19:59:57,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {37054#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {37054#true} is VALID [2022-02-20 19:59:57,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,766 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37054#true} {37055#false} #969#return; {37055#false} is VALID [2022-02-20 19:59:57,766 INFO L272 TraceCheckUtils]: 51: Hoare triple {37055#false} call reset_delta_events2(); {37110#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:59:57,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {37110#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {37054#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {37054#true} assume !(1 == ~T2_E~0); {37054#true} is VALID [2022-02-20 19:59:57,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {37054#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {37054#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {37054#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,767 INFO L290 TraceCheckUtils]: 58: Hoare triple {37054#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {37054#true} assume 1 == ~E_3~0;~E_3~0 := 2; {37054#true} is VALID [2022-02-20 19:59:57,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,767 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {37054#true} {37055#false} #971#return; {37055#false} is VALID [2022-02-20 19:59:57,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {37055#false} assume !false; {37055#false} is VALID [2022-02-20 19:59:57,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {37055#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {37055#false} is VALID [2022-02-20 19:59:57,768 INFO L290 TraceCheckUtils]: 64: Hoare triple {37055#false} assume !false; {37055#false} is VALID [2022-02-20 19:59:57,768 INFO L272 TraceCheckUtils]: 65: Hoare triple {37055#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {37054#true} is VALID [2022-02-20 19:59:57,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {37054#true} havoc ~__retres1~8; {37054#true} is VALID [2022-02-20 19:59:57,768 INFO L290 TraceCheckUtils]: 67: Hoare triple {37054#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {37054#true} is VALID [2022-02-20 19:59:57,768 INFO L290 TraceCheckUtils]: 68: Hoare triple {37054#true} #res := ~__retres1~8; {37054#true} is VALID [2022-02-20 19:59:57,768 INFO L290 TraceCheckUtils]: 69: Hoare triple {37054#true} assume true; {37054#true} is VALID [2022-02-20 19:59:57,768 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {37054#true} {37055#false} #973#return; {37055#false} is VALID [2022-02-20 19:59:57,768 INFO L290 TraceCheckUtils]: 71: Hoare triple {37055#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {37055#false} is VALID [2022-02-20 19:59:57,769 INFO L290 TraceCheckUtils]: 72: Hoare triple {37055#false} assume 0 != eval2_~tmp~5#1; {37055#false} is VALID [2022-02-20 19:59:57,769 INFO L290 TraceCheckUtils]: 73: Hoare triple {37055#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {37055#false} is VALID [2022-02-20 19:59:57,769 INFO L290 TraceCheckUtils]: 74: Hoare triple {37055#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {37055#false} is VALID [2022-02-20 19:59:57,769 INFO L290 TraceCheckUtils]: 75: Hoare triple {37055#false} assume !(0 == ~m_pc~0); {37055#false} is VALID [2022-02-20 19:59:57,769 INFO L290 TraceCheckUtils]: 76: Hoare triple {37055#false} assume 1 == ~m_pc~0; {37055#false} is VALID [2022-02-20 19:59:57,769 INFO L290 TraceCheckUtils]: 77: Hoare triple {37055#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {37055#false} is VALID [2022-02-20 19:59:57,769 INFO L290 TraceCheckUtils]: 78: Hoare triple {37055#false} assume !false; {37055#false} is VALID [2022-02-20 19:59:57,769 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:59:57,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:57,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890004003] [2022-02-20 19:59:57,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890004003] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:57,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:57,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:57,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290871092] [2022-02-20 19:59:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:57,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:59:57,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:57,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:57,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:57,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:57,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:57,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:57,811 INFO L87 Difference]: Start difference. First operand 1792 states and 2335 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:59,162 INFO L93 Difference]: Finished difference Result 1979 states and 2623 transitions. [2022-02-20 19:59:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:59:59,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:59:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2022-02-20 19:59:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2022-02-20 19:59:59,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 663 transitions. [2022-02-20 19:59:59,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 663 edges. 663 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:59,743 INFO L225 Difference]: With dead ends: 1979 [2022-02-20 19:59:59,743 INFO L226 Difference]: Without dead ends: 1835 [2022-02-20 19:59:59,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:59,745 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 465 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:59,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 747 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:59:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-02-20 19:59:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1792. [2022-02-20 19:59:59,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:59,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1835 states. Second operand has 1792 states, 1415 states have (on average 1.3201413427561837) internal successors, (1868), 1440 states have internal predecessors, (1868), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:59,846 INFO L74 IsIncluded]: Start isIncluded. First operand 1835 states. Second operand has 1792 states, 1415 states have (on average 1.3201413427561837) internal successors, (1868), 1440 states have internal predecessors, (1868), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:59,848 INFO L87 Difference]: Start difference. First operand 1835 states. Second operand has 1792 states, 1415 states have (on average 1.3201413427561837) internal successors, (1868), 1440 states have internal predecessors, (1868), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:59,955 INFO L93 Difference]: Finished difference Result 1835 states and 2408 transitions. [2022-02-20 19:59:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2408 transitions. [2022-02-20 19:59:59,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:59,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:59,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 1792 states, 1415 states have (on average 1.3201413427561837) internal successors, (1868), 1440 states have internal predecessors, (1868), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) Second operand 1835 states. [2022-02-20 19:59:59,963 INFO L87 Difference]: Start difference. First operand has 1792 states, 1415 states have (on average 1.3201413427561837) internal successors, (1868), 1440 states have internal predecessors, (1868), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) Second operand 1835 states. [2022-02-20 20:00:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,078 INFO L93 Difference]: Finished difference Result 1835 states and 2408 transitions. [2022-02-20 20:00:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2408 transitions. [2022-02-20 20:00:00,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:00,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:00,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:00,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1415 states have (on average 1.3201413427561837) internal successors, (1868), 1440 states have internal predecessors, (1868), 209 states have call successors, (209), 139 states have call predecessors, (209), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 20:00:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2334 transitions. [2022-02-20 20:00:00,214 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2334 transitions. Word has length 79 [2022-02-20 20:00:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:00,215 INFO L470 AbstractCegarLoop]: Abstraction has 1792 states and 2334 transitions. [2022-02-20 20:00:00,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2334 transitions. [2022-02-20 20:00:00,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 20:00:00,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:00,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:00,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:00:00,216 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:00,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1839354316, now seen corresponding path program 1 times [2022-02-20 20:00:00,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:00,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450624320] [2022-02-20 20:00:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {45888#true} assume true; {45888#true} is VALID [2022-02-20 20:00:00,240 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {45888#true} {45890#(= ~M_E~0 2)} #965#return; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {45944#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume true; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,259 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45945#(= |old(~M_E~0)| 0)} {45890#(= ~M_E~0 2)} #967#return; {45889#false} is VALID [2022-02-20 20:00:00,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {45946#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {45888#true} is VALID [2022-02-20 20:00:00,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {45888#true} assume !(1 == ~m_pc~0); {45888#true} is VALID [2022-02-20 20:00:00,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {45888#true} is_master_triggered_~__retres1~4#1 := 0; {45888#true} is VALID [2022-02-20 20:00:00,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {45888#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {45888#true} is VALID [2022-02-20 20:00:00,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {45888#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {45888#true} is VALID [2022-02-20 20:00:00,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {45888#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {45888#true} is VALID [2022-02-20 20:00:00,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {45888#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {45888#true} is VALID [2022-02-20 20:00:00,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {45888#true} assume 1 == ~t1_pc~0; {45888#true} is VALID [2022-02-20 20:00:00,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {45888#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {45888#true} is VALID [2022-02-20 20:00:00,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {45888#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {45888#true} is VALID [2022-02-20 20:00:00,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {45888#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {45888#true} is VALID [2022-02-20 20:00:00,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {45888#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {45888#true} is VALID [2022-02-20 20:00:00,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {45888#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {45888#true} is VALID [2022-02-20 20:00:00,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {45888#true} assume !(1 == ~t2_pc~0); {45888#true} is VALID [2022-02-20 20:00:00,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {45888#true} is_transmit2_triggered_~__retres1~6#1 := 0; {45888#true} is VALID [2022-02-20 20:00:00,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {45888#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {45888#true} is VALID [2022-02-20 20:00:00,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {45888#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {45888#true} is VALID [2022-02-20 20:00:00,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {45888#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {45888#true} is VALID [2022-02-20 20:00:00,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {45888#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {45888#true} is VALID [2022-02-20 20:00:00,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {45888#true} assume 1 == ~t3_pc~0; {45888#true} is VALID [2022-02-20 20:00:00,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {45888#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {45888#true} is VALID [2022-02-20 20:00:00,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {45888#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {45888#true} is VALID [2022-02-20 20:00:00,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {45888#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {45888#true} is VALID [2022-02-20 20:00:00,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {45888#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {45888#true} is VALID [2022-02-20 20:00:00,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {45888#true} assume true; {45888#true} is VALID [2022-02-20 20:00:00,279 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45888#true} {45889#false} #969#return; {45889#false} is VALID [2022-02-20 20:00:00,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {45944#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {45888#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {45888#true} assume !(1 == ~T2_E~0); {45888#true} is VALID [2022-02-20 20:00:00,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {45888#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {45888#true} assume 1 == ~E_M~0;~E_M~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {45888#true} assume 1 == ~E_1~0;~E_1~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {45888#true} assume 1 == ~E_2~0;~E_2~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {45888#true} assume 1 == ~E_3~0;~E_3~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {45888#true} assume true; {45888#true} is VALID [2022-02-20 20:00:00,286 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45888#true} {45889#false} #971#return; {45889#false} is VALID [2022-02-20 20:00:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {45888#true} havoc ~__retres1~8; {45888#true} is VALID [2022-02-20 20:00:00,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {45888#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {45888#true} is VALID [2022-02-20 20:00:00,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {45888#true} #res := ~__retres1~8; {45888#true} is VALID [2022-02-20 20:00:00,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {45888#true} assume true; {45888#true} is VALID [2022-02-20 20:00:00,290 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45888#true} {45889#false} #973#return; {45889#false} is VALID [2022-02-20 20:00:00,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {45888#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {45890#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {45890#(= ~M_E~0 2)} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {45890#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret31#1, start_simulation2_#t~ret32#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {45890#(= ~M_E~0 2)} call update_channels2(); {45888#true} is VALID [2022-02-20 20:00:00,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {45888#true} assume true; {45888#true} is VALID [2022-02-20 20:00:00,293 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45888#true} {45890#(= ~M_E~0 2)} #965#return; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {45890#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {45890#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {45890#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {45890#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {45890#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {45890#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {45890#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:00,295 INFO L272 TraceCheckUtils]: 13: Hoare triple {45890#(= ~M_E~0 2)} call fire_delta_events2(); {45944#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:00,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {45944#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {45945#(= |old(~M_E~0)| 0)} assume true; {45945#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:00,297 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {45945#(= |old(~M_E~0)| 0)} {45890#(= ~M_E~0 2)} #967#return; {45889#false} is VALID [2022-02-20 20:00:00,298 INFO L272 TraceCheckUtils]: 24: Hoare triple {45889#false} call activate_threads2(); {45946#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:00,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {45946#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {45888#true} is VALID [2022-02-20 20:00:00,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {45888#true} assume !(1 == ~m_pc~0); {45888#true} is VALID [2022-02-20 20:00:00,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {45888#true} is_master_triggered_~__retres1~4#1 := 0; {45888#true} is VALID [2022-02-20 20:00:00,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {45888#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {45888#true} is VALID [2022-02-20 20:00:00,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {45888#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {45888#true} is VALID [2022-02-20 20:00:00,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {45888#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {45888#true} is VALID [2022-02-20 20:00:00,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {45888#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {45888#true} is VALID [2022-02-20 20:00:00,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {45888#true} assume 1 == ~t1_pc~0; {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {45888#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {45888#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {45888#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {45888#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {45888#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {45888#true} assume !(1 == ~t2_pc~0); {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {45888#true} is_transmit2_triggered_~__retres1~6#1 := 0; {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {45888#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {45888#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {45888#true} is VALID [2022-02-20 20:00:00,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {45888#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {45888#true} is VALID [2022-02-20 20:00:00,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {45888#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {45888#true} is VALID [2022-02-20 20:00:00,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {45888#true} assume 1 == ~t3_pc~0; {45888#true} is VALID [2022-02-20 20:00:00,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {45888#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {45888#true} is VALID [2022-02-20 20:00:00,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {45888#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {45888#true} is VALID [2022-02-20 20:00:00,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {45888#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {45888#true} is VALID [2022-02-20 20:00:00,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {45888#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {45888#true} is VALID [2022-02-20 20:00:00,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {45888#true} assume true; {45888#true} is VALID [2022-02-20 20:00:00,300 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {45888#true} {45889#false} #969#return; {45889#false} is VALID [2022-02-20 20:00:00,300 INFO L272 TraceCheckUtils]: 51: Hoare triple {45889#false} call reset_delta_events2(); {45944#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:00,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {45944#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {45888#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {45888#true} assume !(1 == ~T2_E~0); {45888#true} is VALID [2022-02-20 20:00:00,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {45888#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {45888#true} assume 1 == ~E_M~0;~E_M~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {45888#true} assume 1 == ~E_1~0;~E_1~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {45888#true} assume 1 == ~E_2~0;~E_2~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,301 INFO L290 TraceCheckUtils]: 59: Hoare triple {45888#true} assume 1 == ~E_3~0;~E_3~0 := 2; {45888#true} is VALID [2022-02-20 20:00:00,301 INFO L290 TraceCheckUtils]: 60: Hoare triple {45888#true} assume true; {45888#true} is VALID [2022-02-20 20:00:00,302 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {45888#true} {45889#false} #971#return; {45889#false} is VALID [2022-02-20 20:00:00,302 INFO L290 TraceCheckUtils]: 62: Hoare triple {45889#false} assume !false; {45889#false} is VALID [2022-02-20 20:00:00,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {45889#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {45889#false} is VALID [2022-02-20 20:00:00,302 INFO L290 TraceCheckUtils]: 64: Hoare triple {45889#false} assume !false; {45889#false} is VALID [2022-02-20 20:00:00,302 INFO L272 TraceCheckUtils]: 65: Hoare triple {45889#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {45888#true} is VALID [2022-02-20 20:00:00,302 INFO L290 TraceCheckUtils]: 66: Hoare triple {45888#true} havoc ~__retres1~8; {45888#true} is VALID [2022-02-20 20:00:00,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {45888#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {45888#true} is VALID [2022-02-20 20:00:00,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {45888#true} #res := ~__retres1~8; {45888#true} is VALID [2022-02-20 20:00:00,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {45888#true} assume true; {45888#true} is VALID [2022-02-20 20:00:00,302 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {45888#true} {45889#false} #973#return; {45889#false} is VALID [2022-02-20 20:00:00,303 INFO L290 TraceCheckUtils]: 71: Hoare triple {45889#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {45889#false} is VALID [2022-02-20 20:00:00,303 INFO L290 TraceCheckUtils]: 72: Hoare triple {45889#false} assume 0 != eval2_~tmp~5#1; {45889#false} is VALID [2022-02-20 20:00:00,303 INFO L290 TraceCheckUtils]: 73: Hoare triple {45889#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {45889#false} is VALID [2022-02-20 20:00:00,303 INFO L290 TraceCheckUtils]: 74: Hoare triple {45889#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {45889#false} is VALID [2022-02-20 20:00:00,303 INFO L290 TraceCheckUtils]: 75: Hoare triple {45889#false} assume !(0 == ~m_pc~0); {45889#false} is VALID [2022-02-20 20:00:00,303 INFO L290 TraceCheckUtils]: 76: Hoare triple {45889#false} assume 1 == ~m_pc~0; {45889#false} is VALID [2022-02-20 20:00:00,303 INFO L290 TraceCheckUtils]: 77: Hoare triple {45889#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {45889#false} is VALID [2022-02-20 20:00:00,303 INFO L290 TraceCheckUtils]: 78: Hoare triple {45889#false} assume !false; {45889#false} is VALID [2022-02-20 20:00:00,304 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 20:00:00,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:00,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450624320] [2022-02-20 20:00:00,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450624320] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:00,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:00,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:00,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424503256] [2022-02-20 20:00:00,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:00,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:00,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:00,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 20:00:00,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:00,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:00,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:00,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:00,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:00,351 INFO L87 Difference]: Start difference. First operand 1792 states and 2334 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 20:00:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:02,654 INFO L93 Difference]: Finished difference Result 2160 states and 2901 transitions. [2022-02-20 20:00:02,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:00:02,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:02,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 20:00:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 941 transitions. [2022-02-20 20:00:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 20:00:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 941 transitions. [2022-02-20 20:00:02,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 941 transitions. [2022-02-20 20:00:03,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 941 edges. 941 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:03,469 INFO L225 Difference]: With dead ends: 2160 [2022-02-20 20:00:03,469 INFO L226 Difference]: Without dead ends: 2019 [2022-02-20 20:00:03,470 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 20:00:03,472 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 762 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:03,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [784 Valid, 959 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 20:00:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2022-02-20 20:00:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1934. [2022-02-20 20:00:03,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:03,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2019 states. Second operand has 1934 states, 1538 states have (on average 1.336150845253576) internal successors, (2055), 1564 states have internal predecessors, (2055), 221 states have call successors, (221), 145 states have call predecessors, (221), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) [2022-02-20 20:00:03,568 INFO L74 IsIncluded]: Start isIncluded. First operand 2019 states. Second operand has 1934 states, 1538 states have (on average 1.336150845253576) internal successors, (2055), 1564 states have internal predecessors, (2055), 221 states have call successors, (221), 145 states have call predecessors, (221), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) [2022-02-20 20:00:03,570 INFO L87 Difference]: Start difference. First operand 2019 states. Second operand has 1934 states, 1538 states have (on average 1.336150845253576) internal successors, (2055), 1564 states have internal predecessors, (2055), 221 states have call successors, (221), 145 states have call predecessors, (221), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) [2022-02-20 20:00:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:03,700 INFO L93 Difference]: Finished difference Result 2019 states and 2686 transitions. [2022-02-20 20:00:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2686 transitions. [2022-02-20 20:00:03,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:03,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:03,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 1934 states, 1538 states have (on average 1.336150845253576) internal successors, (2055), 1564 states have internal predecessors, (2055), 221 states have call successors, (221), 145 states have call predecessors, (221), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) Second operand 2019 states. [2022-02-20 20:00:03,708 INFO L87 Difference]: Start difference. First operand has 1934 states, 1538 states have (on average 1.336150845253576) internal successors, (2055), 1564 states have internal predecessors, (2055), 221 states have call successors, (221), 145 states have call predecessors, (221), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) Second operand 2019 states. [2022-02-20 20:00:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:03,841 INFO L93 Difference]: Finished difference Result 2019 states and 2686 transitions. [2022-02-20 20:00:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2686 transitions. [2022-02-20 20:00:03,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:03,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:03,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:03,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1538 states have (on average 1.336150845253576) internal successors, (2055), 1564 states have internal predecessors, (2055), 221 states have call successors, (221), 145 states have call predecessors, (221), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) [2022-02-20 20:00:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2548 transitions. [2022-02-20 20:00:04,025 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2548 transitions. Word has length 79 [2022-02-20 20:00:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:04,026 INFO L470 AbstractCegarLoop]: Abstraction has 1934 states and 2548 transitions. [2022-02-20 20:00:04,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 20:00:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2548 transitions. [2022-02-20 20:00:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 20:00:04,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:04,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:04,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:04,028 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1602306120, now seen corresponding path program 1 times [2022-02-20 20:00:04,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:04,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659698607] [2022-02-20 20:00:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {55509#true} assume true; {55509#true} is VALID [2022-02-20 20:00:04,059 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {55509#true} {55511#(= ~T1_E~0 ~M_E~0)} #965#return; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {55565#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {55566#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:04,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {55566#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,089 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {55511#(= ~T1_E~0 ~M_E~0)} #967#return; {55510#false} is VALID [2022-02-20 20:00:04,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {55568#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {55509#true} is VALID [2022-02-20 20:00:04,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {55509#true} assume !(1 == ~m_pc~0); {55509#true} is VALID [2022-02-20 20:00:04,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {55509#true} is_master_triggered_~__retres1~4#1 := 0; {55509#true} is VALID [2022-02-20 20:00:04,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {55509#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {55509#true} is VALID [2022-02-20 20:00:04,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {55509#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {55509#true} is VALID [2022-02-20 20:00:04,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {55509#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {55509#true} is VALID [2022-02-20 20:00:04,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {55509#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {55509#true} is VALID [2022-02-20 20:00:04,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {55509#true} assume 1 == ~t1_pc~0; {55509#true} is VALID [2022-02-20 20:00:04,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {55509#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {55509#true} is VALID [2022-02-20 20:00:04,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {55509#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {55509#true} is VALID [2022-02-20 20:00:04,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {55509#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {55509#true} is VALID [2022-02-20 20:00:04,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {55509#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {55509#true} is VALID [2022-02-20 20:00:04,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {55509#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {55509#true} is VALID [2022-02-20 20:00:04,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {55509#true} assume !(1 == ~t2_pc~0); {55509#true} is VALID [2022-02-20 20:00:04,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {55509#true} is_transmit2_triggered_~__retres1~6#1 := 0; {55509#true} is VALID [2022-02-20 20:00:04,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {55509#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {55509#true} is VALID [2022-02-20 20:00:04,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {55509#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {55509#true} is VALID [2022-02-20 20:00:04,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {55509#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {55509#true} is VALID [2022-02-20 20:00:04,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {55509#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {55509#true} is VALID [2022-02-20 20:00:04,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {55509#true} assume 1 == ~t3_pc~0; {55509#true} is VALID [2022-02-20 20:00:04,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {55509#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {55509#true} is VALID [2022-02-20 20:00:04,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {55509#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {55509#true} is VALID [2022-02-20 20:00:04,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {55509#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {55509#true} is VALID [2022-02-20 20:00:04,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {55509#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {55509#true} is VALID [2022-02-20 20:00:04,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {55509#true} assume true; {55509#true} is VALID [2022-02-20 20:00:04,108 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {55509#true} {55510#false} #969#return; {55510#false} is VALID [2022-02-20 20:00:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {55565#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {55509#true} is VALID [2022-02-20 20:00:04,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {55509#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {55509#true} assume !(1 == ~T2_E~0); {55509#true} is VALID [2022-02-20 20:00:04,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {55509#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {55509#true} assume 1 == ~E_M~0;~E_M~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {55509#true} assume 1 == ~E_1~0;~E_1~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {55509#true} assume 1 == ~E_2~0;~E_2~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {55509#true} assume 1 == ~E_3~0;~E_3~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {55509#true} assume true; {55509#true} is VALID [2022-02-20 20:00:04,113 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {55509#true} {55510#false} #971#return; {55510#false} is VALID [2022-02-20 20:00:04,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {55509#true} havoc ~__retres1~8; {55509#true} is VALID [2022-02-20 20:00:04,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {55509#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {55509#true} is VALID [2022-02-20 20:00:04,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {55509#true} #res := ~__retres1~8; {55509#true} is VALID [2022-02-20 20:00:04,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {55509#true} assume true; {55509#true} is VALID [2022-02-20 20:00:04,117 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55509#true} {55510#false} #973#return; {55510#false} is VALID [2022-02-20 20:00:04,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {55509#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret31#1, start_simulation2_#t~ret32#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {55509#true} is VALID [2022-02-20 20:00:04,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {55509#true} assume true; {55509#true} is VALID [2022-02-20 20:00:04,119 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55509#true} {55511#(= ~T1_E~0 ~M_E~0)} #965#return; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {55511#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:04,122 INFO L272 TraceCheckUtils]: 13: Hoare triple {55511#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {55565#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:04,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {55565#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {55566#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:04,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {55566#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:04,125 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55567#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {55511#(= ~T1_E~0 ~M_E~0)} #967#return; {55510#false} is VALID [2022-02-20 20:00:04,125 INFO L272 TraceCheckUtils]: 24: Hoare triple {55510#false} call activate_threads2(); {55568#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:04,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {55568#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {55509#true} is VALID [2022-02-20 20:00:04,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {55509#true} assume !(1 == ~m_pc~0); {55509#true} is VALID [2022-02-20 20:00:04,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {55509#true} is_master_triggered_~__retres1~4#1 := 0; {55509#true} is VALID [2022-02-20 20:00:04,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {55509#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {55509#true} is VALID [2022-02-20 20:00:04,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {55509#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {55509#true} is VALID [2022-02-20 20:00:04,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {55509#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {55509#true} is VALID [2022-02-20 20:00:04,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {55509#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {55509#true} is VALID [2022-02-20 20:00:04,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {55509#true} assume 1 == ~t1_pc~0; {55509#true} is VALID [2022-02-20 20:00:04,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {55509#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {55509#true} is VALID [2022-02-20 20:00:04,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {55509#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {55509#true} is VALID [2022-02-20 20:00:04,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {55509#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {55509#true} is VALID [2022-02-20 20:00:04,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {55509#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {55509#true} is VALID [2022-02-20 20:00:04,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {55509#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {55509#true} is VALID [2022-02-20 20:00:04,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {55509#true} assume !(1 == ~t2_pc~0); {55509#true} is VALID [2022-02-20 20:00:04,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {55509#true} is_transmit2_triggered_~__retres1~6#1 := 0; {55509#true} is VALID [2022-02-20 20:00:04,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {55509#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {55509#true} is VALID [2022-02-20 20:00:04,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {55509#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {55509#true} is VALID [2022-02-20 20:00:04,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {55509#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {55509#true} is VALID [2022-02-20 20:00:04,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {55509#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {55509#true} is VALID [2022-02-20 20:00:04,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {55509#true} assume 1 == ~t3_pc~0; {55509#true} is VALID [2022-02-20 20:00:04,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {55509#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {55509#true} is VALID [2022-02-20 20:00:04,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {55509#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {55509#true} is VALID [2022-02-20 20:00:04,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {55509#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {55509#true} is VALID [2022-02-20 20:00:04,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {55509#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {55509#true} is VALID [2022-02-20 20:00:04,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {55509#true} assume true; {55509#true} is VALID [2022-02-20 20:00:04,128 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {55509#true} {55510#false} #969#return; {55510#false} is VALID [2022-02-20 20:00:04,129 INFO L272 TraceCheckUtils]: 51: Hoare triple {55510#false} call reset_delta_events2(); {55565#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:04,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {55565#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {55509#true} is VALID [2022-02-20 20:00:04,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {55509#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {55509#true} assume !(1 == ~T2_E~0); {55509#true} is VALID [2022-02-20 20:00:04,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {55509#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {55509#true} assume 1 == ~E_M~0;~E_M~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,129 INFO L290 TraceCheckUtils]: 57: Hoare triple {55509#true} assume 1 == ~E_1~0;~E_1~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,129 INFO L290 TraceCheckUtils]: 58: Hoare triple {55509#true} assume 1 == ~E_2~0;~E_2~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {55509#true} assume 1 == ~E_3~0;~E_3~0 := 2; {55509#true} is VALID [2022-02-20 20:00:04,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {55509#true} assume true; {55509#true} is VALID [2022-02-20 20:00:04,130 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {55509#true} {55510#false} #971#return; {55510#false} is VALID [2022-02-20 20:00:04,130 INFO L290 TraceCheckUtils]: 62: Hoare triple {55510#false} assume !false; {55510#false} is VALID [2022-02-20 20:00:04,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {55510#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {55510#false} is VALID [2022-02-20 20:00:04,130 INFO L290 TraceCheckUtils]: 64: Hoare triple {55510#false} assume !false; {55510#false} is VALID [2022-02-20 20:00:04,130 INFO L272 TraceCheckUtils]: 65: Hoare triple {55510#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {55509#true} is VALID [2022-02-20 20:00:04,130 INFO L290 TraceCheckUtils]: 66: Hoare triple {55509#true} havoc ~__retres1~8; {55509#true} is VALID [2022-02-20 20:00:04,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {55509#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {55509#true} is VALID [2022-02-20 20:00:04,131 INFO L290 TraceCheckUtils]: 68: Hoare triple {55509#true} #res := ~__retres1~8; {55509#true} is VALID [2022-02-20 20:00:04,131 INFO L290 TraceCheckUtils]: 69: Hoare triple {55509#true} assume true; {55509#true} is VALID [2022-02-20 20:00:04,131 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {55509#true} {55510#false} #973#return; {55510#false} is VALID [2022-02-20 20:00:04,131 INFO L290 TraceCheckUtils]: 71: Hoare triple {55510#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {55510#false} is VALID [2022-02-20 20:00:04,131 INFO L290 TraceCheckUtils]: 72: Hoare triple {55510#false} assume 0 != eval2_~tmp~5#1; {55510#false} is VALID [2022-02-20 20:00:04,131 INFO L290 TraceCheckUtils]: 73: Hoare triple {55510#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {55510#false} is VALID [2022-02-20 20:00:04,132 INFO L290 TraceCheckUtils]: 74: Hoare triple {55510#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {55510#false} is VALID [2022-02-20 20:00:04,132 INFO L290 TraceCheckUtils]: 75: Hoare triple {55510#false} assume !(0 == ~m_pc~0); {55510#false} is VALID [2022-02-20 20:00:04,132 INFO L290 TraceCheckUtils]: 76: Hoare triple {55510#false} assume 1 == ~m_pc~0; {55510#false} is VALID [2022-02-20 20:00:04,132 INFO L290 TraceCheckUtils]: 77: Hoare triple {55510#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {55510#false} is VALID [2022-02-20 20:00:04,132 INFO L290 TraceCheckUtils]: 78: Hoare triple {55510#false} assume !false; {55510#false} is VALID [2022-02-20 20:00:04,132 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 20:00:04,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:04,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659698607] [2022-02-20 20:00:04,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659698607] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:04,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:04,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:04,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072830339] [2022-02-20 20:00:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:04,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:04,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:04,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:04,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:04,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:04,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:04,174 INFO L87 Difference]: Start difference. First operand 1934 states and 2548 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:07,223 INFO L93 Difference]: Finished difference Result 2488 states and 3394 transitions. [2022-02-20 20:00:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:07,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 945 transitions. [2022-02-20 20:00:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 945 transitions. [2022-02-20 20:00:07,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 945 transitions. [2022-02-20 20:00:07,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 945 edges. 945 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:08,103 INFO L225 Difference]: With dead ends: 2488 [2022-02-20 20:00:08,103 INFO L226 Difference]: Without dead ends: 2205 [2022-02-20 20:00:08,104 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 20:00:08,104 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 756 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:08,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [778 Valid, 1466 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2022-02-20 20:00:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2067. [2022-02-20 20:00:08,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:08,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2205 states. Second operand has 2067 states, 1652 states have (on average 1.3462469733656175) internal successors, (2224), 1679 states have internal predecessors, (2224), 233 states have call successors, (233), 151 states have call predecessors, (233), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) [2022-02-20 20:00:08,212 INFO L74 IsIncluded]: Start isIncluded. First operand 2205 states. Second operand has 2067 states, 1652 states have (on average 1.3462469733656175) internal successors, (2224), 1679 states have internal predecessors, (2224), 233 states have call successors, (233), 151 states have call predecessors, (233), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) [2022-02-20 20:00:08,214 INFO L87 Difference]: Start difference. First operand 2205 states. Second operand has 2067 states, 1652 states have (on average 1.3462469733656175) internal successors, (2224), 1679 states have internal predecessors, (2224), 233 states have call successors, (233), 151 states have call predecessors, (233), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) [2022-02-20 20:00:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:08,347 INFO L93 Difference]: Finished difference Result 2205 states and 2968 transitions. [2022-02-20 20:00:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2968 transitions. [2022-02-20 20:00:08,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:08,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:08,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 2067 states, 1652 states have (on average 1.3462469733656175) internal successors, (2224), 1679 states have internal predecessors, (2224), 233 states have call successors, (233), 151 states have call predecessors, (233), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) Second operand 2205 states. [2022-02-20 20:00:08,355 INFO L87 Difference]: Start difference. First operand has 2067 states, 1652 states have (on average 1.3462469733656175) internal successors, (2224), 1679 states have internal predecessors, (2224), 233 states have call successors, (233), 151 states have call predecessors, (233), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) Second operand 2205 states. [2022-02-20 20:00:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:08,488 INFO L93 Difference]: Finished difference Result 2205 states and 2968 transitions. [2022-02-20 20:00:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2968 transitions. [2022-02-20 20:00:08,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:08,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:08,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:08,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1652 states have (on average 1.3462469733656175) internal successors, (2224), 1679 states have internal predecessors, (2224), 233 states have call successors, (233), 151 states have call predecessors, (233), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) [2022-02-20 20:00:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2743 transitions. [2022-02-20 20:00:08,654 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2743 transitions. Word has length 79 [2022-02-20 20:00:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:08,654 INFO L470 AbstractCegarLoop]: Abstraction has 2067 states and 2743 transitions. [2022-02-20 20:00:08,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2743 transitions. [2022-02-20 20:00:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 20:00:08,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:08,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:08,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:00:08,656 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:08,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1656699018, now seen corresponding path program 1 times [2022-02-20 20:00:08,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:08,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139742187] [2022-02-20 20:00:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {66109#true} assume true; {66109#true} is VALID [2022-02-20 20:00:08,681 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {66109#true} {66111#(= ~T2_E~0 ~M_E~0)} #965#return; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {66165#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {66166#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:08,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {66166#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {66166#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:08,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {66166#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,720 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {66111#(= ~T2_E~0 ~M_E~0)} #967#return; {66110#false} is VALID [2022-02-20 20:00:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {66168#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {66109#true} is VALID [2022-02-20 20:00:08,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {66109#true} assume !(1 == ~m_pc~0); {66109#true} is VALID [2022-02-20 20:00:08,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {66109#true} is_master_triggered_~__retres1~4#1 := 0; {66109#true} is VALID [2022-02-20 20:00:08,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {66109#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {66109#true} is VALID [2022-02-20 20:00:08,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {66109#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {66109#true} is VALID [2022-02-20 20:00:08,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {66109#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {66109#true} is VALID [2022-02-20 20:00:08,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {66109#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {66109#true} is VALID [2022-02-20 20:00:08,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {66109#true} assume 1 == ~t1_pc~0; {66109#true} is VALID [2022-02-20 20:00:08,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {66109#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {66109#true} is VALID [2022-02-20 20:00:08,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {66109#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {66109#true} is VALID [2022-02-20 20:00:08,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {66109#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {66109#true} is VALID [2022-02-20 20:00:08,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {66109#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {66109#true} is VALID [2022-02-20 20:00:08,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {66109#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {66109#true} is VALID [2022-02-20 20:00:08,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {66109#true} assume !(1 == ~t2_pc~0); {66109#true} is VALID [2022-02-20 20:00:08,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {66109#true} is_transmit2_triggered_~__retres1~6#1 := 0; {66109#true} is VALID [2022-02-20 20:00:08,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {66109#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {66109#true} is VALID [2022-02-20 20:00:08,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {66109#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {66109#true} is VALID [2022-02-20 20:00:08,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {66109#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {66109#true} is VALID [2022-02-20 20:00:08,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {66109#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {66109#true} is VALID [2022-02-20 20:00:08,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {66109#true} assume 1 == ~t3_pc~0; {66109#true} is VALID [2022-02-20 20:00:08,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {66109#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {66109#true} is VALID [2022-02-20 20:00:08,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {66109#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {66109#true} is VALID [2022-02-20 20:00:08,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {66109#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {66109#true} is VALID [2022-02-20 20:00:08,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {66109#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {66109#true} is VALID [2022-02-20 20:00:08,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {66109#true} assume true; {66109#true} is VALID [2022-02-20 20:00:08,736 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {66109#true} {66110#false} #969#return; {66110#false} is VALID [2022-02-20 20:00:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {66165#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {66109#true} is VALID [2022-02-20 20:00:08,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {66109#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {66109#true} assume !(1 == ~T2_E~0); {66109#true} is VALID [2022-02-20 20:00:08,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {66109#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {66109#true} assume 1 == ~E_M~0;~E_M~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {66109#true} assume 1 == ~E_1~0;~E_1~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {66109#true} assume 1 == ~E_2~0;~E_2~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {66109#true} assume 1 == ~E_3~0;~E_3~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {66109#true} assume true; {66109#true} is VALID [2022-02-20 20:00:08,743 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {66109#true} {66110#false} #971#return; {66110#false} is VALID [2022-02-20 20:00:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:08,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {66109#true} havoc ~__retres1~8; {66109#true} is VALID [2022-02-20 20:00:08,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {66109#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {66109#true} is VALID [2022-02-20 20:00:08,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {66109#true} #res := ~__retres1~8; {66109#true} is VALID [2022-02-20 20:00:08,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {66109#true} assume true; {66109#true} is VALID [2022-02-20 20:00:08,747 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66109#true} {66110#false} #973#return; {66110#false} is VALID [2022-02-20 20:00:08,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {66109#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret31#1, start_simulation2_#t~ret32#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} call update_channels2(); {66109#true} is VALID [2022-02-20 20:00:08,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {66109#true} assume true; {66109#true} is VALID [2022-02-20 20:00:08,749 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66109#true} {66111#(= ~T2_E~0 ~M_E~0)} #965#return; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {66111#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:08,751 INFO L272 TraceCheckUtils]: 13: Hoare triple {66111#(= ~T2_E~0 ~M_E~0)} call fire_delta_events2(); {66165#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:08,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {66165#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {66166#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:08,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {66166#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {66166#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:08,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {66166#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:08,754 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {66167#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {66111#(= ~T2_E~0 ~M_E~0)} #967#return; {66110#false} is VALID [2022-02-20 20:00:08,754 INFO L272 TraceCheckUtils]: 24: Hoare triple {66110#false} call activate_threads2(); {66168#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:08,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {66168#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {66109#true} is VALID [2022-02-20 20:00:08,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {66109#true} assume !(1 == ~m_pc~0); {66109#true} is VALID [2022-02-20 20:00:08,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {66109#true} is_master_triggered_~__retres1~4#1 := 0; {66109#true} is VALID [2022-02-20 20:00:08,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {66109#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {66109#true} is VALID [2022-02-20 20:00:08,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {66109#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {66109#true} is VALID [2022-02-20 20:00:08,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {66109#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {66109#true} is VALID [2022-02-20 20:00:08,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {66109#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {66109#true} is VALID [2022-02-20 20:00:08,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {66109#true} assume 1 == ~t1_pc~0; {66109#true} is VALID [2022-02-20 20:00:08,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {66109#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {66109#true} is VALID [2022-02-20 20:00:08,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {66109#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {66109#true} is VALID [2022-02-20 20:00:08,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {66109#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {66109#true} is VALID [2022-02-20 20:00:08,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {66109#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {66109#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {66109#true} assume !(1 == ~t2_pc~0); {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {66109#true} is_transmit2_triggered_~__retres1~6#1 := 0; {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {66109#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {66109#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {66109#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {66109#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {66109#true} assume 1 == ~t3_pc~0; {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {66109#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {66109#true} is VALID [2022-02-20 20:00:08,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {66109#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {66109#true} is VALID [2022-02-20 20:00:08,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {66109#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {66109#true} is VALID [2022-02-20 20:00:08,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {66109#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {66109#true} is VALID [2022-02-20 20:00:08,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {66109#true} assume true; {66109#true} is VALID [2022-02-20 20:00:08,757 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {66109#true} {66110#false} #969#return; {66110#false} is VALID [2022-02-20 20:00:08,757 INFO L272 TraceCheckUtils]: 51: Hoare triple {66110#false} call reset_delta_events2(); {66165#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:08,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {66165#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {66109#true} is VALID [2022-02-20 20:00:08,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {66109#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {66109#true} assume !(1 == ~T2_E~0); {66109#true} is VALID [2022-02-20 20:00:08,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {66109#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,758 INFO L290 TraceCheckUtils]: 56: Hoare triple {66109#true} assume 1 == ~E_M~0;~E_M~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {66109#true} assume 1 == ~E_1~0;~E_1~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {66109#true} assume 1 == ~E_2~0;~E_2~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {66109#true} assume 1 == ~E_3~0;~E_3~0 := 2; {66109#true} is VALID [2022-02-20 20:00:08,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {66109#true} assume true; {66109#true} is VALID [2022-02-20 20:00:08,758 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {66109#true} {66110#false} #971#return; {66110#false} is VALID [2022-02-20 20:00:08,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {66110#false} assume !false; {66110#false} is VALID [2022-02-20 20:00:08,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {66110#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {66110#false} is VALID [2022-02-20 20:00:08,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {66110#false} assume !false; {66110#false} is VALID [2022-02-20 20:00:08,759 INFO L272 TraceCheckUtils]: 65: Hoare triple {66110#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {66109#true} is VALID [2022-02-20 20:00:08,759 INFO L290 TraceCheckUtils]: 66: Hoare triple {66109#true} havoc ~__retres1~8; {66109#true} is VALID [2022-02-20 20:00:08,759 INFO L290 TraceCheckUtils]: 67: Hoare triple {66109#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {66109#true} is VALID [2022-02-20 20:00:08,759 INFO L290 TraceCheckUtils]: 68: Hoare triple {66109#true} #res := ~__retres1~8; {66109#true} is VALID [2022-02-20 20:00:08,759 INFO L290 TraceCheckUtils]: 69: Hoare triple {66109#true} assume true; {66109#true} is VALID [2022-02-20 20:00:08,759 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {66109#true} {66110#false} #973#return; {66110#false} is VALID [2022-02-20 20:00:08,759 INFO L290 TraceCheckUtils]: 71: Hoare triple {66110#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {66110#false} is VALID [2022-02-20 20:00:08,759 INFO L290 TraceCheckUtils]: 72: Hoare triple {66110#false} assume 0 != eval2_~tmp~5#1; {66110#false} is VALID [2022-02-20 20:00:08,759 INFO L290 TraceCheckUtils]: 73: Hoare triple {66110#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {66110#false} is VALID [2022-02-20 20:00:08,759 INFO L290 TraceCheckUtils]: 74: Hoare triple {66110#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {66110#false} is VALID [2022-02-20 20:00:08,760 INFO L290 TraceCheckUtils]: 75: Hoare triple {66110#false} assume !(0 == ~m_pc~0); {66110#false} is VALID [2022-02-20 20:00:08,760 INFO L290 TraceCheckUtils]: 76: Hoare triple {66110#false} assume 1 == ~m_pc~0; {66110#false} is VALID [2022-02-20 20:00:08,760 INFO L290 TraceCheckUtils]: 77: Hoare triple {66110#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {66110#false} is VALID [2022-02-20 20:00:08,760 INFO L290 TraceCheckUtils]: 78: Hoare triple {66110#false} assume !false; {66110#false} is VALID [2022-02-20 20:00:08,760 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 20:00:08,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:08,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139742187] [2022-02-20 20:00:08,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139742187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:08,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:08,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:08,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460051945] [2022-02-20 20:00:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:08,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:08,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:08,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:08,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:08,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:08,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:08,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:08,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:08,800 INFO L87 Difference]: Start difference. First operand 2067 states and 2743 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:11,797 INFO L93 Difference]: Finished difference Result 2970 states and 4117 transitions. [2022-02-20 20:00:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:11,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 950 transitions. [2022-02-20 20:00:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 950 transitions. [2022-02-20 20:00:11,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 950 transitions. [2022-02-20 20:00:12,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:12,697 INFO L225 Difference]: With dead ends: 2970 [2022-02-20 20:00:12,698 INFO L226 Difference]: Without dead ends: 2554 [2022-02-20 20:00:12,699 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 20:00:12,700 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 793 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:12,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [815 Valid, 1149 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-02-20 20:00:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2334. [2022-02-20 20:00:12,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:12,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2554 states. Second operand has 2334 states, 1881 states have (on average 1.3625730994152048) internal successors, (2563), 1910 states have internal predecessors, (2563), 257 states have call successors, (257), 163 states have call predecessors, (257), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) [2022-02-20 20:00:12,795 INFO L74 IsIncluded]: Start isIncluded. First operand 2554 states. Second operand has 2334 states, 1881 states have (on average 1.3625730994152048) internal successors, (2563), 1910 states have internal predecessors, (2563), 257 states have call successors, (257), 163 states have call predecessors, (257), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) [2022-02-20 20:00:12,797 INFO L87 Difference]: Start difference. First operand 2554 states. Second operand has 2334 states, 1881 states have (on average 1.3625730994152048) internal successors, (2563), 1910 states have internal predecessors, (2563), 257 states have call successors, (257), 163 states have call predecessors, (257), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) [2022-02-20 20:00:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:12,955 INFO L93 Difference]: Finished difference Result 2554 states and 3493 transitions. [2022-02-20 20:00:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3493 transitions. [2022-02-20 20:00:12,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:12,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:12,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 2334 states, 1881 states have (on average 1.3625730994152048) internal successors, (2563), 1910 states have internal predecessors, (2563), 257 states have call successors, (257), 163 states have call predecessors, (257), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) Second operand 2554 states. [2022-02-20 20:00:12,964 INFO L87 Difference]: Start difference. First operand has 2334 states, 1881 states have (on average 1.3625730994152048) internal successors, (2563), 1910 states have internal predecessors, (2563), 257 states have call successors, (257), 163 states have call predecessors, (257), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) Second operand 2554 states. [2022-02-20 20:00:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:13,128 INFO L93 Difference]: Finished difference Result 2554 states and 3493 transitions. [2022-02-20 20:00:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3493 transitions. [2022-02-20 20:00:13,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:13,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:13,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:13,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 1881 states have (on average 1.3625730994152048) internal successors, (2563), 1910 states have internal predecessors, (2563), 257 states have call successors, (257), 163 states have call predecessors, (257), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) [2022-02-20 20:00:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3138 transitions. [2022-02-20 20:00:13,365 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3138 transitions. Word has length 79 [2022-02-20 20:00:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:13,366 INFO L470 AbstractCegarLoop]: Abstraction has 2334 states and 3138 transitions. [2022-02-20 20:00:13,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3138 transitions. [2022-02-20 20:00:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 20:00:13,367 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:13,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:13,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:00:13,368 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2074095624, now seen corresponding path program 1 times [2022-02-20 20:00:13,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:13,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356101656] [2022-02-20 20:00:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:13,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:13,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {78383#true} assume true; {78383#true} is VALID [2022-02-20 20:00:13,393 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {78383#true} {78385#(= ~T3_E~0 ~M_E~0)} #965#return; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:13,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {78439#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:13,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T1_E~0); {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:13,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T2_E~0); {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:13,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume true; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,424 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} {78385#(= ~T3_E~0 ~M_E~0)} #967#return; {78384#false} is VALID [2022-02-20 20:00:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:13,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {78442#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {78383#true} is VALID [2022-02-20 20:00:13,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {78383#true} assume !(1 == ~m_pc~0); {78383#true} is VALID [2022-02-20 20:00:13,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {78383#true} is_master_triggered_~__retres1~4#1 := 0; {78383#true} is VALID [2022-02-20 20:00:13,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {78383#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {78383#true} is VALID [2022-02-20 20:00:13,438 INFO L290 TraceCheckUtils]: 4: Hoare triple {78383#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {78383#true} is VALID [2022-02-20 20:00:13,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {78383#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {78383#true} is VALID [2022-02-20 20:00:13,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {78383#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {78383#true} is VALID [2022-02-20 20:00:13,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {78383#true} assume 1 == ~t1_pc~0; {78383#true} is VALID [2022-02-20 20:00:13,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {78383#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {78383#true} is VALID [2022-02-20 20:00:13,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {78383#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {78383#true} is VALID [2022-02-20 20:00:13,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {78383#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {78383#true} is VALID [2022-02-20 20:00:13,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {78383#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {78383#true} is VALID [2022-02-20 20:00:13,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {78383#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {78383#true} is VALID [2022-02-20 20:00:13,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {78383#true} assume !(1 == ~t2_pc~0); {78383#true} is VALID [2022-02-20 20:00:13,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {78383#true} is_transmit2_triggered_~__retres1~6#1 := 0; {78383#true} is VALID [2022-02-20 20:00:13,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {78383#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {78383#true} is VALID [2022-02-20 20:00:13,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {78383#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {78383#true} is VALID [2022-02-20 20:00:13,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {78383#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {78383#true} is VALID [2022-02-20 20:00:13,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {78383#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {78383#true} is VALID [2022-02-20 20:00:13,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {78383#true} assume 1 == ~t3_pc~0; {78383#true} is VALID [2022-02-20 20:00:13,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {78383#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {78383#true} is VALID [2022-02-20 20:00:13,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {78383#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {78383#true} is VALID [2022-02-20 20:00:13,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {78383#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {78383#true} is VALID [2022-02-20 20:00:13,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {78383#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {78383#true} is VALID [2022-02-20 20:00:13,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {78383#true} assume true; {78383#true} is VALID [2022-02-20 20:00:13,441 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {78383#true} {78384#false} #969#return; {78384#false} is VALID [2022-02-20 20:00:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:13,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {78439#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {78383#true} is VALID [2022-02-20 20:00:13,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {78383#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {78383#true} assume !(1 == ~T2_E~0); {78383#true} is VALID [2022-02-20 20:00:13,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {78383#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {78383#true} assume 1 == ~E_M~0;~E_M~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {78383#true} assume 1 == ~E_1~0;~E_1~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {78383#true} assume 1 == ~E_2~0;~E_2~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {78383#true} assume 1 == ~E_3~0;~E_3~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {78383#true} assume true; {78383#true} is VALID [2022-02-20 20:00:13,447 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {78383#true} {78384#false} #971#return; {78384#false} is VALID [2022-02-20 20:00:13,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:13,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {78383#true} havoc ~__retres1~8; {78383#true} is VALID [2022-02-20 20:00:13,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {78383#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {78383#true} is VALID [2022-02-20 20:00:13,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {78383#true} #res := ~__retres1~8; {78383#true} is VALID [2022-02-20 20:00:13,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {78383#true} assume true; {78383#true} is VALID [2022-02-20 20:00:13,450 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78383#true} {78384#false} #973#return; {78384#false} is VALID [2022-02-20 20:00:13,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {78383#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret31#1, start_simulation2_#t~ret32#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} call update_channels2(); {78383#true} is VALID [2022-02-20 20:00:13,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {78383#true} assume true; {78383#true} is VALID [2022-02-20 20:00:13,453 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {78383#true} {78385#(= ~T3_E~0 ~M_E~0)} #965#return; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {78385#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:13,455 INFO L272 TraceCheckUtils]: 13: Hoare triple {78385#(= ~T3_E~0 ~M_E~0)} call fire_delta_events2(); {78439#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:13,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {78439#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:13,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T1_E~0); {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:13,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T2_E~0); {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:13,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {78440#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume true; {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:13,459 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {78441#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} {78385#(= ~T3_E~0 ~M_E~0)} #967#return; {78384#false} is VALID [2022-02-20 20:00:13,459 INFO L272 TraceCheckUtils]: 24: Hoare triple {78384#false} call activate_threads2(); {78442#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:13,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {78442#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {78383#true} is VALID [2022-02-20 20:00:13,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {78383#true} assume !(1 == ~m_pc~0); {78383#true} is VALID [2022-02-20 20:00:13,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {78383#true} is_master_triggered_~__retres1~4#1 := 0; {78383#true} is VALID [2022-02-20 20:00:13,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {78383#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {78383#true} is VALID [2022-02-20 20:00:13,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {78383#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {78383#true} is VALID [2022-02-20 20:00:13,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {78383#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {78383#true} is VALID [2022-02-20 20:00:13,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {78383#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {78383#true} is VALID [2022-02-20 20:00:13,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {78383#true} assume 1 == ~t1_pc~0; {78383#true} is VALID [2022-02-20 20:00:13,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {78383#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {78383#true} is VALID [2022-02-20 20:00:13,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {78383#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {78383#true} is VALID [2022-02-20 20:00:13,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {78383#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {78383#true} is VALID [2022-02-20 20:00:13,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {78383#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {78383#true} is VALID [2022-02-20 20:00:13,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {78383#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {78383#true} is VALID [2022-02-20 20:00:13,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {78383#true} assume !(1 == ~t2_pc~0); {78383#true} is VALID [2022-02-20 20:00:13,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {78383#true} is_transmit2_triggered_~__retres1~6#1 := 0; {78383#true} is VALID [2022-02-20 20:00:13,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {78383#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {78383#true} is VALID [2022-02-20 20:00:13,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {78383#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {78383#true} is VALID [2022-02-20 20:00:13,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {78383#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {78383#true} is VALID [2022-02-20 20:00:13,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {78383#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {78383#true} is VALID [2022-02-20 20:00:13,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {78383#true} assume 1 == ~t3_pc~0; {78383#true} is VALID [2022-02-20 20:00:13,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {78383#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {78383#true} is VALID [2022-02-20 20:00:13,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {78383#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {78383#true} is VALID [2022-02-20 20:00:13,461 INFO L290 TraceCheckUtils]: 47: Hoare triple {78383#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {78383#true} is VALID [2022-02-20 20:00:13,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {78383#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {78383#true} is VALID [2022-02-20 20:00:13,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {78383#true} assume true; {78383#true} is VALID [2022-02-20 20:00:13,462 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {78383#true} {78384#false} #969#return; {78384#false} is VALID [2022-02-20 20:00:13,462 INFO L272 TraceCheckUtils]: 51: Hoare triple {78384#false} call reset_delta_events2(); {78439#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:13,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {78439#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {78383#true} is VALID [2022-02-20 20:00:13,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {78383#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,462 INFO L290 TraceCheckUtils]: 54: Hoare triple {78383#true} assume !(1 == ~T2_E~0); {78383#true} is VALID [2022-02-20 20:00:13,462 INFO L290 TraceCheckUtils]: 55: Hoare triple {78383#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {78383#true} assume 1 == ~E_M~0;~E_M~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {78383#true} assume 1 == ~E_1~0;~E_1~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {78383#true} assume 1 == ~E_2~0;~E_2~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {78383#true} assume 1 == ~E_3~0;~E_3~0 := 2; {78383#true} is VALID [2022-02-20 20:00:13,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {78383#true} assume true; {78383#true} is VALID [2022-02-20 20:00:13,463 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {78383#true} {78384#false} #971#return; {78384#false} is VALID [2022-02-20 20:00:13,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {78384#false} assume !false; {78384#false} is VALID [2022-02-20 20:00:13,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {78384#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {78384#false} is VALID [2022-02-20 20:00:13,463 INFO L290 TraceCheckUtils]: 64: Hoare triple {78384#false} assume !false; {78384#false} is VALID [2022-02-20 20:00:13,463 INFO L272 TraceCheckUtils]: 65: Hoare triple {78384#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {78383#true} is VALID [2022-02-20 20:00:13,463 INFO L290 TraceCheckUtils]: 66: Hoare triple {78383#true} havoc ~__retres1~8; {78383#true} is VALID [2022-02-20 20:00:13,464 INFO L290 TraceCheckUtils]: 67: Hoare triple {78383#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {78383#true} is VALID [2022-02-20 20:00:13,464 INFO L290 TraceCheckUtils]: 68: Hoare triple {78383#true} #res := ~__retres1~8; {78383#true} is VALID [2022-02-20 20:00:13,464 INFO L290 TraceCheckUtils]: 69: Hoare triple {78383#true} assume true; {78383#true} is VALID [2022-02-20 20:00:13,464 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {78383#true} {78384#false} #973#return; {78384#false} is VALID [2022-02-20 20:00:13,464 INFO L290 TraceCheckUtils]: 71: Hoare triple {78384#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {78384#false} is VALID [2022-02-20 20:00:13,464 INFO L290 TraceCheckUtils]: 72: Hoare triple {78384#false} assume 0 != eval2_~tmp~5#1; {78384#false} is VALID [2022-02-20 20:00:13,464 INFO L290 TraceCheckUtils]: 73: Hoare triple {78384#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {78384#false} is VALID [2022-02-20 20:00:13,464 INFO L290 TraceCheckUtils]: 74: Hoare triple {78384#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {78384#false} is VALID [2022-02-20 20:00:13,464 INFO L290 TraceCheckUtils]: 75: Hoare triple {78384#false} assume !(0 == ~m_pc~0); {78384#false} is VALID [2022-02-20 20:00:13,464 INFO L290 TraceCheckUtils]: 76: Hoare triple {78384#false} assume 1 == ~m_pc~0; {78384#false} is VALID [2022-02-20 20:00:13,465 INFO L290 TraceCheckUtils]: 77: Hoare triple {78384#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {78384#false} is VALID [2022-02-20 20:00:13,465 INFO L290 TraceCheckUtils]: 78: Hoare triple {78384#false} assume !false; {78384#false} is VALID [2022-02-20 20:00:13,465 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 20:00:13,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:13,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356101656] [2022-02-20 20:00:13,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356101656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:13,465 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:13,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:13,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615202020] [2022-02-20 20:00:13,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:13,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:13,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:13,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:13,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:13,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:13,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:13,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:13,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:13,517 INFO L87 Difference]: Start difference. First operand 2334 states and 3138 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:17,235 INFO L93 Difference]: Finished difference Result 3901 states and 5512 transitions. [2022-02-20 20:00:17,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:17,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 948 transitions. [2022-02-20 20:00:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 948 transitions. [2022-02-20 20:00:17,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 948 transitions. [2022-02-20 20:00:17,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 948 edges. 948 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:18,393 INFO L225 Difference]: With dead ends: 3901 [2022-02-20 20:00:18,394 INFO L226 Difference]: Without dead ends: 3218 [2022-02-20 20:00:18,395 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 20:00:18,396 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 748 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:18,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1456 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2022-02-20 20:00:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 2869. [2022-02-20 20:00:18,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:18,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3218 states. Second operand has 2869 states, 2340 states have (on average 1.385042735042735) internal successors, (3241), 2373 states have internal predecessors, (3241), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:18,519 INFO L74 IsIncluded]: Start isIncluded. First operand 3218 states. Second operand has 2869 states, 2340 states have (on average 1.385042735042735) internal successors, (3241), 2373 states have internal predecessors, (3241), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:18,521 INFO L87 Difference]: Start difference. First operand 3218 states. Second operand has 2869 states, 2340 states have (on average 1.385042735042735) internal successors, (3241), 2373 states have internal predecessors, (3241), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:18,826 INFO L93 Difference]: Finished difference Result 3218 states and 4487 transitions. [2022-02-20 20:00:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4487 transitions. [2022-02-20 20:00:18,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:18,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:18,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 2869 states, 2340 states have (on average 1.385042735042735) internal successors, (3241), 2373 states have internal predecessors, (3241), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) Second operand 3218 states. [2022-02-20 20:00:18,838 INFO L87 Difference]: Start difference. First operand has 2869 states, 2340 states have (on average 1.385042735042735) internal successors, (3241), 2373 states have internal predecessors, (3241), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) Second operand 3218 states. [2022-02-20 20:00:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,156 INFO L93 Difference]: Finished difference Result 3218 states and 4487 transitions. [2022-02-20 20:00:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4487 transitions. [2022-02-20 20:00:19,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:19,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:19,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:19,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2340 states have (on average 1.385042735042735) internal successors, (3241), 2373 states have internal predecessors, (3241), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 3934 transitions. [2022-02-20 20:00:19,494 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 3934 transitions. Word has length 79 [2022-02-20 20:00:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:19,495 INFO L470 AbstractCegarLoop]: Abstraction has 2869 states and 3934 transitions. [2022-02-20 20:00:19,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3934 transitions. [2022-02-20 20:00:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 20:00:19,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:19,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:19,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:00:19,496 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:19,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1394823370, now seen corresponding path program 1 times [2022-02-20 20:00:19,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:19,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832304761] [2022-02-20 20:00:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:19,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {93905#true} assume true; {93905#true} is VALID [2022-02-20 20:00:19,532 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {93905#true} {93907#(not (= ~E_M~0 0))} #965#return; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {93961#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {93962#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:19,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {93962#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {93962#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:19,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {93962#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {93962#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:19,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {93962#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T3_E~0); {93962#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:19,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {93962#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {93963#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {93963#(= |old(~E_M~0)| 0)} assume !(0 == ~E_2~0); {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {93963#(= |old(~E_M~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {93963#(= |old(~E_M~0)| 0)} assume true; {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,556 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {93963#(= |old(~E_M~0)| 0)} {93907#(not (= ~E_M~0 0))} #967#return; {93906#false} is VALID [2022-02-20 20:00:19,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {93964#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {93905#true} is VALID [2022-02-20 20:00:19,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {93905#true} assume !(1 == ~m_pc~0); {93905#true} is VALID [2022-02-20 20:00:19,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {93905#true} is_master_triggered_~__retres1~4#1 := 0; {93905#true} is VALID [2022-02-20 20:00:19,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {93905#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {93905#true} is VALID [2022-02-20 20:00:19,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {93905#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {93905#true} is VALID [2022-02-20 20:00:19,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {93905#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {93905#true} is VALID [2022-02-20 20:00:19,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {93905#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {93905#true} is VALID [2022-02-20 20:00:19,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {93905#true} assume 1 == ~t1_pc~0; {93905#true} is VALID [2022-02-20 20:00:19,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {93905#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {93905#true} is VALID [2022-02-20 20:00:19,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {93905#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {93905#true} is VALID [2022-02-20 20:00:19,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {93905#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {93905#true} is VALID [2022-02-20 20:00:19,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {93905#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {93905#true} is VALID [2022-02-20 20:00:19,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {93905#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {93905#true} is VALID [2022-02-20 20:00:19,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {93905#true} assume !(1 == ~t2_pc~0); {93905#true} is VALID [2022-02-20 20:00:19,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {93905#true} is_transmit2_triggered_~__retres1~6#1 := 0; {93905#true} is VALID [2022-02-20 20:00:19,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {93905#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {93905#true} is VALID [2022-02-20 20:00:19,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {93905#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {93905#true} is VALID [2022-02-20 20:00:19,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {93905#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {93905#true} is VALID [2022-02-20 20:00:19,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {93905#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {93905#true} is VALID [2022-02-20 20:00:19,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {93905#true} assume 1 == ~t3_pc~0; {93905#true} is VALID [2022-02-20 20:00:19,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {93905#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {93905#true} is VALID [2022-02-20 20:00:19,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {93905#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {93905#true} is VALID [2022-02-20 20:00:19,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {93905#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {93905#true} is VALID [2022-02-20 20:00:19,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {93905#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {93905#true} is VALID [2022-02-20 20:00:19,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {93905#true} assume true; {93905#true} is VALID [2022-02-20 20:00:19,574 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {93905#true} {93906#false} #969#return; {93906#false} is VALID [2022-02-20 20:00:19,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {93961#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {93905#true} is VALID [2022-02-20 20:00:19,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {93905#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {93905#true} assume !(1 == ~T2_E~0); {93905#true} is VALID [2022-02-20 20:00:19,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {93905#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {93905#true} assume 1 == ~E_M~0;~E_M~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {93905#true} assume 1 == ~E_1~0;~E_1~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {93905#true} assume 1 == ~E_2~0;~E_2~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {93905#true} assume 1 == ~E_3~0;~E_3~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {93905#true} assume true; {93905#true} is VALID [2022-02-20 20:00:19,581 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {93905#true} {93906#false} #971#return; {93906#false} is VALID [2022-02-20 20:00:19,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {93905#true} havoc ~__retres1~8; {93905#true} is VALID [2022-02-20 20:00:19,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {93905#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {93905#true} is VALID [2022-02-20 20:00:19,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {93905#true} #res := ~__retres1~8; {93905#true} is VALID [2022-02-20 20:00:19,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {93905#true} assume true; {93905#true} is VALID [2022-02-20 20:00:19,587 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {93905#true} {93906#false} #973#return; {93906#false} is VALID [2022-02-20 20:00:19,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {93905#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {93907#(not (= ~E_M~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {93907#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {93907#(not (= ~E_M~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret31#1, start_simulation2_#t~ret32#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {93907#(not (= ~E_M~0 0))} call update_channels2(); {93905#true} is VALID [2022-02-20 20:00:19,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {93905#true} assume true; {93905#true} is VALID [2022-02-20 20:00:19,589 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {93905#true} {93907#(not (= ~E_M~0 0))} #965#return; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {93907#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {93907#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {93907#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {93907#(not (= ~E_M~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {93907#(not (= ~E_M~0 0))} assume 1 == ~t3_i~0;~t3_st~0 := 0; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {93907#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {93907#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:19,591 INFO L272 TraceCheckUtils]: 13: Hoare triple {93907#(not (= ~E_M~0 0))} call fire_delta_events2(); {93961#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:19,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {93961#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {93962#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:19,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {93962#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {93962#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:19,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {93962#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {93962#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:19,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {93962#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T3_E~0); {93962#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:19,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {93962#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {93963#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {93963#(= |old(~E_M~0)| 0)} assume !(0 == ~E_2~0); {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {93963#(= |old(~E_M~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {93963#(= |old(~E_M~0)| 0)} assume true; {93963#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:19,595 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {93963#(= |old(~E_M~0)| 0)} {93907#(not (= ~E_M~0 0))} #967#return; {93906#false} is VALID [2022-02-20 20:00:19,595 INFO L272 TraceCheckUtils]: 24: Hoare triple {93906#false} call activate_threads2(); {93964#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:19,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {93964#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {93905#true} is VALID [2022-02-20 20:00:19,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {93905#true} assume !(1 == ~m_pc~0); {93905#true} is VALID [2022-02-20 20:00:19,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {93905#true} is_master_triggered_~__retres1~4#1 := 0; {93905#true} is VALID [2022-02-20 20:00:19,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {93905#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {93905#true} is VALID [2022-02-20 20:00:19,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {93905#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {93905#true} is VALID [2022-02-20 20:00:19,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {93905#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {93905#true} is VALID [2022-02-20 20:00:19,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {93905#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {93905#true} is VALID [2022-02-20 20:00:19,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {93905#true} assume 1 == ~t1_pc~0; {93905#true} is VALID [2022-02-20 20:00:19,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {93905#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {93905#true} is VALID [2022-02-20 20:00:19,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {93905#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {93905#true} is VALID [2022-02-20 20:00:19,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {93905#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {93905#true} is VALID [2022-02-20 20:00:19,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {93905#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {93905#true} is VALID [2022-02-20 20:00:19,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {93905#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {93905#true} is VALID [2022-02-20 20:00:19,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {93905#true} assume !(1 == ~t2_pc~0); {93905#true} is VALID [2022-02-20 20:00:19,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {93905#true} is_transmit2_triggered_~__retres1~6#1 := 0; {93905#true} is VALID [2022-02-20 20:00:19,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {93905#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {93905#true} is VALID [2022-02-20 20:00:19,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {93905#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {93905#true} is VALID [2022-02-20 20:00:19,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {93905#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {93905#true} is VALID [2022-02-20 20:00:19,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {93905#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {93905#true} is VALID [2022-02-20 20:00:19,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {93905#true} assume 1 == ~t3_pc~0; {93905#true} is VALID [2022-02-20 20:00:19,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {93905#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {93905#true} is VALID [2022-02-20 20:00:19,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {93905#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {93905#true} is VALID [2022-02-20 20:00:19,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {93905#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {93905#true} is VALID [2022-02-20 20:00:19,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {93905#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {93905#true} is VALID [2022-02-20 20:00:19,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {93905#true} assume true; {93905#true} is VALID [2022-02-20 20:00:19,598 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {93905#true} {93906#false} #969#return; {93906#false} is VALID [2022-02-20 20:00:19,598 INFO L272 TraceCheckUtils]: 51: Hoare triple {93906#false} call reset_delta_events2(); {93961#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:19,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {93961#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {93905#true} is VALID [2022-02-20 20:00:19,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {93905#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {93905#true} assume !(1 == ~T2_E~0); {93905#true} is VALID [2022-02-20 20:00:19,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {93905#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {93905#true} assume 1 == ~E_M~0;~E_M~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {93905#true} assume 1 == ~E_1~0;~E_1~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {93905#true} assume 1 == ~E_2~0;~E_2~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {93905#true} assume 1 == ~E_3~0;~E_3~0 := 2; {93905#true} is VALID [2022-02-20 20:00:19,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {93905#true} assume true; {93905#true} is VALID [2022-02-20 20:00:19,599 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {93905#true} {93906#false} #971#return; {93906#false} is VALID [2022-02-20 20:00:19,599 INFO L290 TraceCheckUtils]: 62: Hoare triple {93906#false} assume !false; {93906#false} is VALID [2022-02-20 20:00:19,599 INFO L290 TraceCheckUtils]: 63: Hoare triple {93906#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {93906#false} is VALID [2022-02-20 20:00:19,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {93906#false} assume !false; {93906#false} is VALID [2022-02-20 20:00:19,599 INFO L272 TraceCheckUtils]: 65: Hoare triple {93906#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {93905#true} is VALID [2022-02-20 20:00:19,599 INFO L290 TraceCheckUtils]: 66: Hoare triple {93905#true} havoc ~__retres1~8; {93905#true} is VALID [2022-02-20 20:00:19,600 INFO L290 TraceCheckUtils]: 67: Hoare triple {93905#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {93905#true} is VALID [2022-02-20 20:00:19,600 INFO L290 TraceCheckUtils]: 68: Hoare triple {93905#true} #res := ~__retres1~8; {93905#true} is VALID [2022-02-20 20:00:19,600 INFO L290 TraceCheckUtils]: 69: Hoare triple {93905#true} assume true; {93905#true} is VALID [2022-02-20 20:00:19,600 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {93905#true} {93906#false} #973#return; {93906#false} is VALID [2022-02-20 20:00:19,600 INFO L290 TraceCheckUtils]: 71: Hoare triple {93906#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {93906#false} is VALID [2022-02-20 20:00:19,600 INFO L290 TraceCheckUtils]: 72: Hoare triple {93906#false} assume 0 != eval2_~tmp~5#1; {93906#false} is VALID [2022-02-20 20:00:19,600 INFO L290 TraceCheckUtils]: 73: Hoare triple {93906#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {93906#false} is VALID [2022-02-20 20:00:19,600 INFO L290 TraceCheckUtils]: 74: Hoare triple {93906#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {93906#false} is VALID [2022-02-20 20:00:19,600 INFO L290 TraceCheckUtils]: 75: Hoare triple {93906#false} assume !(0 == ~m_pc~0); {93906#false} is VALID [2022-02-20 20:00:19,601 INFO L290 TraceCheckUtils]: 76: Hoare triple {93906#false} assume 1 == ~m_pc~0; {93906#false} is VALID [2022-02-20 20:00:19,601 INFO L290 TraceCheckUtils]: 77: Hoare triple {93906#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {93906#false} is VALID [2022-02-20 20:00:19,601 INFO L290 TraceCheckUtils]: 78: Hoare triple {93906#false} assume !false; {93906#false} is VALID [2022-02-20 20:00:19,601 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 20:00:19,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:19,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832304761] [2022-02-20 20:00:19,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832304761] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:19,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:19,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:19,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765953045] [2022-02-20 20:00:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:19,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:19,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:19,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:19,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:19,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:19,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:19,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:19,657 INFO L87 Difference]: Start difference. First operand 2869 states and 3934 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:22,272 INFO L93 Difference]: Finished difference Result 4433 states and 6327 transitions. [2022-02-20 20:00:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:00:22,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2022-02-20 20:00:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2022-02-20 20:00:22,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 668 transitions. [2022-02-20 20:00:22,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 668 edges. 668 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:23,198 INFO L225 Difference]: With dead ends: 4433 [2022-02-20 20:00:23,198 INFO L226 Difference]: Without dead ends: 3215 [2022-02-20 20:00:23,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:23,201 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 624 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:23,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 950 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 20:00:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2022-02-20 20:00:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 2869. [2022-02-20 20:00:23,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:23,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3215 states. Second operand has 2869 states, 2340 states have (on average 1.3811965811965812) internal successors, (3232), 2373 states have internal predecessors, (3232), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:23,345 INFO L74 IsIncluded]: Start isIncluded. First operand 3215 states. Second operand has 2869 states, 2340 states have (on average 1.3811965811965812) internal successors, (3232), 2373 states have internal predecessors, (3232), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:23,347 INFO L87 Difference]: Start difference. First operand 3215 states. Second operand has 2869 states, 2340 states have (on average 1.3811965811965812) internal successors, (3232), 2373 states have internal predecessors, (3232), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:23,645 INFO L93 Difference]: Finished difference Result 3215 states and 4491 transitions. [2022-02-20 20:00:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4491 transitions. [2022-02-20 20:00:23,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:23,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:23,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 2869 states, 2340 states have (on average 1.3811965811965812) internal successors, (3232), 2373 states have internal predecessors, (3232), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) Second operand 3215 states. [2022-02-20 20:00:23,655 INFO L87 Difference]: Start difference. First operand has 2869 states, 2340 states have (on average 1.3811965811965812) internal successors, (3232), 2373 states have internal predecessors, (3232), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) Second operand 3215 states. [2022-02-20 20:00:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:23,942 INFO L93 Difference]: Finished difference Result 3215 states and 4491 transitions. [2022-02-20 20:00:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4491 transitions. [2022-02-20 20:00:23,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:23,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:23,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:23,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2340 states have (on average 1.3811965811965812) internal successors, (3232), 2373 states have internal predecessors, (3232), 305 states have call successors, (305), 187 states have call predecessors, (305), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 3925 transitions. [2022-02-20 20:00:24,296 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 3925 transitions. Word has length 79 [2022-02-20 20:00:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:24,306 INFO L470 AbstractCegarLoop]: Abstraction has 2869 states and 3925 transitions. [2022-02-20 20:00:24,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3925 transitions. [2022-02-20 20:00:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 20:00:24,307 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:24,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:24,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 20:00:24,308 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:24,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash 566751288, now seen corresponding path program 1 times [2022-02-20 20:00:24,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:24,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123899050] [2022-02-20 20:00:24,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:24,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {110114#true} assume true; {110114#true} is VALID [2022-02-20 20:00:24,347 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {110114#true} {110116#(= ~E_1~0 ~M_E~0)} #965#return; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {110170#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:24,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:24,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:24,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:24,377 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {110116#(= ~E_1~0 ~M_E~0)} #967#return; {110115#false} is VALID [2022-02-20 20:00:24,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {110173#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {110114#true} is VALID [2022-02-20 20:00:24,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {110114#true} assume !(1 == ~m_pc~0); {110114#true} is VALID [2022-02-20 20:00:24,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {110114#true} is_master_triggered_~__retres1~4#1 := 0; {110114#true} is VALID [2022-02-20 20:00:24,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {110114#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {110114#true} is VALID [2022-02-20 20:00:24,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {110114#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {110114#true} is VALID [2022-02-20 20:00:24,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {110114#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {110114#true} is VALID [2022-02-20 20:00:24,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {110114#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {110114#true} is VALID [2022-02-20 20:00:24,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {110114#true} assume 1 == ~t1_pc~0; {110114#true} is VALID [2022-02-20 20:00:24,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {110114#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {110114#true} is VALID [2022-02-20 20:00:24,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {110114#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {110114#true} is VALID [2022-02-20 20:00:24,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {110114#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {110114#true} is VALID [2022-02-20 20:00:24,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {110114#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {110114#true} is VALID [2022-02-20 20:00:24,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {110114#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {110114#true} is VALID [2022-02-20 20:00:24,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {110114#true} assume !(1 == ~t2_pc~0); {110114#true} is VALID [2022-02-20 20:00:24,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {110114#true} is_transmit2_triggered_~__retres1~6#1 := 0; {110114#true} is VALID [2022-02-20 20:00:24,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {110114#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {110114#true} is VALID [2022-02-20 20:00:24,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {110114#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {110114#true} is VALID [2022-02-20 20:00:24,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {110114#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {110114#true} is VALID [2022-02-20 20:00:24,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {110114#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {110114#true} is VALID [2022-02-20 20:00:24,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {110114#true} assume 1 == ~t3_pc~0; {110114#true} is VALID [2022-02-20 20:00:24,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {110114#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {110114#true} is VALID [2022-02-20 20:00:24,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {110114#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {110114#true} is VALID [2022-02-20 20:00:24,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {110114#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {110114#true} is VALID [2022-02-20 20:00:24,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {110114#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {110114#true} is VALID [2022-02-20 20:00:24,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {110114#true} assume true; {110114#true} is VALID [2022-02-20 20:00:24,403 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {110114#true} {110115#false} #969#return; {110115#false} is VALID [2022-02-20 20:00:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {110170#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {110114#true} is VALID [2022-02-20 20:00:24,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {110114#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {110114#true} assume !(1 == ~T2_E~0); {110114#true} is VALID [2022-02-20 20:00:24,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {110114#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,407 INFO L290 TraceCheckUtils]: 4: Hoare triple {110114#true} assume 1 == ~E_M~0;~E_M~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {110114#true} assume 1 == ~E_1~0;~E_1~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {110114#true} assume 1 == ~E_2~0;~E_2~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {110114#true} assume 1 == ~E_3~0;~E_3~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {110114#true} assume true; {110114#true} is VALID [2022-02-20 20:00:24,408 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {110114#true} {110115#false} #971#return; {110115#false} is VALID [2022-02-20 20:00:24,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {110114#true} havoc ~__retres1~8; {110114#true} is VALID [2022-02-20 20:00:24,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {110114#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {110114#true} is VALID [2022-02-20 20:00:24,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {110114#true} #res := ~__retres1~8; {110114#true} is VALID [2022-02-20 20:00:24,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {110114#true} assume true; {110114#true} is VALID [2022-02-20 20:00:24,411 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {110114#true} {110115#false} #973#return; {110115#false} is VALID [2022-02-20 20:00:24,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {110114#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet33#1, main_#t~ret34#1, main_#t~ret35#1;assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret31#1, start_simulation2_#t~ret32#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} call update_channels2(); {110114#true} is VALID [2022-02-20 20:00:24,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {110114#true} assume true; {110114#true} is VALID [2022-02-20 20:00:24,413 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {110114#true} {110116#(= ~E_1~0 ~M_E~0)} #965#return; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {110116#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:24,415 INFO L272 TraceCheckUtils]: 13: Hoare triple {110116#(= ~E_1~0 ~M_E~0)} call fire_delta_events2(); {110170#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:24,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {110170#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:24,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {110171#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:24,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:24,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:24,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:24,418 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {110172#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {110116#(= ~E_1~0 ~M_E~0)} #967#return; {110115#false} is VALID [2022-02-20 20:00:24,418 INFO L272 TraceCheckUtils]: 24: Hoare triple {110115#false} call activate_threads2(); {110173#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:24,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {110173#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {110114#true} is VALID [2022-02-20 20:00:24,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {110114#true} assume !(1 == ~m_pc~0); {110114#true} is VALID [2022-02-20 20:00:24,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {110114#true} is_master_triggered_~__retres1~4#1 := 0; {110114#true} is VALID [2022-02-20 20:00:24,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {110114#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {110114#true} is VALID [2022-02-20 20:00:24,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {110114#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {110114#true} is VALID [2022-02-20 20:00:24,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {110114#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {110114#true} is VALID [2022-02-20 20:00:24,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {110114#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {110114#true} is VALID [2022-02-20 20:00:24,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {110114#true} assume 1 == ~t1_pc~0; {110114#true} is VALID [2022-02-20 20:00:24,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {110114#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {110114#true} is VALID [2022-02-20 20:00:24,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {110114#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {110114#true} is VALID [2022-02-20 20:00:24,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {110114#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {110114#true} is VALID [2022-02-20 20:00:24,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {110114#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {110114#true} is VALID [2022-02-20 20:00:24,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {110114#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {110114#true} is VALID [2022-02-20 20:00:24,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {110114#true} assume !(1 == ~t2_pc~0); {110114#true} is VALID [2022-02-20 20:00:24,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {110114#true} is_transmit2_triggered_~__retres1~6#1 := 0; {110114#true} is VALID [2022-02-20 20:00:24,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {110114#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {110114#true} is VALID [2022-02-20 20:00:24,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {110114#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {110114#true} is VALID [2022-02-20 20:00:24,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {110114#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {110114#true} is VALID [2022-02-20 20:00:24,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {110114#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {110114#true} is VALID [2022-02-20 20:00:24,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {110114#true} assume 1 == ~t3_pc~0; {110114#true} is VALID [2022-02-20 20:00:24,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {110114#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {110114#true} is VALID [2022-02-20 20:00:24,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {110114#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {110114#true} is VALID [2022-02-20 20:00:24,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {110114#true} #t~ret29#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___2~0#1 := #t~ret29#1;havoc #t~ret29#1; {110114#true} is VALID [2022-02-20 20:00:24,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {110114#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {110114#true} is VALID [2022-02-20 20:00:24,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {110114#true} assume true; {110114#true} is VALID [2022-02-20 20:00:24,421 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {110114#true} {110115#false} #969#return; {110115#false} is VALID [2022-02-20 20:00:24,421 INFO L272 TraceCheckUtils]: 51: Hoare triple {110115#false} call reset_delta_events2(); {110170#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:24,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {110170#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {110114#true} is VALID [2022-02-20 20:00:24,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {110114#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {110114#true} assume !(1 == ~T2_E~0); {110114#true} is VALID [2022-02-20 20:00:24,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {110114#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {110114#true} assume 1 == ~E_M~0;~E_M~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {110114#true} assume 1 == ~E_1~0;~E_1~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {110114#true} assume 1 == ~E_2~0;~E_2~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {110114#true} assume 1 == ~E_3~0;~E_3~0 := 2; {110114#true} is VALID [2022-02-20 20:00:24,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {110114#true} assume true; {110114#true} is VALID [2022-02-20 20:00:24,422 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {110114#true} {110115#false} #971#return; {110115#false} is VALID [2022-02-20 20:00:24,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {110115#false} assume !false; {110115#false} is VALID [2022-02-20 20:00:24,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {110115#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {110115#false} is VALID [2022-02-20 20:00:24,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {110115#false} assume !false; {110115#false} is VALID [2022-02-20 20:00:24,423 INFO L272 TraceCheckUtils]: 65: Hoare triple {110115#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {110114#true} is VALID [2022-02-20 20:00:24,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {110114#true} havoc ~__retres1~8; {110114#true} is VALID [2022-02-20 20:00:24,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {110114#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {110114#true} is VALID [2022-02-20 20:00:24,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {110114#true} #res := ~__retres1~8; {110114#true} is VALID [2022-02-20 20:00:24,423 INFO L290 TraceCheckUtils]: 69: Hoare triple {110114#true} assume true; {110114#true} is VALID [2022-02-20 20:00:24,423 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {110114#true} {110115#false} #973#return; {110115#false} is VALID [2022-02-20 20:00:24,423 INFO L290 TraceCheckUtils]: 71: Hoare triple {110115#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {110115#false} is VALID [2022-02-20 20:00:24,423 INFO L290 TraceCheckUtils]: 72: Hoare triple {110115#false} assume 0 != eval2_~tmp~5#1; {110115#false} is VALID [2022-02-20 20:00:24,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {110115#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {110115#false} is VALID [2022-02-20 20:00:24,424 INFO L290 TraceCheckUtils]: 74: Hoare triple {110115#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {110115#false} is VALID [2022-02-20 20:00:24,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {110115#false} assume !(0 == ~m_pc~0); {110115#false} is VALID [2022-02-20 20:00:24,424 INFO L290 TraceCheckUtils]: 76: Hoare triple {110115#false} assume 1 == ~m_pc~0; {110115#false} is VALID [2022-02-20 20:00:24,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {110115#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {110115#false} is VALID [2022-02-20 20:00:24,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {110115#false} assume !false; {110115#false} is VALID [2022-02-20 20:00:24,425 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 20:00:24,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:24,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123899050] [2022-02-20 20:00:24,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123899050] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:24,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:24,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:24,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347953092] [2022-02-20 20:00:24,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:24,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:24,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:24,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:24,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:24,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:24,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:24,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:24,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:24,465 INFO L87 Difference]: Start difference. First operand 2869 states and 3925 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:28,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:28,786 INFO L93 Difference]: Finished difference Result 6063 states and 8712 transitions. [2022-02-20 20:00:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 20:00:28,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2022-02-20 20:00:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 997 transitions. [2022-02-20 20:00:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 20:00:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 997 transitions. [2022-02-20 20:00:28,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 997 transitions. [2022-02-20 20:00:29,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 997 edges. 997 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:30,490 INFO L225 Difference]: With dead ends: 6063 [2022-02-20 20:00:30,490 INFO L226 Difference]: Without dead ends: 4845 [2022-02-20 20:00:30,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:30,493 INFO L933 BasicCegarLoop]: 469 mSDtfsCounter, 834 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:30,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 1430 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2022-02-20 20:00:30,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 3888. [2022-02-20 20:00:30,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:30,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4845 states. Second operand has 3888 states, 3215 states have (on average 1.4043545878693624) internal successors, (4515), 3256 states have internal predecessors, (4515), 393 states have call successors, (393), 235 states have call predecessors, (393), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538) [2022-02-20 20:00:30,666 INFO L74 IsIncluded]: Start isIncluded. First operand 4845 states. Second operand has 3888 states, 3215 states have (on average 1.4043545878693624) internal successors, (4515), 3256 states have internal predecessors, (4515), 393 states have call successors, (393), 235 states have call predecessors, (393), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538) [2022-02-20 20:00:30,669 INFO L87 Difference]: Start difference. First operand 4845 states. Second operand has 3888 states, 3215 states have (on average 1.4043545878693624) internal successors, (4515), 3256 states have internal predecessors, (4515), 393 states have call successors, (393), 235 states have call predecessors, (393), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538)